Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789500518.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldRVs-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789500518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 370K May 18 16:43 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 ShieldRVs-PT-030B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717004474317

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 17:41:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 17:41:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:41:16] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-29 17:41:16] [INFO ] Transformed 1203 places.
[2024-05-29 17:41:16] [INFO ] Transformed 1353 transitions.
[2024-05-29 17:41:16] [INFO ] Found NUPN structural information;
[2024-05-29 17:41:16] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-030B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Discarding 201 places :
Symmetric choice reduction at 0 with 201 rule applications. Total rules 201 place count 1002 transition count 1152
Iterating global reduction 0 with 201 rules applied. Total rules applied 402 place count 1002 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 403 place count 1001 transition count 1151
Iterating global reduction 0 with 1 rules applied. Total rules applied 404 place count 1001 transition count 1151
Applied a total of 404 rules in 202 ms. Remains 1001 /1203 variables (removed 202) and now considering 1151/1353 (removed 202) transitions.
// Phase 1: matrix 1151 rows 1001 cols
[2024-05-29 17:41:17] [INFO ] Computed 121 invariants in 32 ms
[2024-05-29 17:41:17] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-29 17:41:17] [INFO ] Invariant cache hit.
[2024-05-29 17:41:18] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
[2024-05-29 17:41:18] [INFO ] Invariant cache hit.
[2024-05-29 17:41:19] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1203 places, 1151/1353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2369 ms. Remains : 1001/1203 places, 1151/1353 transitions.
Support contains 42 out of 1001 places after structural reductions.
[2024-05-29 17:41:19] [INFO ] Flatten gal took : 112 ms
[2024-05-29 17:41:19] [INFO ] Flatten gal took : 65 ms
[2024-05-29 17:41:19] [INFO ] Input system was already deterministic with 1151 transitions.
Support contains 41 out of 1001 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 17:41:20] [INFO ] Invariant cache hit.
[2024-05-29 17:41:20] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2024-05-29 17:41:21] [INFO ] After 716ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-29 17:41:21] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 6 ms to minimize.
[2024-05-29 17:41:22] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:41:22] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:41:22] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 1 ms to minimize.
[2024-05-29 17:41:23] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 2 ms to minimize.
[2024-05-29 17:41:23] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 3 ms to minimize.
[2024-05-29 17:41:23] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 1 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 1 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 1 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 50 places in 265 ms of which 0 ms to minimize.
[2024-05-29 17:41:24] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 0 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 1 ms to minimize.
[2024-05-29 17:41:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4540 ms
[2024-05-29 17:41:25] [INFO ] After 5307ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 17:41:25] [INFO ] After 5732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 17:41:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2024-05-29 17:41:27] [INFO ] After 703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2024-05-29 17:41:27] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 0 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 0 ms to minimize.
[2024-05-29 17:41:28] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 1 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:41:29] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 1 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 1 ms to minimize.
[2024-05-29 17:41:30] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 1 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:41:31] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 1 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5342 ms
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 0 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2024-05-29 17:41:32] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 0 ms to minimize.
[2024-05-29 17:41:33] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2024-05-29 17:41:33] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2024-05-29 17:41:33] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 0 ms to minimize.
[2024-05-29 17:41:33] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2024-05-29 17:41:33] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2024-05-29 17:41:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1244 ms
[2024-05-29 17:41:33] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 0 ms to minimize.
[2024-05-29 17:41:34] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2024-05-29 17:41:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2024-05-29 17:41:34] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-05-29 17:41:34] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2024-05-29 17:41:34] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2024-05-29 17:41:34] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2024-05-29 17:41:35] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2024-05-29 17:41:35] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-29 17:41:35] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 3 ms to minimize.
[2024-05-29 17:41:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1128 ms
[2024-05-29 17:41:35] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 6 ms to minimize.
[2024-05-29 17:41:35] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2024-05-29 17:41:35] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2024-05-29 17:41:36] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2024-05-29 17:41:36] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:41:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 679 ms
[2024-05-29 17:41:36] [INFO ] After 9909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 310 ms.
[2024-05-29 17:41:36] [INFO ] After 10583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 148 ms.
Support contains 6 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1001 transition count 1030
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 880 transition count 1030
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 242 place count 880 transition count 881
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 540 place count 731 transition count 881
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 545 place count 726 transition count 876
Iterating global reduction 2 with 5 rules applied. Total rules applied 550 place count 726 transition count 876
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 550 place count 726 transition count 875
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 725 transition count 875
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 23 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1148 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 2 with 61 rules applied. Total rules applied 1209 place count 427 transition count 577
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1210 place count 426 transition count 576
Applied a total of 1210 rules in 393 ms. Remains 426 /1001 variables (removed 575) and now considering 576/1151 (removed 575) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 426/1001 places, 576/1151 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Finished Best-First random walk after 2610 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=372 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 243 stabilizing places and 243 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(G(p0))))))))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 993 transition count 1143
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 993 transition count 1143
Applied a total of 16 rules in 38 ms. Remains 993 /1001 variables (removed 8) and now considering 1143/1151 (removed 8) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2024-05-29 17:41:37] [INFO ] Computed 121 invariants in 13 ms
[2024-05-29 17:41:38] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-29 17:41:38] [INFO ] Invariant cache hit.
[2024-05-29 17:41:39] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-05-29 17:41:39] [INFO ] Invariant cache hit.
[2024-05-29 17:41:39] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/1001 places, 1143/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1915 ms. Remains : 993/1001 places, 1143/1151 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 280 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s862 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 3 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-00 finished in 2266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 993 transition count 1143
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 993 transition count 1143
Applied a total of 16 rules in 40 ms. Remains 993 /1001 variables (removed 8) and now considering 1143/1151 (removed 8) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2024-05-29 17:41:40] [INFO ] Computed 121 invariants in 14 ms
[2024-05-29 17:41:40] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-29 17:41:40] [INFO ] Invariant cache hit.
[2024-05-29 17:41:41] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
[2024-05-29 17:41:41] [INFO ] Invariant cache hit.
[2024-05-29 17:41:41] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/1001 places, 1143/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1992 ms. Remains : 993/1001 places, 1143/1151 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (NEQ s77 1) (NEQ s139 1)), p0:(EQ s77 0)], 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]]
Product exploration explored 100000 steps with 78 reset in 521 ms.
Product exploration explored 100000 steps with 77 reset in 513 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Detected a total of 240/993 stabilizing places and 240/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 136 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 17:41:43] [INFO ] Invariant cache hit.
[2024-05-29 17:41:44] [INFO ] [Real]Absence check using 121 positive place invariants in 38 ms returned sat
[2024-05-29 17:41:44] [INFO ] After 491ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2024-05-29 17:41:44] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 0 ms to minimize.
[2024-05-29 17:41:45] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2024-05-29 17:41:45] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2024-05-29 17:41:45] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 0 ms to minimize.
[2024-05-29 17:41:45] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 3 ms to minimize.
[2024-05-29 17:41:46] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2024-05-29 17:41:46] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 0 ms to minimize.
[2024-05-29 17:41:46] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 0 ms to minimize.
[2024-05-29 17:41:46] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 1 ms to minimize.
[2024-05-29 17:41:46] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2024-05-29 17:41:47] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 0 ms to minimize.
[2024-05-29 17:41:47] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 1 ms to minimize.
[2024-05-29 17:41:47] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 0 ms to minimize.
[2024-05-29 17:41:47] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 0 ms to minimize.
[2024-05-29 17:41:48] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 0 ms to minimize.
[2024-05-29 17:41:48] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 1 ms to minimize.
[2024-05-29 17:41:48] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 1 ms to minimize.
[2024-05-29 17:41:48] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 1 ms to minimize.
[2024-05-29 17:41:49] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 1 ms to minimize.
[2024-05-29 17:41:49] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2024-05-29 17:41:49] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 0 ms to minimize.
[2024-05-29 17:41:49] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 0 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 1 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 1 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 0 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 0 ms to minimize.
[2024-05-29 17:41:50] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 1 ms to minimize.
[2024-05-29 17:41:51] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 0 ms to minimize.
[2024-05-29 17:41:51] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 0 ms to minimize.
[2024-05-29 17:41:51] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2024-05-29 17:41:51] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 0 ms to minimize.
[2024-05-29 17:41:51] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 1 ms to minimize.
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 1 ms to minimize.
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 1 ms to minimize.
[2024-05-29 17:41:52] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 0 ms to minimize.
[2024-05-29 17:41:53] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 0 ms to minimize.
[2024-05-29 17:41:53] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 0 ms to minimize.
[2024-05-29 17:41:53] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 0 ms to minimize.
[2024-05-29 17:41:53] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 1 ms to minimize.
[2024-05-29 17:41:53] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 1 ms to minimize.
[2024-05-29 17:41:53] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 0 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 0 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 0 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 0 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-05-29 17:41:54] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 0 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 1 ms to minimize.
[2024-05-29 17:41:55] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 11382 ms
[2024-05-29 17:41:56] [INFO ] After 11930ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-29 17:41:56] [INFO ] After 12150ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-29 17:41:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2024-05-29 17:41:56] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-29 17:41:56] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 1 ms to minimize.
[2024-05-29 17:41:57] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 0 ms to minimize.
[2024-05-29 17:41:57] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2024-05-29 17:41:57] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 0 ms to minimize.
[2024-05-29 17:41:57] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 1 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 0 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 0 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 1 ms to minimize.
[2024-05-29 17:41:58] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 0 ms to minimize.
[2024-05-29 17:41:59] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 1 ms to minimize.
[2024-05-29 17:41:59] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 1 ms to minimize.
[2024-05-29 17:41:59] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 1 ms to minimize.
[2024-05-29 17:41:59] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 0 ms to minimize.
[2024-05-29 17:42:00] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2024-05-29 17:42:00] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2024-05-29 17:42:00] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2024-05-29 17:42:00] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 0 ms to minimize.
[2024-05-29 17:42:00] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 0 ms to minimize.
[2024-05-29 17:42:01] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2024-05-29 17:42:01] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 1 ms to minimize.
[2024-05-29 17:42:01] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 1 ms to minimize.
[2024-05-29 17:42:01] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 0 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 0 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 2 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 0 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2024-05-29 17:42:02] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 1 ms to minimize.
[2024-05-29 17:42:03] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2024-05-29 17:42:03] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 0 ms to minimize.
[2024-05-29 17:42:03] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 0 ms to minimize.
[2024-05-29 17:42:03] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 0 ms to minimize.
[2024-05-29 17:42:03] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6933 ms
[2024-05-29 17:42:03] [INFO ] After 7534ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 17:42:03] [INFO ] After 7811ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 993 transition count 1022
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 872 transition count 1022
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 242 place count 872 transition count 873
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 540 place count 723 transition count 873
Performed 299 Post agglomeration using F-continuation condition.Transition count delta: 299
Deduced a syphon composed of 299 places in 1 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1138 place count 424 transition count 574
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1200 place count 424 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1201 place count 423 transition count 573
Applied a total of 1201 rules in 100 ms. Remains 423 /993 variables (removed 570) and now considering 573/1143 (removed 570) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 423/993 places, 573/1143 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Finished Best-First random walk after 6445 steps, including 1 resets, run visited all 2 properties in 23 ms. (steps per millisecond=280 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 9 factoid took 253 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-030B-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-030B-LTLFireability-01 finished in 24463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1000 transition count 1031
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 239 place count 881 transition count 1030
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 880 transition count 1030
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 240 place count 880 transition count 879
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 542 place count 729 transition count 879
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 551 place count 720 transition count 870
Iterating global reduction 3 with 9 rules applied. Total rules applied 560 place count 720 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 560 place count 720 transition count 869
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 562 place count 719 transition count 869
Performed 292 Post agglomeration using F-continuation condition.Transition count delta: 292
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1146 place count 427 transition count 577
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1148 place count 425 transition count 575
Applied a total of 1148 rules in 123 ms. Remains 425 /1001 variables (removed 576) and now considering 575/1151 (removed 576) transitions.
// Phase 1: matrix 575 rows 425 cols
[2024-05-29 17:42:04] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 17:42:04] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-29 17:42:04] [INFO ] Invariant cache hit.
[2024-05-29 17:42:05] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-29 17:42:05] [INFO ] Redundant transitions in 163 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2024-05-29 17:42:05] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 17:42:05] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1001 places, 574/1151 transitions.
Applied a total of 0 rules in 16 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1247 ms. Remains : 425/1001 places, 574/1151 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s295 1) (EQ s129 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 418 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-03 finished in 1322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U G(p2))))'
Support contains 5 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 993 transition count 1143
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 993 transition count 1143
Applied a total of 16 rules in 38 ms. Remains 993 /1001 variables (removed 8) and now considering 1143/1151 (removed 8) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2024-05-29 17:42:05] [INFO ] Computed 121 invariants in 11 ms
[2024-05-29 17:42:06] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 17:42:06] [INFO ] Invariant cache hit.
[2024-05-29 17:42:07] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-05-29 17:42:07] [INFO ] Invariant cache hit.
[2024-05-29 17:42:07] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/1001 places, 1143/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1907 ms. Remains : 993/1001 places, 1143/1151 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s237 1), p0:(AND (EQ s75 1) (EQ s78 1) (EQ s85 1)), p1:(NEQ s387 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 77 reset in 436 ms.
Product exploration explored 100000 steps with 77 reset in 489 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Detected a total of 240/993 stabilizing places and 240/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 181 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:42:09] [INFO ] Invariant cache hit.
[2024-05-29 17:42:09] [INFO ] [Real]Absence check using 121 positive place invariants in 38 ms returned sat
[2024-05-29 17:42:09] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:42:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2024-05-29 17:42:10] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 1 ms to minimize.
[2024-05-29 17:42:10] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 1 ms to minimize.
[2024-05-29 17:42:11] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 1 ms to minimize.
[2024-05-29 17:42:11] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 1 ms to minimize.
[2024-05-29 17:42:11] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2024-05-29 17:42:11] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 0 ms to minimize.
[2024-05-29 17:42:12] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2024-05-29 17:42:12] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 1 ms to minimize.
[2024-05-29 17:42:12] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2024-05-29 17:42:12] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 1 ms to minimize.
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 1 ms to minimize.
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 1 ms to minimize.
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 0 ms to minimize.
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 1 ms to minimize.
[2024-05-29 17:42:13] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 0 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 0 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2024-05-29 17:42:14] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2024-05-29 17:42:15] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2024-05-29 17:42:15] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4638 ms
[2024-05-29 17:42:15] [INFO ] After 5145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 17:42:15] [INFO ] After 5375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 993 transition count 1024
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 874 transition count 1024
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 238 place count 874 transition count 874
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 538 place count 724 transition count 874
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 539 place count 723 transition count 873
Iterating global reduction 2 with 1 rules applied. Total rules applied 540 place count 723 transition count 873
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 0 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1136 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1198 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1199 place count 424 transition count 574
Applied a total of 1199 rules in 112 ms. Remains 424 /993 variables (removed 569) and now considering 574/1143 (removed 569) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 424/993 places, 574/1143 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 418831 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 418831 steps, saw 267981 distinct states, run finished after 3002 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 17:42:18] [INFO ] Computed 121 invariants in 13 ms
[2024-05-29 17:42:18] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 17:42:18] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:42:18] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2024-05-29 17:42:18] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:42:19] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:42:19] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:42:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:42:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 215 ms
[2024-05-29 17:42:19] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 17:42:19] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2024-05-29 17:42:19] [INFO ] Invariant cache hit.
[2024-05-29 17:42:19] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-29 17:42:19] [INFO ] Invariant cache hit.
[2024-05-29 17:42:19] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-05-29 17:42:20] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-29 17:42:20] [INFO ] Invariant cache hit.
[2024-05-29 17:42:20] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 17:42:20] [INFO ] Invariant cache hit.
[2024-05-29 17:42:20] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 17:42:20] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:42:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 17:42:20] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:42:20] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:42:21] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2024-05-29 17:42:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-05-29 17:42:21] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-29 17:42:21] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 537 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1143 rows 993 cols
[2024-05-29 17:42:21] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 17:42:22] [INFO ] [Real]Absence check using 121 positive place invariants in 83 ms returned sat
[2024-05-29 17:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:42:24] [INFO ] [Real]Absence check using state equation in 2167 ms returned sat
[2024-05-29 17:42:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:42:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 77 ms returned sat
[2024-05-29 17:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:42:27] [INFO ] [Nat]Absence check using state equation in 2134 ms returned sat
[2024-05-29 17:42:27] [INFO ] Computed and/alt/rep : 1142/3615/1142 causal constraints (skipped 0 transitions) in 80 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 17:42:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 5 out of 993 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 992 transition count 1023
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 873 transition count 1023
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 238 place count 873 transition count 874
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 536 place count 724 transition count 874
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1128 place count 428 transition count 578
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 426 transition count 576
Applied a total of 1130 rules in 76 ms. Remains 426 /993 variables (removed 567) and now considering 576/1143 (removed 567) transitions.
// Phase 1: matrix 576 rows 426 cols
[2024-05-29 17:42:39] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:42:39] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-29 17:42:39] [INFO ] Invariant cache hit.
[2024-05-29 17:42:40] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2024-05-29 17:42:40] [INFO ] Redundant transitions in 144 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 575 rows 426 cols
[2024-05-29 17:42:40] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 17:42:40] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/993 places, 575/1143 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1199 ms. Remains : 426/993 places, 575/1143 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 700 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:42:41] [INFO ] Invariant cache hit.
[2024-05-29 17:42:41] [INFO ] [Real]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 17:42:42] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:42:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 17:42:42] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:42:42] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:42:42] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:42:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2024-05-29 17:42:42] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 17:42:42] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 575/575 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 574
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 573
Applied a total of 65 rules in 36 ms. Remains 424 /426 variables (removed 2) and now considering 573/575 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 424/426 places, 573/575 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 417080 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 417080 steps, saw 263096 distinct states, run finished after 3002 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 573 rows 424 cols
[2024-05-29 17:42:45] [INFO ] Computed 121 invariants in 6 ms
[2024-05-29 17:42:45] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 17:42:45] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:42:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2024-05-29 17:42:46] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:42:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:42:46] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:42:46] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-05-29 17:42:46] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-29 17:42:46] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-05-29 17:42:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 401 ms
[2024-05-29 17:42:46] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-29 17:42:46] [INFO ] After 736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 424/424 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-29 17:42:46] [INFO ] Invariant cache hit.
[2024-05-29 17:42:46] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-29 17:42:46] [INFO ] Invariant cache hit.
[2024-05-29 17:42:47] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2024-05-29 17:42:47] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 17:42:47] [INFO ] Invariant cache hit.
[2024-05-29 17:42:47] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1059 ms. Remains : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 17:42:47] [INFO ] Invariant cache hit.
[2024-05-29 17:42:47] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 17:42:47] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:42:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 17:42:48] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:42:48] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 17:42:48] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 856 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 575 rows 426 cols
[2024-05-29 17:42:49] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 17:42:49] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2024-05-29 17:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:42:50] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2024-05-29 17:42:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:42:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-29 17:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:42:50] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2024-05-29 17:42:50] [INFO ] Computed and/alt/rep : 503/2158/503 causal constraints (skipped 68 transitions) in 35 ms.
[2024-05-29 17:42:56] [INFO ] Added : 478 causal constraints over 96 iterations in 5426 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 244 reset in 398 ms.
Product exploration explored 100000 steps with 244 reset in 473 ms.
Built C files in :
/tmp/ltsmin14051506192544506338
[2024-05-29 17:42:57] [INFO ] Computing symmetric may disable matrix : 575 transitions.
[2024-05-29 17:42:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:42:57] [INFO ] Computing symmetric may enable matrix : 575 transitions.
[2024-05-29 17:42:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:42:57] [INFO ] Computing Do-Not-Accords matrix : 575 transitions.
[2024-05-29 17:42:57] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:42:57] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14051506192544506338
Running compilation step : cd /tmp/ltsmin14051506192544506338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1488 ms.
Running link step : cd /tmp/ltsmin14051506192544506338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin14051506192544506338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1407016463347980712.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 575/575 transitions.
Applied a total of 0 rules in 9 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2024-05-29 17:43:12] [INFO ] Invariant cache hit.
[2024-05-29 17:43:12] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-29 17:43:12] [INFO ] Invariant cache hit.
[2024-05-29 17:43:13] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-29 17:43:13] [INFO ] Redundant transitions in 118 ms returned []
[2024-05-29 17:43:13] [INFO ] Invariant cache hit.
[2024-05-29 17:43:13] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1050 ms. Remains : 426/426 places, 575/575 transitions.
Built C files in :
/tmp/ltsmin6240409206504786542
[2024-05-29 17:43:13] [INFO ] Computing symmetric may disable matrix : 575 transitions.
[2024-05-29 17:43:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:43:13] [INFO ] Computing symmetric may enable matrix : 575 transitions.
[2024-05-29 17:43:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:43:13] [INFO ] Computing Do-Not-Accords matrix : 575 transitions.
[2024-05-29 17:43:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:43:13] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6240409206504786542
Running compilation step : cd /tmp/ltsmin6240409206504786542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1365 ms.
Running link step : cd /tmp/ltsmin6240409206504786542;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6240409206504786542;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10440847791632509392.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:43:28] [INFO ] Flatten gal took : 35 ms
[2024-05-29 17:43:28] [INFO ] Flatten gal took : 32 ms
[2024-05-29 17:43:28] [INFO ] Time to serialize gal into /tmp/LTL16217900050848204991.gal : 8 ms
[2024-05-29 17:43:28] [INFO ] Time to serialize properties into /tmp/LTL4808083502751966606.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16217900050848204991.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18210228053575188077.hoa' '-atoms' '/tmp/LTL4808083502751966606.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4808083502751966606.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18210228053575188077.hoa
Detected timeout of ITS tools.
[2024-05-29 17:43:44] [INFO ] Flatten gal took : 28 ms
[2024-05-29 17:43:44] [INFO ] Flatten gal took : 26 ms
[2024-05-29 17:43:44] [INFO ] Time to serialize gal into /tmp/LTL4288130483669760199.gal : 5 ms
[2024-05-29 17:43:44] [INFO ] Time to serialize properties into /tmp/LTL10494952658115682973.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4288130483669760199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10494952658115682973.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(((p83==1)&&(p88==1))&&(p96==1))"))||(G("(p463!=1)"))))U(G("(p281==1)")))))
Formula 0 simplified : X(G(F!"(((p83==1)&&(p88==1))&&(p96==1))" & F!"(p463!=1)") R F!"(p281==1)")
Detected timeout of ITS tools.
[2024-05-29 17:43:59] [INFO ] Flatten gal took : 28 ms
[2024-05-29 17:43:59] [INFO ] Applying decomposition
[2024-05-29 17:43:59] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5872567014061517468.txt' '-o' '/tmp/graph5872567014061517468.bin' '-w' '/tmp/graph5872567014061517468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5872567014061517468.bin' '-l' '-1' '-v' '-w' '/tmp/graph5872567014061517468.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:43:59] [INFO ] Decomposing Gal with order
[2024-05-29 17:43:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:43:59] [INFO ] Removed a total of 631 redundant transitions.
[2024-05-29 17:43:59] [INFO ] Flatten gal took : 88 ms
[2024-05-29 17:43:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 662 labels/synchronizations in 18 ms.
[2024-05-29 17:43:59] [INFO ] Time to serialize gal into /tmp/LTL3121899795655403545.gal : 8 ms
[2024-05-29 17:43:59] [INFO ] Time to serialize properties into /tmp/LTL16015849660385435580.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3121899795655403545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16015849660385435580.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(((i0.i1.u5.p83==1)&&(i0.i1.u7.p88==1))&&(i0.i1.u8.p96==1))"))||(G("(i4.i1.u46.p463!=1)"))))U(G("(i2.i1.u27.p281==1)")))))
Formula 0 simplified : X(G(F!"(((i0.i1.u5.p83==1)&&(i0.i1.u7.p88==1))&&(i0.i1.u8.p96==1))" & F!"(i4.i1.u46.p463!=1)") R F!"(i2.i1.u27.p281==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17852767009853031891
[2024-05-29 17:44:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17852767009853031891
Running compilation step : cd /tmp/ltsmin17852767009853031891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1226 ms.
Running link step : cd /tmp/ltsmin17852767009853031891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17852767009853031891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 143893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 993 transition count 1143
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 993 transition count 1143
Applied a total of 16 rules in 47 ms. Remains 993 /1001 variables (removed 8) and now considering 1143/1151 (removed 8) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2024-05-29 17:44:29] [INFO ] Computed 121 invariants in 6 ms
[2024-05-29 17:44:29] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-29 17:44:29] [INFO ] Invariant cache hit.
[2024-05-29 17:44:30] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2024-05-29 17:44:30] [INFO ] Invariant cache hit.
[2024-05-29 17:44:31] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/1001 places, 1143/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1860 ms. Remains : 993/1001 places, 1143/1151 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s865 1), p1:(AND (EQ s885 1) (EQ s894 1) (EQ s915 1) (EQ s865 0))], 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 1649 reset in 246 ms.
Product exploration explored 100000 steps with 1641 reset in 231 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Detected a total of 240/993 stabilizing places and 240/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 661 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-29 17:44:33] [INFO ] Invariant cache hit.
[2024-05-29 17:44:33] [INFO ] [Real]Absence check using 121 positive place invariants in 71 ms returned sat
[2024-05-29 17:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:44:35] [INFO ] [Real]Absence check using state equation in 1935 ms returned sat
[2024-05-29 17:44:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:44:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 76 ms returned sat
[2024-05-29 17:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:44:37] [INFO ] [Nat]Absence check using state equation in 2012 ms returned sat
[2024-05-29 17:44:38] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:44:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 17:44:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2024-05-29 17:44:38] [INFO ] Computed and/alt/rep : 1142/3615/1142 causal constraints (skipped 0 transitions) in 78 ms.
[2024-05-29 17:44:50] [INFO ] Added : 735 causal constraints over 147 iterations in 12310 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 993 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 992 transition count 1022
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 872 transition count 1022
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 240 place count 872 transition count 872
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 540 place count 722 transition count 872
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1132 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1134 place count 424 transition count 574
Applied a total of 1134 rules in 81 ms. Remains 424 /993 variables (removed 569) and now considering 574/1143 (removed 569) transitions.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 17:44:50] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:44:50] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-29 17:44:50] [INFO ] Invariant cache hit.
[2024-05-29 17:44:51] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2024-05-29 17:44:51] [INFO ] Redundant transitions in 128 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2024-05-29 17:44:51] [INFO ] Computed 121 invariants in 1 ms
[2024-05-29 17:44:51] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/993 places, 573/1143 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1234 ms. Remains : 424/993 places, 573/1143 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-29 17:44:52] [INFO ] Invariant cache hit.
[2024-05-29 17:44:52] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2024-05-29 17:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:44:52] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-29 17:44:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:44:53] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-05-29 17:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:44:53] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2024-05-29 17:44:53] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 17:44:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-29 17:44:53] [INFO ] Computed and/alt/rep : 513/2194/513 causal constraints (skipped 58 transitions) in 27 ms.
[2024-05-29 17:45:00] [INFO ] Added : 492 causal constraints over 99 iterations in 6817 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27138 reset in 373 ms.
Product exploration explored 100000 steps with 27219 reset in 427 ms.
Built C files in :
/tmp/ltsmin1780872027431183363
[2024-05-29 17:45:01] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2024-05-29 17:45:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:45:01] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2024-05-29 17:45:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:45:01] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2024-05-29 17:45:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:45:01] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1780872027431183363
Running compilation step : cd /tmp/ltsmin1780872027431183363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1348 ms.
Running link step : cd /tmp/ltsmin1780872027431183363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1780872027431183363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18324854545247510403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 423 transition count 572
Applied a total of 2 rules in 23 ms. Remains 423 /424 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 423 cols
[2024-05-29 17:45:16] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 17:45:16] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-29 17:45:16] [INFO ] Invariant cache hit.
[2024-05-29 17:45:16] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-29 17:45:17] [INFO ] Redundant transitions in 103 ms returned []
[2024-05-29 17:45:17] [INFO ] Invariant cache hit.
[2024-05-29 17:45:17] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/424 places, 572/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1001 ms. Remains : 423/424 places, 572/573 transitions.
Built C files in :
/tmp/ltsmin17096147814463464475
[2024-05-29 17:45:17] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2024-05-29 17:45:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:45:17] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2024-05-29 17:45:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:45:17] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2024-05-29 17:45:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:45:17] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17096147814463464475
Running compilation step : cd /tmp/ltsmin17096147814463464475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1292 ms.
Running link step : cd /tmp/ltsmin17096147814463464475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17096147814463464475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9795701842780734130.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:45:33] [INFO ] Flatten gal took : 20 ms
[2024-05-29 17:45:33] [INFO ] Flatten gal took : 19 ms
[2024-05-29 17:45:35] [INFO ] Time to serialize gal into /tmp/LTL17476501666040807625.gal : 1928 ms
[2024-05-29 17:45:35] [INFO ] Time to serialize properties into /tmp/LTL13680920636782759988.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17476501666040807625.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6276414852236289182.hoa' '-atoms' '/tmp/LTL13680920636782759988.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13680920636782759988.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6276414852236289182.hoa
Detected timeout of ITS tools.
[2024-05-29 17:45:50] [INFO ] Flatten gal took : 18 ms
[2024-05-29 17:45:50] [INFO ] Flatten gal took : 18 ms
[2024-05-29 17:45:50] [INFO ] Time to serialize gal into /tmp/LTL9045582437367439655.gal : 3 ms
[2024-05-29 17:45:50] [INFO ] Time to serialize properties into /tmp/LTL17068255808096084817.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9045582437367439655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17068255808096084817.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p1046==1)"))||(X(G("(((p1069==1)&&(p1080==1))&&((p1106==1)&&(p1046==0)))")))))
Formula 0 simplified : G!"(p1046==1)" & XF!"(((p1069==1)&&(p1080==1))&&((p1106==1)&&(p1046==0)))"
Detected timeout of ITS tools.
[2024-05-29 17:46:05] [INFO ] Flatten gal took : 21 ms
[2024-05-29 17:46:05] [INFO ] Applying decomposition
[2024-05-29 17:46:05] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3642958711778889356.txt' '-o' '/tmp/graph3642958711778889356.bin' '-w' '/tmp/graph3642958711778889356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3642958711778889356.bin' '-l' '-1' '-v' '-w' '/tmp/graph3642958711778889356.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:46:05] [INFO ] Decomposing Gal with order
[2024-05-29 17:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:46:05] [INFO ] Removed a total of 628 redundant transitions.
[2024-05-29 17:46:05] [INFO ] Flatten gal took : 60 ms
[2024-05-29 17:46:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 674 labels/synchronizations in 16 ms.
[2024-05-29 17:46:09] [INFO ] Time to serialize gal into /tmp/LTL3887788879448512184.gal : 3846 ms
[2024-05-29 17:46:09] [INFO ] Time to serialize properties into /tmp/LTL9860362293515100830.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3887788879448512184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9860362293515100830.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(i11.i1.u104.p1046==1)"))||(X(G("(((i12.i0.u108.p1069==1)&&(i12.i0.u109.p1080==1))&&((i12.i1.u112.p1106==1)&&(i11.i1.u104.p1046...167
Formula 0 simplified : G!"(i11.i1.u104.p1046==1)" & XF!"(((i12.i0.u108.p1069==1)&&(i12.i0.u109.p1080==1))&&((i12.i1.u112.p1106==1)&&(i11.i1.u104.p1046==0))...157
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4260415517131820389
[2024-05-29 17:46:24] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4260415517131820389
Running compilation step : cd /tmp/ltsmin4260415517131820389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 899 ms.
Running link step : cd /tmp/ltsmin4260415517131820389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4260415517131820389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-06 finished in 129914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 992 transition count 1142
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 992 transition count 1142
Applied a total of 18 rules in 40 ms. Remains 992 /1001 variables (removed 9) and now considering 1142/1151 (removed 9) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2024-05-29 17:46:39] [INFO ] Computed 121 invariants in 7 ms
[2024-05-29 17:46:39] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-29 17:46:39] [INFO ] Invariant cache hit.
[2024-05-29 17:46:40] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2024-05-29 17:46:40] [INFO ] Invariant cache hit.
[2024-05-29 17:46:41] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/1001 places, 1142/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1723 ms. Remains : 992/1001 places, 1142/1151 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 215 reset in 309 ms.
Product exploration explored 100000 steps with 214 reset in 349 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 429 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=107 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-29 17:46:42] [INFO ] Invariant cache hit.
[2024-05-29 17:46:42] [INFO ] [Real]Absence check using 121 positive place invariants in 73 ms returned sat
[2024-05-29 17:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:46:45] [INFO ] [Real]Absence check using state equation in 2258 ms returned sat
[2024-05-29 17:46:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:46:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 82 ms returned sat
[2024-05-29 17:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:46:47] [INFO ] [Nat]Absence check using state equation in 2034 ms returned sat
[2024-05-29 17:46:47] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 64 ms.
[2024-05-29 17:47:00] [INFO ] Added : 735 causal constraints over 147 iterations in 12456 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 991 transition count 1021
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 871 transition count 1021
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 240 place count 871 transition count 870
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 542 place count 720 transition count 870
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 0 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1132 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1134 place count 423 transition count 573
Applied a total of 1134 rules in 67 ms. Remains 423 /992 variables (removed 569) and now considering 573/1142 (removed 569) transitions.
// Phase 1: matrix 573 rows 423 cols
[2024-05-29 17:47:00] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 17:47:00] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-29 17:47:00] [INFO ] Invariant cache hit.
[2024-05-29 17:47:00] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-05-29 17:47:00] [INFO ] Redundant transitions in 117 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2024-05-29 17:47:00] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:47:01] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/992 places, 572/1142 transitions.
Applied a total of 0 rules in 9 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1089 ms. Remains : 423/992 places, 572/1142 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/423 stabilizing places and 2/572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-29 17:47:01] [INFO ] Invariant cache hit.
[2024-05-29 17:47:01] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2024-05-29 17:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:47:02] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2024-05-29 17:47:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:47:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-29 17:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:47:03] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2024-05-29 17:47:03] [INFO ] Computed and/alt/rep : 505/2163/505 causal constraints (skipped 65 transitions) in 35 ms.
[2024-05-29 17:47:08] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:47:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-29 17:47:08] [INFO ] Added : 483 causal constraints over 98 iterations in 5567 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 202 ms :[(NOT p0)]
Product exploration explored 100000 steps with 26757 reset in 401 ms.
Product exploration explored 100000 steps with 27344 reset in 463 ms.
Built C files in :
/tmp/ltsmin6819866472870770001
[2024-05-29 17:47:09] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2024-05-29 17:47:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:47:09] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2024-05-29 17:47:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:47:09] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2024-05-29 17:47:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:47:09] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6819866472870770001
Running compilation step : cd /tmp/ltsmin6819866472870770001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1335 ms.
Running link step : cd /tmp/ltsmin6819866472870770001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6819866472870770001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16958947507557335679.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 572/572 transitions.
Applied a total of 0 rules in 14 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2024-05-29 17:47:24] [INFO ] Invariant cache hit.
[2024-05-29 17:47:24] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-29 17:47:24] [INFO ] Invariant cache hit.
[2024-05-29 17:47:25] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-05-29 17:47:25] [INFO ] Redundant transitions in 113 ms returned []
[2024-05-29 17:47:25] [INFO ] Invariant cache hit.
[2024-05-29 17:47:25] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1043 ms. Remains : 423/423 places, 572/572 transitions.
Built C files in :
/tmp/ltsmin14101118376251345404
[2024-05-29 17:47:25] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2024-05-29 17:47:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:47:25] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2024-05-29 17:47:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:47:25] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2024-05-29 17:47:25] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:47:25] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14101118376251345404
Running compilation step : cd /tmp/ltsmin14101118376251345404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1379 ms.
Running link step : cd /tmp/ltsmin14101118376251345404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14101118376251345404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5164815115977173763.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:47:40] [INFO ] Flatten gal took : 18 ms
[2024-05-29 17:47:40] [INFO ] Flatten gal took : 18 ms
[2024-05-29 17:47:40] [INFO ] Time to serialize gal into /tmp/LTL3683701348384450734.gal : 3 ms
[2024-05-29 17:47:40] [INFO ] Time to serialize properties into /tmp/LTL14730520698752899581.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3683701348384450734.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1858565318625227913.hoa' '-atoms' '/tmp/LTL14730520698752899581.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14730520698752899581.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1858565318625227913.hoa
Detected timeout of ITS tools.
[2024-05-29 17:47:56] [INFO ] Flatten gal took : 17 ms
[2024-05-29 17:47:56] [INFO ] Flatten gal took : 20 ms
[2024-05-29 17:47:56] [INFO ] Time to serialize gal into /tmp/LTL9353419996694493103.gal : 3 ms
[2024-05-29 17:48:01] [INFO ] Time to serialize properties into /tmp/LTL13865078026503546306.ltl : 5620 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9353419996694493103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13865078026503546306.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(p230==1)"))))
Formula 0 simplified : XG!"(p230==1)"
Detected timeout of ITS tools.
[2024-05-29 17:48:16] [INFO ] Flatten gal took : 23 ms
[2024-05-29 17:48:16] [INFO ] Applying decomposition
[2024-05-29 17:48:16] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9977864816858591450.txt' '-o' '/tmp/graph9977864816858591450.bin' '-w' '/tmp/graph9977864816858591450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9977864816858591450.bin' '-l' '-1' '-v' '-w' '/tmp/graph9977864816858591450.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:48:16] [INFO ] Decomposing Gal with order
[2024-05-29 17:48:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:48:16] [INFO ] Removed a total of 625 redundant transitions.
[2024-05-29 17:48:16] [INFO ] Flatten gal took : 30 ms
[2024-05-29 17:48:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 628 labels/synchronizations in 7 ms.
[2024-05-29 17:48:16] [INFO ] Time to serialize gal into /tmp/LTL10747282203624660655.gal : 3 ms
[2024-05-29 17:48:17] [INFO ] Time to serialize properties into /tmp/LTL4769315172709649380.ltl : 139 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10747282203624660655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4769315172709649380.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("(i1.i2.u21.p230==1)"))))
Formula 0 simplified : XG!"(i1.i2.u21.p230==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16863829058972700959
[2024-05-29 17:48:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16863829058972700959
Running compilation step : cd /tmp/ltsmin16863829058972700959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 926 ms.
Running link step : cd /tmp/ltsmin16863829058972700959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16863829058972700959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 127644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(F(p1))||p0)))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 993 transition count 1143
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 993 transition count 1143
Applied a total of 16 rules in 39 ms. Remains 993 /1001 variables (removed 8) and now considering 1143/1151 (removed 8) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2024-05-29 17:48:47] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 17:48:47] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-29 17:48:47] [INFO ] Invariant cache hit.
[2024-05-29 17:48:48] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-05-29 17:48:48] [INFO ] Invariant cache hit.
[2024-05-29 17:48:49] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/1001 places, 1143/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1962 ms. Remains : 993/1001 places, 1143/1151 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s969 1) (EQ s74 0)), p1:(EQ s453 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 77 reset in 373 ms.
Product exploration explored 100000 steps with 77 reset in 420 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/993 stabilizing places and 239/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:48:50] [INFO ] Invariant cache hit.
[2024-05-29 17:48:50] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:48:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2024-05-29 17:48:51] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:48:51] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 0 ms to minimize.
[2024-05-29 17:48:51] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 0 ms to minimize.
[2024-05-29 17:48:52] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 1 ms to minimize.
[2024-05-29 17:48:52] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 0 ms to minimize.
[2024-05-29 17:48:52] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 0 ms to minimize.
[2024-05-29 17:48:52] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2024-05-29 17:48:53] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 1 ms to minimize.
[2024-05-29 17:48:53] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 0 ms to minimize.
[2024-05-29 17:48:53] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 0 ms to minimize.
[2024-05-29 17:48:53] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2024-05-29 17:48:53] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 1 ms to minimize.
[2024-05-29 17:48:54] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2024-05-29 17:48:54] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 0 ms to minimize.
[2024-05-29 17:48:54] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2024-05-29 17:48:54] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 0 ms to minimize.
[2024-05-29 17:48:54] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2024-05-29 17:48:55] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 1 ms to minimize.
[2024-05-29 17:48:55] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 1 ms to minimize.
[2024-05-29 17:48:55] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 1 ms to minimize.
[2024-05-29 17:48:55] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 1 ms to minimize.
[2024-05-29 17:48:55] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 0 ms to minimize.
[2024-05-29 17:48:56] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 1 ms to minimize.
[2024-05-29 17:48:56] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 1 ms to minimize.
[2024-05-29 17:48:56] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 0 ms to minimize.
[2024-05-29 17:48:56] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 1 ms to minimize.
[2024-05-29 17:48:56] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 0 ms to minimize.
[2024-05-29 17:48:57] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 0 ms to minimize.
[2024-05-29 17:48:57] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 1 ms to minimize.
[2024-05-29 17:48:57] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 1 ms to minimize.
[2024-05-29 17:48:57] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 1 ms to minimize.
[2024-05-29 17:48:57] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 0 ms to minimize.
[2024-05-29 17:48:58] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 1 ms to minimize.
[2024-05-29 17:48:58] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 1 ms to minimize.
[2024-05-29 17:48:58] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2024-05-29 17:48:58] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 1 ms to minimize.
[2024-05-29 17:48:58] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7332 ms
[2024-05-29 17:48:58] [INFO ] After 7859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-29 17:48:58] [INFO ] After 8077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 993 transition count 1022
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 872 transition count 1022
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 872 transition count 872
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 722 transition count 872
Performed 299 Post agglomeration using F-continuation condition.Transition count delta: 299
Deduced a syphon composed of 299 places in 0 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1140 place count 423 transition count 573
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1202 place count 423 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1203 place count 422 transition count 572
Applied a total of 1203 rules in 91 ms. Remains 422 /993 variables (removed 571) and now considering 572/1143 (removed 571) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 422/993 places, 572/1143 transitions.
Finished random walk after 4597 steps, including 12 resets, run visited all 1 properties in 26 ms. (steps per millisecond=176 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 1382 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Applied a total of 0 rules in 25 ms. Remains 993 /993 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2024-05-29 17:49:00] [INFO ] Invariant cache hit.
[2024-05-29 17:49:00] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 17:49:00] [INFO ] Invariant cache hit.
[2024-05-29 17:49:01] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2024-05-29 17:49:01] [INFO ] Invariant cache hit.
[2024-05-29 17:49:02] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1818 ms. Remains : 993/993 places, 1143/1143 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/993 stabilizing places and 239/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:49:02] [INFO ] Invariant cache hit.
[2024-05-29 17:49:02] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:49:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-05-29 17:49:03] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:49:03] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 0 ms to minimize.
[2024-05-29 17:49:03] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 1 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 0 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 1 ms to minimize.
[2024-05-29 17:49:04] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 0 ms to minimize.
[2024-05-29 17:49:05] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 0 ms to minimize.
[2024-05-29 17:49:05] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2024-05-29 17:49:05] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2024-05-29 17:49:05] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 1 ms to minimize.
[2024-05-29 17:49:06] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2024-05-29 17:49:06] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 0 ms to minimize.
[2024-05-29 17:49:06] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 1 ms to minimize.
[2024-05-29 17:49:06] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 1 ms to minimize.
[2024-05-29 17:49:06] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-05-29 17:49:07] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 0 ms to minimize.
[2024-05-29 17:49:07] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 1 ms to minimize.
[2024-05-29 17:49:07] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 1 ms to minimize.
[2024-05-29 17:49:07] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 0 ms to minimize.
[2024-05-29 17:49:07] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 0 ms to minimize.
[2024-05-29 17:49:07] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 1 ms to minimize.
[2024-05-29 17:49:08] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 1 ms to minimize.
[2024-05-29 17:49:08] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 2 ms to minimize.
[2024-05-29 17:49:08] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 0 ms to minimize.
[2024-05-29 17:49:08] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 1 ms to minimize.
[2024-05-29 17:49:08] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 1 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 1 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 0 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 0 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 0 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2024-05-29 17:49:09] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 0 ms to minimize.
[2024-05-29 17:49:10] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 1 ms to minimize.
[2024-05-29 17:49:10] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6775 ms
[2024-05-29 17:49:10] [INFO ] After 7286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-29 17:49:10] [INFO ] After 7496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 993 transition count 1022
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 872 transition count 1022
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 872 transition count 872
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 722 transition count 872
Performed 299 Post agglomeration using F-continuation condition.Transition count delta: 299
Deduced a syphon composed of 299 places in 0 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1140 place count 423 transition count 573
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1202 place count 423 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1203 place count 422 transition count 572
Applied a total of 1203 rules in 73 ms. Remains 422 /993 variables (removed 571) and now considering 572/1143 (removed 571) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 422/993 places, 572/1143 transitions.
Finished random walk after 9865 steps, including 27 resets, run visited all 1 properties in 55 ms. (steps per millisecond=179 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 4668 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 77 reset in 370 ms.
Product exploration explored 100000 steps with 77 reset in 432 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 993 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 993 transition count 1143
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 120 place count 993 transition count 1173
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 181 place count 993 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 182 place count 992 transition count 1172
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 992 transition count 1172
Performed 387 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 1 with 387 rules applied. Total rules applied 570 place count 992 transition count 1172
Renaming transitions due to excessive name length > 1024 char.
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 780 place count 782 transition count 962
Deduced a syphon composed of 357 places in 1 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 990 place count 782 transition count 962
Deduced a syphon composed of 357 places in 1 ms
Applied a total of 990 rules in 312 ms. Remains 782 /993 variables (removed 211) and now considering 962/1143 (removed 181) transitions.
[2024-05-29 17:49:17] [INFO ] Redundant transitions in 226 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 782 cols
[2024-05-29 17:49:17] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 17:49:17] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 782/993 places, 961/1143 transitions.
Deduced a syphon composed of 357 places in 0 ms
Applied a total of 0 rules in 58 ms. Remains 782 /782 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1065 ms. Remains : 782/993 places, 961/1143 transitions.
Built C files in :
/tmp/ltsmin15798695820629568042
[2024-05-29 17:49:17] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15798695820629568042
Running compilation step : cd /tmp/ltsmin15798695820629568042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1905 ms.
Running link step : cd /tmp/ltsmin15798695820629568042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15798695820629568042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4101756622509755812.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Applied a total of 0 rules in 20 ms. Remains 993 /993 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2024-05-29 17:49:32] [INFO ] Computed 121 invariants in 9 ms
[2024-05-29 17:49:33] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-29 17:49:33] [INFO ] Invariant cache hit.
[2024-05-29 17:49:34] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1355 ms to find 0 implicit places.
[2024-05-29 17:49:34] [INFO ] Invariant cache hit.
[2024-05-29 17:49:34] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1934 ms. Remains : 993/993 places, 1143/1143 transitions.
Built C files in :
/tmp/ltsmin15284511179125259828
[2024-05-29 17:49:34] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15284511179125259828
Running compilation step : cd /tmp/ltsmin15284511179125259828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15284511179125259828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15284511179125259828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 17:49:42] [INFO ] Flatten gal took : 63 ms
[2024-05-29 17:49:42] [INFO ] Flatten gal took : 64 ms
[2024-05-29 17:49:42] [INFO ] Time to serialize gal into /tmp/LTL14721382744788183914.gal : 6 ms
[2024-05-29 17:49:42] [INFO ] Time to serialize properties into /tmp/LTL4050561767292148880.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14721382744788183914.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5482423553263330851.hoa' '-atoms' '/tmp/LTL4050561767292148880.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4050561767292148880.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5482423553263330851.hoa
Detected timeout of ITS tools.
[2024-05-29 17:49:57] [INFO ] Flatten gal took : 26 ms
[2024-05-29 17:49:57] [INFO ] Flatten gal took : 27 ms
[2024-05-29 17:49:57] [INFO ] Time to serialize gal into /tmp/LTL11246344087118234630.gal : 18 ms
[2024-05-29 17:49:57] [INFO ] Time to serialize properties into /tmp/LTL13702485644798435495.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11246344087118234630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13702485644798435495.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((p1172==1)||(p81==0))")||(X(F("(p543==0)"))))))))
Formula 0 simplified : XXF(!"((p1172==1)||(p81==0))" & XG!"(p543==0)")
Detected timeout of ITS tools.
[2024-05-29 17:50:13] [INFO ] Flatten gal took : 30 ms
[2024-05-29 17:50:13] [INFO ] Applying decomposition
[2024-05-29 17:50:13] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7282603472820496291.txt' '-o' '/tmp/graph7282603472820496291.bin' '-w' '/tmp/graph7282603472820496291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7282603472820496291.bin' '-l' '-1' '-v' '-w' '/tmp/graph7282603472820496291.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:50:13] [INFO ] Decomposing Gal with order
[2024-05-29 17:50:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:50:13] [INFO ] Removed a total of 1071 redundant transitions.
[2024-05-29 17:50:13] [INFO ] Flatten gal took : 57 ms
[2024-05-29 17:50:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 17:50:13] [INFO ] Time to serialize gal into /tmp/LTL15042324196918265956.gal : 10 ms
[2024-05-29 17:50:13] [INFO ] Time to serialize properties into /tmp/LTL15972142111879812845.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15042324196918265956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15972142111879812845.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i16.u364.p1172==1)||(i1.u28.p81==0))")||(X(F("(i7.u170.p543==0)"))))))))
Formula 0 simplified : XXF(!"((i16.u364.p1172==1)||(i1.u28.p81==0))" & XG!"(i7.u170.p543==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2138550024142947464
[2024-05-29 17:50:28] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2138550024142947464
Running compilation step : cd /tmp/ltsmin2138550024142947464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1862 ms.
Running link step : cd /tmp/ltsmin2138550024142947464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2138550024142947464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-09 finished in 116271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1000 transition count 1030
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 880 transition count 1030
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 240 place count 880 transition count 880
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 540 place count 730 transition count 880
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 549 place count 721 transition count 871
Iterating global reduction 2 with 9 rules applied. Total rules applied 558 place count 721 transition count 871
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 558 place count 721 transition count 870
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 560 place count 720 transition count 870
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1152 place count 424 transition count 574
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1154 place count 422 transition count 572
Applied a total of 1154 rules in 95 ms. Remains 422 /1001 variables (removed 579) and now considering 572/1151 (removed 579) transitions.
// Phase 1: matrix 572 rows 422 cols
[2024-05-29 17:50:43] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 17:50:43] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 17:50:43] [INFO ] Invariant cache hit.
[2024-05-29 17:50:44] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-29 17:50:44] [INFO ] Redundant transitions in 106 ms returned [571]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 571 rows 422 cols
[2024-05-29 17:50:44] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 17:50:44] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 422/1001 places, 571/1151 transitions.
Applied a total of 0 rules in 13 ms. Remains 422 /422 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1122 ms. Remains : 422/1001 places, 571/1151 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-10 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 s356 1) (EQ s358 1) (EQ s362 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 383 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-10 finished in 1196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1000 transition count 1030
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 880 transition count 1030
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 240 place count 880 transition count 880
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 540 place count 730 transition count 880
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 549 place count 721 transition count 871
Iterating global reduction 2 with 9 rules applied. Total rules applied 558 place count 721 transition count 871
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 558 place count 721 transition count 870
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 560 place count 720 transition count 870
Performed 293 Post agglomeration using F-continuation condition.Transition count delta: 293
Deduced a syphon composed of 293 places in 0 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1146 place count 427 transition count 577
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1148 place count 425 transition count 575
Applied a total of 1148 rules in 73 ms. Remains 425 /1001 variables (removed 576) and now considering 575/1151 (removed 576) transitions.
// Phase 1: matrix 575 rows 425 cols
[2024-05-29 17:50:44] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 17:50:44] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-29 17:50:44] [INFO ] Invariant cache hit.
[2024-05-29 17:50:45] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-29 17:50:45] [INFO ] Redundant transitions in 103 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2024-05-29 17:50:45] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:50:45] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1001 places, 574/1151 transitions.
Applied a total of 0 rules in 8 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1108 ms. Remains : 425/1001 places, 574/1151 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s390 0) (EQ s396 0) (EQ s404 0) (EQ s1 0)), p1:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 243 reset in 382 ms.
Product exploration explored 100000 steps with 244 reset in 436 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 7857 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:50:54] [INFO ] Invariant cache hit.
[2024-05-29 17:50:54] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:50:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 17:50:55] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:50:55] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2024-05-29 17:50:55] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2024-05-29 17:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2024-05-29 17:50:55] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-29 17:50:55] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 574/574 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 425 transition count 574
Applied a total of 62 rules in 20 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 425/425 places, 574/574 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 570365 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 570365 steps, saw 485730 distinct states, run finished after 3003 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 425 cols
[2024-05-29 17:50:58] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 17:50:58] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:50:58] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 17:50:58] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:50:58] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-29 17:50:58] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 10 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 425/425 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2024-05-29 17:50:58] [INFO ] Invariant cache hit.
[2024-05-29 17:50:59] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-29 17:50:59] [INFO ] Invariant cache hit.
[2024-05-29 17:50:59] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2024-05-29 17:50:59] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-29 17:50:59] [INFO ] Invariant cache hit.
[2024-05-29 17:50:59] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1017 ms. Remains : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 17:50:59] [INFO ] Invariant cache hit.
[2024-05-29 17:50:59] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:51:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 17:51:00] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:51:00] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2024-05-29 17:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-05-29 17:51:00] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-29 17:51:00] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 9240 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2024-05-29 17:51:09] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:51:10] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-29 17:51:10] [INFO ] Invariant cache hit.
[2024-05-29 17:51:10] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-29 17:51:10] [INFO ] Redundant transitions in 127 ms returned []
[2024-05-29 17:51:10] [INFO ] Invariant cache hit.
[2024-05-29 17:51:10] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1016 ms. Remains : 425/425 places, 574/574 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:51:11] [INFO ] Invariant cache hit.
[2024-05-29 17:51:11] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:51:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2024-05-29 17:51:11] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:51:11] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-05-29 17:51:11] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2024-05-29 17:51:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2024-05-29 17:51:12] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-29 17:51:12] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 574/574 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 425 transition count 574
Applied a total of 62 rules in 17 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 425/425 places, 574/574 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 563232 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 563232 steps, saw 484431 distinct states, run finished after 3004 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 425 cols
[2024-05-29 17:51:15] [INFO ] Computed 121 invariants in 11 ms
[2024-05-29 17:51:15] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:51:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 17:51:15] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:51:15] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 17:51:15] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 11 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 425/425 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2024-05-29 17:51:15] [INFO ] Invariant cache hit.
[2024-05-29 17:51:15] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-29 17:51:15] [INFO ] Invariant cache hit.
[2024-05-29 17:51:16] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-05-29 17:51:16] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-29 17:51:16] [INFO ] Invariant cache hit.
[2024-05-29 17:51:16] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 17:51:16] [INFO ] Invariant cache hit.
[2024-05-29 17:51:16] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:51:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 17:51:17] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:51:17] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2024-05-29 17:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-29 17:51:17] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 17:51:17] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 244 reset in 387 ms.
Product exploration explored 100000 steps with 244 reset in 438 ms.
Built C files in :
/tmp/ltsmin18009383572099052182
[2024-05-29 17:51:18] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2024-05-29 17:51:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:18] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2024-05-29 17:51:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:18] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2024-05-29 17:51:18] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:18] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18009383572099052182
Running compilation step : cd /tmp/ltsmin18009383572099052182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1332 ms.
Running link step : cd /tmp/ltsmin18009383572099052182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18009383572099052182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8209991785003274100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 17 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2024-05-29 17:51:33] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 17:51:33] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 17:51:33] [INFO ] Invariant cache hit.
[2024-05-29 17:51:34] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-29 17:51:34] [INFO ] Redundant transitions in 103 ms returned []
[2024-05-29 17:51:34] [INFO ] Invariant cache hit.
[2024-05-29 17:51:34] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1019 ms. Remains : 425/425 places, 574/574 transitions.
Built C files in :
/tmp/ltsmin5521117774599706036
[2024-05-29 17:51:34] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2024-05-29 17:51:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:34] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2024-05-29 17:51:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:34] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2024-05-29 17:51:34] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:51:34] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5521117774599706036
Running compilation step : cd /tmp/ltsmin5521117774599706036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1267 ms.
Running link step : cd /tmp/ltsmin5521117774599706036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5521117774599706036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6370120386864423381.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:51:49] [INFO ] Flatten gal took : 27 ms
[2024-05-29 17:51:49] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:51:49] [INFO ] Time to serialize gal into /tmp/LTL10452112337489379128.gal : 3 ms
[2024-05-29 17:51:49] [INFO ] Time to serialize properties into /tmp/LTL11761258330153083943.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10452112337489379128.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2897779501803882265.hoa' '-atoms' '/tmp/LTL11761258330153083943.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11761258330153083943.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2897779501803882265.hoa
Detected timeout of ITS tools.
[2024-05-29 17:52:04] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:52:05] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:52:05] [INFO ] Time to serialize gal into /tmp/LTL7271308844601149153.gal : 4 ms
[2024-05-29 17:52:05] [INFO ] Time to serialize properties into /tmp/LTL7533561853498374304.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7271308844601149153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7533561853498374304.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(((p1108==0)||(p1122==0))||((p1145==0)||(p19==0)))"))&&(F(G("(p19==0)"))))))
Formula 0 simplified : F(G!"(((p1108==0)||(p1122==0))||((p1145==0)||(p19==0)))" | GF!"(p19==0)")
Detected timeout of ITS tools.
[2024-05-29 17:52:20] [INFO ] Flatten gal took : 20 ms
[2024-05-29 17:52:20] [INFO ] Applying decomposition
[2024-05-29 17:52:20] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8965517837663951530.txt' '-o' '/tmp/graph8965517837663951530.bin' '-w' '/tmp/graph8965517837663951530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8965517837663951530.bin' '-l' '-1' '-v' '-w' '/tmp/graph8965517837663951530.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:52:20] [INFO ] Decomposing Gal with order
[2024-05-29 17:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:52:20] [INFO ] Removed a total of 628 redundant transitions.
[2024-05-29 17:52:20] [INFO ] Flatten gal took : 32 ms
[2024-05-29 17:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 610 labels/synchronizations in 22 ms.
[2024-05-29 17:52:20] [INFO ] Time to serialize gal into /tmp/LTL10039924126845009091.gal : 6 ms
[2024-05-29 17:52:20] [INFO ] Time to serialize properties into /tmp/LTL593798847419299993.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10039924126845009091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL593798847419299993.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(((i10.i1.u112.p1108==0)||(i10.i1.u114.p1122==0))||((i11.i0.u117.p1145==0)||(i4.u0.p19==0)))"))&&(F(G("(i4.u0.p19==0)"))))))
Formula 0 simplified : F(G!"(((i10.i1.u112.p1108==0)||(i10.i1.u114.p1122==0))||((i11.i0.u117.p1145==0)||(i4.u0.p19==0)))" | GF!"(i4.u0.p19==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1427368421433228449
[2024-05-29 17:52:35] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1427368421433228449
Running compilation step : cd /tmp/ltsmin1427368421433228449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 962 ms.
Running link step : cd /tmp/ltsmin1427368421433228449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1427368421433228449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-11 finished in 125768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(p1||G(p2)))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1000 transition count 1031
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 881 transition count 1031
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 238 place count 881 transition count 881
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 538 place count 731 transition count 881
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 546 place count 723 transition count 873
Iterating global reduction 2 with 8 rules applied. Total rules applied 554 place count 723 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 554 place count 723 transition count 872
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 556 place count 722 transition count 872
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 0 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1146 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1148 place count 425 transition count 575
Applied a total of 1148 rules in 85 ms. Remains 425 /1001 variables (removed 576) and now considering 575/1151 (removed 576) transitions.
// Phase 1: matrix 575 rows 425 cols
[2024-05-29 17:52:50] [INFO ] Computed 121 invariants in 8 ms
[2024-05-29 17:52:50] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-29 17:52:50] [INFO ] Invariant cache hit.
[2024-05-29 17:52:51] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2024-05-29 17:52:51] [INFO ] Redundant transitions in 108 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2024-05-29 17:52:51] [INFO ] Computed 121 invariants in 1 ms
[2024-05-29 17:52:51] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1001 places, 574/1151 transitions.
Applied a total of 0 rules in 8 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1137 ms. Remains : 425/1001 places, 574/1151 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s66 1), p2:(EQ s66 0), p0:(AND (EQ s270 1) (EQ s288 1) (EQ s299 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1530 steps with 4 reset in 12 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-12 finished in 1360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p0&&F(p1)))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1000 transition count 1030
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 880 transition count 1030
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 880 transition count 881
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 731 transition count 881
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 546 place count 723 transition count 873
Iterating global reduction 2 with 8 rules applied. Total rules applied 554 place count 723 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 554 place count 723 transition count 872
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 556 place count 722 transition count 872
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 0 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1148 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1150 place count 424 transition count 574
Applied a total of 1150 rules in 85 ms. Remains 424 /1001 variables (removed 577) and now considering 574/1151 (removed 577) transitions.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 17:52:51] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:52:52] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 17:52:52] [INFO ] Invariant cache hit.
[2024-05-29 17:52:52] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-29 17:52:52] [INFO ] Redundant transitions in 112 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2024-05-29 17:52:52] [INFO ] Computed 121 invariants in 1 ms
[2024-05-29 17:52:52] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/1001 places, 573/1151 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1188 ms. Remains : 424/1001 places, 573/1151 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s382 1) (EQ s301 1)), p1:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27289 reset in 406 ms.
Product exploration explored 100000 steps with 27107 reset in 463 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Finished Best-First random walk after 3765 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=418 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false]
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-29 17:52:55] [INFO ] Invariant cache hit.
[2024-05-29 17:52:55] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-29 17:52:55] [INFO ] Invariant cache hit.
[2024-05-29 17:52:55] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-29 17:52:55] [INFO ] Redundant transitions in 119 ms returned []
[2024-05-29 17:52:55] [INFO ] Invariant cache hit.
[2024-05-29 17:52:56] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1081 ms. Remains : 424/424 places, 573/573 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 17:52:56] [INFO ] Invariant cache hit.
[2024-05-29 17:52:56] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2024-05-29 17:52:57] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:52:57] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 17:52:57] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:52:57] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 17:52:57] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 424 transition count 573
Applied a total of 61 rules in 28 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 424/424 places, 573/573 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Finished Best-First random walk after 7772 steps, including 2 resets, run visited all 2 properties in 22 ms. (steps per millisecond=353 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 604 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 153 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 159 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Product exploration explored 100000 steps with 27038 reset in 416 ms.
Product exploration explored 100000 steps with 27068 reset in 476 ms.
Built C files in :
/tmp/ltsmin581828950908616024
[2024-05-29 17:52:59] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2024-05-29 17:52:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:52:59] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2024-05-29 17:52:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:52:59] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2024-05-29 17:52:59] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:52:59] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin581828950908616024
Running compilation step : cd /tmp/ltsmin581828950908616024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1392 ms.
Running link step : cd /tmp/ltsmin581828950908616024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin581828950908616024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8652068561592020318.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-29 17:53:14] [INFO ] Invariant cache hit.
[2024-05-29 17:53:15] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 17:53:15] [INFO ] Invariant cache hit.
[2024-05-29 17:53:15] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-29 17:53:15] [INFO ] Redundant transitions in 117 ms returned []
[2024-05-29 17:53:15] [INFO ] Invariant cache hit.
[2024-05-29 17:53:15] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1040 ms. Remains : 424/424 places, 573/573 transitions.
Built C files in :
/tmp/ltsmin7051653035895578648
[2024-05-29 17:53:15] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2024-05-29 17:53:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:53:15] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2024-05-29 17:53:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:53:15] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2024-05-29 17:53:15] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:53:15] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7051653035895578648
Running compilation step : cd /tmp/ltsmin7051653035895578648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1388 ms.
Running link step : cd /tmp/ltsmin7051653035895578648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7051653035895578648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14859357190561614406.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:53:30] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:53:30] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:53:31] [INFO ] Time to serialize gal into /tmp/LTL11156926329244635885.gal : 3 ms
[2024-05-29 17:53:31] [INFO ] Time to serialize properties into /tmp/LTL7806282702195209425.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11156926329244635885.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4259174449448510618.hoa' '-atoms' '/tmp/LTL7806282702195209425.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7806282702195209425.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4259174449448510618.hoa
Detected timeout of ITS tools.
[2024-05-29 17:53:46] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:53:46] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:53:46] [INFO ] Time to serialize gal into /tmp/LTL13360693854617431473.gal : 2 ms
[2024-05-29 17:53:46] [INFO ] Time to serialize properties into /tmp/LTL16034504999454094873.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13360693854617431473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16034504999454094873.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((p1082!=1)||(p861!=1))"))||((F("(p527==1)"))&&("((p1082!=1)||(p861!=1))")))))
Formula 0 simplified : G(F!"((p1082!=1)||(p861!=1))" & (!"((p1082!=1)||(p861!=1))" | G!"(p527==1)"))
Detected timeout of ITS tools.
[2024-05-29 17:54:01] [INFO ] Flatten gal took : 14 ms
[2024-05-29 17:54:01] [INFO ] Applying decomposition
[2024-05-29 17:54:01] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph573963839572391554.txt' '-o' '/tmp/graph573963839572391554.bin' '-w' '/tmp/graph573963839572391554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph573963839572391554.bin' '-l' '-1' '-v' '-w' '/tmp/graph573963839572391554.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:54:01] [INFO ] Decomposing Gal with order
[2024-05-29 17:54:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:54:01] [INFO ] Removed a total of 631 redundant transitions.
[2024-05-29 17:54:01] [INFO ] Flatten gal took : 27 ms
[2024-05-29 17:54:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 656 labels/synchronizations in 6 ms.
[2024-05-29 17:54:01] [INFO ] Time to serialize gal into /tmp/LTL561235911885023335.gal : 4 ms
[2024-05-29 17:54:01] [INFO ] Time to serialize properties into /tmp/LTL9167422134577191839.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL561235911885023335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9167422134577191839.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("((i12.i0.u109.p1082!=1)||(i9.i1.u86.p861!=1))"))||((F("(i5.u51.p527==1)"))&&("((i12.i0.u109.p1082!=1)||(i9.i1.u86.p861!=1))")...159
Formula 0 simplified : G(F!"((i12.i0.u109.p1082!=1)||(i9.i1.u86.p861!=1))" & (!"((i12.i0.u109.p1082!=1)||(i9.i1.u86.p861!=1))" | G!"(i5.u51.p527==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9186947912168460940
[2024-05-29 17:54:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9186947912168460940
Running compilation step : cd /tmp/ltsmin9186947912168460940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 936 ms.
Running link step : cd /tmp/ltsmin9186947912168460940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9186947912168460940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(<>((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-13 finished in 99624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 993 transition count 1143
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 993 transition count 1143
Applied a total of 16 rules in 38 ms. Remains 993 /1001 variables (removed 8) and now considering 1143/1151 (removed 8) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2024-05-29 17:54:31] [INFO ] Computed 121 invariants in 6 ms
[2024-05-29 17:54:31] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-29 17:54:31] [INFO ] Invariant cache hit.
[2024-05-29 17:54:32] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
[2024-05-29 17:54:32] [INFO ] Invariant cache hit.
[2024-05-29 17:54:33] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/1001 places, 1143/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1908 ms. Remains : 993/1001 places, 1143/1151 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s696 1), p1:(NEQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 621 ms.
Product exploration explored 100000 steps with 50000 reset in 627 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 28 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-030B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-030B-LTLFireability-14 finished in 3301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1000 transition count 1030
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 880 transition count 1030
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 880 transition count 881
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 731 transition count 881
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 546 place count 723 transition count 873
Iterating global reduction 2 with 8 rules applied. Total rules applied 554 place count 723 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 554 place count 723 transition count 872
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 556 place count 722 transition count 872
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 0 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1148 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1150 place count 424 transition count 574
Applied a total of 1150 rules in 87 ms. Remains 424 /1001 variables (removed 577) and now considering 574/1151 (removed 577) transitions.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 17:54:34] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:54:35] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-29 17:54:35] [INFO ] Invariant cache hit.
[2024-05-29 17:54:35] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-29 17:54:35] [INFO ] Redundant transitions in 107 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2024-05-29 17:54:35] [INFO ] Computed 121 invariants in 1 ms
[2024-05-29 17:54:35] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/1001 places, 573/1151 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1129 ms. Remains : 424/1001 places, 573/1151 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s49 1), p1:(OR (NEQ s301 1) (NEQ s303 1) (NEQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 267 reset in 391 ms.
Product exploration explored 100000 steps with 260 reset in 443 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
Finished Best-First random walk after 4675 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=467 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 13 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-29 17:54:37] [INFO ] Invariant cache hit.
[2024-05-29 17:54:37] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-29 17:54:37] [INFO ] Invariant cache hit.
[2024-05-29 17:54:38] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-29 17:54:38] [INFO ] Redundant transitions in 103 ms returned []
[2024-05-29 17:54:38] [INFO ] Invariant cache hit.
[2024-05-29 17:54:38] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 993 ms. Remains : 424/424 places, 573/573 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :1
Finished Best-First random walk after 4531 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=411 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 302 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 259 reset in 399 ms.
Product exploration explored 100000 steps with 266 reset in 445 ms.
Built C files in :
/tmp/ltsmin11844875553996920174
[2024-05-29 17:54:40] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2024-05-29 17:54:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:54:40] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2024-05-29 17:54:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:54:40] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2024-05-29 17:54:40] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:54:40] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11844875553996920174
Running compilation step : cd /tmp/ltsmin11844875553996920174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1313 ms.
Running link step : cd /tmp/ltsmin11844875553996920174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11844875553996920174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9602409394169883402.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 18 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-29 17:54:55] [INFO ] Invariant cache hit.
[2024-05-29 17:54:55] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-29 17:54:55] [INFO ] Invariant cache hit.
[2024-05-29 17:54:55] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-29 17:54:55] [INFO ] Redundant transitions in 122 ms returned []
[2024-05-29 17:54:55] [INFO ] Invariant cache hit.
[2024-05-29 17:54:56] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1028 ms. Remains : 424/424 places, 573/573 transitions.
Built C files in :
/tmp/ltsmin10445948004144904421
[2024-05-29 17:54:56] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2024-05-29 17:54:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:54:56] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2024-05-29 17:54:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:54:56] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2024-05-29 17:54:56] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:54:56] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10445948004144904421
Running compilation step : cd /tmp/ltsmin10445948004144904421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1305 ms.
Running link step : cd /tmp/ltsmin10445948004144904421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10445948004144904421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16330009593651250421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:55:11] [INFO ] Flatten gal took : 19 ms
[2024-05-29 17:55:11] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:55:11] [INFO ] Time to serialize gal into /tmp/LTL13693804690084940360.gal : 3 ms
[2024-05-29 17:55:11] [INFO ] Time to serialize properties into /tmp/LTL14940946029772212515.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13693804690084940360.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12845891478547292342.hoa' '-atoms' '/tmp/LTL14940946029772212515.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14940946029772212515.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12845891478547292342.hoa
Detected timeout of ITS tools.
[2024-05-29 17:55:26] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:55:26] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:55:26] [INFO ] Time to serialize gal into /tmp/LTL5331674696930810707.gal : 6 ms
[2024-05-29 17:55:26] [INFO ] Time to serialize properties into /tmp/LTL4591419037626129604.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5331674696930810707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4591419037626129604.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("(p164==1)"))||(G(F("(((p862!=1)||(p868!=1))||(p877!=1))"))))))
Formula 0 simplified : G(F!"(p164==1)" & FG!"(((p862!=1)||(p868!=1))||(p877!=1))")
Detected timeout of ITS tools.
[2024-05-29 17:55:41] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:55:41] [INFO ] Applying decomposition
[2024-05-29 17:55:41] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7989192307174090070.txt' '-o' '/tmp/graph7989192307174090070.bin' '-w' '/tmp/graph7989192307174090070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7989192307174090070.bin' '-l' '-1' '-v' '-w' '/tmp/graph7989192307174090070.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:55:41] [INFO ] Decomposing Gal with order
[2024-05-29 17:55:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:55:41] [INFO ] Removed a total of 631 redundant transitions.
[2024-05-29 17:55:41] [INFO ] Flatten gal took : 27 ms
[2024-05-29 17:55:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 660 labels/synchronizations in 6 ms.
[2024-05-29 17:55:41] [INFO ] Time to serialize gal into /tmp/LTL5534977195611847498.gal : 20 ms
[2024-05-29 17:55:41] [INFO ] Time to serialize properties into /tmp/LTL12103869387431977714.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5534977195611847498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12103869387431977714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("(i1.i0.u14.p164==1)"))||(G(F("(((i9.i1.u85.p862!=1)||(i9.i1.u86.p868!=1))||(i9.i1.u88.p877!=1))"))))))
Formula 0 simplified : G(F!"(i1.i0.u14.p164==1)" & FG!"(((i9.i1.u85.p862!=1)||(i9.i1.u86.p868!=1))||(i9.i1.u88.p877!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17659972474856089526
[2024-05-29 17:55:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17659972474856089526
Running compilation step : cd /tmp/ltsmin17659972474856089526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 896 ms.
Running link step : cd /tmp/ltsmin17659972474856089526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17659972474856089526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-15 finished in 97090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U G(p2))))'
Found a Lengthening insensitive property : ShieldRVs-PT-030B-LTLFireability-04
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1000 transition count 1031
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 881 transition count 1031
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 238 place count 881 transition count 882
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 536 place count 732 transition count 882
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 544 place count 724 transition count 874
Iterating global reduction 2 with 8 rules applied. Total rules applied 552 place count 724 transition count 874
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 552 place count 724 transition count 873
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 554 place count 723 transition count 873
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 1 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1144 place count 428 transition count 578
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1146 place count 426 transition count 576
Applied a total of 1146 rules in 92 ms. Remains 426 /1001 variables (removed 575) and now considering 576/1151 (removed 575) transitions.
// Phase 1: matrix 576 rows 426 cols
[2024-05-29 17:56:12] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 17:56:12] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-29 17:56:12] [INFO ] Invariant cache hit.
[2024-05-29 17:56:12] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-29 17:56:12] [INFO ] Invariant cache hit.
[2024-05-29 17:56:13] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 426/1001 places, 576/1151 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1009 ms. Remains : 426/1001 places, 576/1151 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s92 1), p0:(AND (EQ s20 1) (EQ s22 1) (EQ s26 1)), p1:(NEQ s160 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 243 reset in 446 ms.
Product exploration explored 100000 steps with 244 reset in 508 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/576 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 428 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:56:14] [INFO ] Invariant cache hit.
[2024-05-29 17:56:14] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 17:56:14] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:56:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 17:56:15] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:56:15] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-05-29 17:56:15] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:56:15] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:56:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 203 ms
[2024-05-29 17:56:15] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 17:56:15] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 576/576 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 575
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 574
Applied a total of 65 rules in 41 ms. Remains 424 /426 variables (removed 2) and now considering 574/576 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 424/426 places, 574/576 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 471078 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 471078 steps, saw 322650 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 17:56:18] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 17:56:18] [INFO ] [Real]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 17:56:18] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:56:18] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 17:56:19] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:56:19] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:56:19] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:56:19] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:56:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 261 ms
[2024-05-29 17:56:19] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-29 17:56:19] [INFO ] After 578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2024-05-29 17:56:19] [INFO ] Invariant cache hit.
[2024-05-29 17:56:19] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-29 17:56:19] [INFO ] Invariant cache hit.
[2024-05-29 17:56:20] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2024-05-29 17:56:20] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 17:56:20] [INFO ] Invariant cache hit.
[2024-05-29 17:56:20] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1021 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 17:56:20] [INFO ] Invariant cache hit.
[2024-05-29 17:56:20] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 17:56:20] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:56:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2024-05-29 17:56:21] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:56:21] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:56:21] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:56:21] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:56:21] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:56:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:56:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 276 ms
[2024-05-29 17:56:21] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 17:56:21] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 615 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 576 rows 426 cols
[2024-05-29 17:56:22] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:56:22] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-05-29 17:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:56:23] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-05-29 17:56:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:56:23] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2024-05-29 17:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:56:23] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2024-05-29 17:56:23] [INFO ] Computed and/alt/rep : 503/2157/503 causal constraints (skipped 69 transitions) in 35 ms.
[2024-05-29 17:56:29] [INFO ] Added : 474 causal constraints over 95 iterations in 5976 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-29 17:56:29] [INFO ] Invariant cache hit.
[2024-05-29 17:56:29] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-29 17:56:29] [INFO ] Invariant cache hit.
[2024-05-29 17:56:30] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-05-29 17:56:30] [INFO ] Invariant cache hit.
[2024-05-29 17:56:30] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 881 ms. Remains : 426/426 places, 576/576 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/576 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 465 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:56:31] [INFO ] Invariant cache hit.
[2024-05-29 17:56:31] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2024-05-29 17:56:31] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:56:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 17:56:31] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:56:31] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2024-05-29 17:56:31] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:56:32] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:56:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2024-05-29 17:56:32] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 17:56:32] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 576/576 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 575
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 574
Applied a total of 65 rules in 42 ms. Remains 424 /426 variables (removed 2) and now considering 574/576 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 424/426 places, 574/576 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 478251 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 478251 steps, saw 323966 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 17:56:35] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:56:35] [INFO ] [Real]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 17:56:35] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:56:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2024-05-29 17:56:35] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:56:35] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:56:35] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:56:35] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-05-29 17:56:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2024-05-29 17:56:36] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-29 17:56:36] [INFO ] After 573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2024-05-29 17:56:36] [INFO ] Invariant cache hit.
[2024-05-29 17:56:36] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-29 17:56:36] [INFO ] Invariant cache hit.
[2024-05-29 17:56:36] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-05-29 17:56:36] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-29 17:56:36] [INFO ] Invariant cache hit.
[2024-05-29 17:56:37] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1018 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 17:56:37] [INFO ] Invariant cache hit.
[2024-05-29 17:56:37] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 17:56:37] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:56:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 17:56:37] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:56:37] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:56:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:56:37] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:56:37] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:56:37] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:56:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 333 ms
[2024-05-29 17:56:38] [INFO ] After 524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 17:56:38] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 662 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 576 rows 426 cols
[2024-05-29 17:56:38] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:56:39] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-29 17:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:56:39] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2024-05-29 17:56:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:56:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2024-05-29 17:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:56:40] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2024-05-29 17:56:40] [INFO ] Computed and/alt/rep : 503/2157/503 causal constraints (skipped 69 transitions) in 35 ms.
[2024-05-29 17:56:46] [INFO ] Added : 474 causal constraints over 95 iterations in 5835 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 245 reset in 409 ms.
Product exploration explored 100000 steps with 244 reset in 484 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-29 17:56:47] [INFO ] Redundant transitions in 111 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 575 rows 426 cols
[2024-05-29 17:56:47] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 17:56:47] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/426 places, 575/576 transitions.
Applied a total of 0 rules in 7 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 426/426 places, 575/576 transitions.
Built C files in :
/tmp/ltsmin15159712252698214057
[2024-05-29 17:56:47] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15159712252698214057
Running compilation step : cd /tmp/ltsmin15159712252698214057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 922 ms.
Running link step : cd /tmp/ltsmin15159712252698214057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15159712252698214057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18161106954613638803.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
// Phase 1: matrix 576 rows 426 cols
[2024-05-29 17:57:03] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 17:57:03] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-29 17:57:03] [INFO ] Invariant cache hit.
[2024-05-29 17:57:03] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2024-05-29 17:57:03] [INFO ] Invariant cache hit.
[2024-05-29 17:57:04] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 919 ms. Remains : 426/426 places, 576/576 transitions.
Built C files in :
/tmp/ltsmin9291837367026250177
[2024-05-29 17:57:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9291837367026250177
Running compilation step : cd /tmp/ltsmin9291837367026250177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 998 ms.
Running link step : cd /tmp/ltsmin9291837367026250177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9291837367026250177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10178714265412591389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:57:19] [INFO ] Flatten gal took : 18 ms
[2024-05-29 17:57:19] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:57:19] [INFO ] Time to serialize gal into /tmp/LTL13738564303316003718.gal : 3 ms
[2024-05-29 17:57:19] [INFO ] Time to serialize properties into /tmp/LTL11554308092170590843.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13738564303316003718.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5994506810343583413.hoa' '-atoms' '/tmp/LTL11554308092170590843.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11554308092170590843.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5994506810343583413.hoa
Detected timeout of ITS tools.
[2024-05-29 17:57:34] [INFO ] Flatten gal took : 20 ms
[2024-05-29 17:57:34] [INFO ] Flatten gal took : 16 ms
[2024-05-29 17:57:34] [INFO ] Time to serialize gal into /tmp/LTL4899152511135929664.gal : 3 ms
[2024-05-29 17:57:34] [INFO ] Time to serialize properties into /tmp/LTL11676485909501055081.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4899152511135929664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11676485909501055081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(((p83==1)&&(p88==1))&&(p96==1))"))||(G("(p463!=1)"))))U(G("(p281==1)")))))
Formula 0 simplified : X(G(F!"(((p83==1)&&(p88==1))&&(p96==1))" & F!"(p463!=1)") R F!"(p281==1)")
Detected timeout of ITS tools.
[2024-05-29 17:57:49] [INFO ] Flatten gal took : 17 ms
[2024-05-29 17:57:49] [INFO ] Applying decomposition
[2024-05-29 17:57:49] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11394979010444005052.txt' '-o' '/tmp/graph11394979010444005052.bin' '-w' '/tmp/graph11394979010444005052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11394979010444005052.bin' '-l' '-1' '-v' '-w' '/tmp/graph11394979010444005052.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:57:49] [INFO ] Decomposing Gal with order
[2024-05-29 17:57:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:57:49] [INFO ] Removed a total of 633 redundant transitions.
[2024-05-29 17:57:49] [INFO ] Flatten gal took : 28 ms
[2024-05-29 17:57:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 672 labels/synchronizations in 6 ms.
[2024-05-29 17:57:49] [INFO ] Time to serialize gal into /tmp/LTL4864375507782448582.gal : 4 ms
[2024-05-29 17:57:49] [INFO ] Time to serialize properties into /tmp/LTL17545064536505434337.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4864375507782448582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17545064536505434337.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(((i0.u5.p83==1)&&(i0.u7.p88==1))&&(i0.u8.p96==1))"))||(G("(i4.i1.u46.p463!=1)"))))U(G("(i2.i1.u27.p281==1)")))))
Formula 0 simplified : X(G(F!"(((i0.u5.p83==1)&&(i0.u7.p88==1))&&(i0.u8.p96==1))" & F!"(i4.i1.u46.p463!=1)") R F!"(i2.i1.u27.p281==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3882501854289864429
[2024-05-29 17:58:04] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3882501854289864429
Running compilation step : cd /tmp/ltsmin3882501854289864429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 908 ms.
Running link step : cd /tmp/ltsmin3882501854289864429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3882501854289864429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 127808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : ShieldRVs-PT-030B-LTLFireability-06
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1000 transition count 1030
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 880 transition count 1030
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 240 place count 880 transition count 880
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 540 place count 730 transition count 880
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 548 place count 722 transition count 872
Iterating global reduction 2 with 8 rules applied. Total rules applied 556 place count 722 transition count 872
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 0 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1148 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1150 place count 424 transition count 574
Applied a total of 1150 rules in 72 ms. Remains 424 /1001 variables (removed 577) and now considering 574/1151 (removed 577) transitions.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 17:58:19] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:58:20] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 17:58:20] [INFO ] Invariant cache hit.
[2024-05-29 17:58:20] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-05-29 17:58:20] [INFO ] Invariant cache hit.
[2024-05-29 17:58:20] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 424/1001 places, 574/1151 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 968 ms. Remains : 424/1001 places, 574/1151 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s367 1), p1:(AND (EQ s376 1) (EQ s380 1) (EQ s389 1) (EQ s367 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 27048 reset in 382 ms.
Product exploration explored 100000 steps with 27233 reset in 437 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-29 17:58:22] [INFO ] Invariant cache hit.
[2024-05-29 17:58:22] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-29 17:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:58:23] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2024-05-29 17:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:58:23] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-29 17:58:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:58:23] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2024-05-29 17:58:23] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 17:58:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-29 17:58:23] [INFO ] Computed and/alt/rep : 513/2193/513 causal constraints (skipped 59 transitions) in 35 ms.
[2024-05-29 17:58:29] [INFO ] Added : 511 causal constraints over 103 iterations in 6062 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 424 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2024-05-29 17:58:29] [INFO ] Invariant cache hit.
[2024-05-29 17:58:29] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-29 17:58:30] [INFO ] Invariant cache hit.
[2024-05-29 17:58:30] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-05-29 17:58:30] [INFO ] Redundant transitions in 109 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2024-05-29 17:58:30] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 17:58:30] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/424 places, 573/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 956 ms. Remains : 424/424 places, 573/574 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-29 17:58:31] [INFO ] Invariant cache hit.
[2024-05-29 17:58:31] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-05-29 17:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 17:58:31] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-05-29 17:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:58:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-29 17:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 17:58:32] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-05-29 17:58:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:58:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-29 17:58:32] [INFO ] Computed and/alt/rep : 513/2194/513 causal constraints (skipped 58 transitions) in 37 ms.
[2024-05-29 17:58:38] [INFO ] Added : 507 causal constraints over 102 iterations in 5940 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27271 reset in 375 ms.
Product exploration explored 100000 steps with 27201 reset in 436 ms.
Built C files in :
/tmp/ltsmin3943684046274812767
[2024-05-29 17:58:39] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2024-05-29 17:58:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:58:39] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2024-05-29 17:58:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:58:39] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2024-05-29 17:58:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:58:39] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3943684046274812767
Running compilation step : cd /tmp/ltsmin3943684046274812767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1306 ms.
Running link step : cd /tmp/ltsmin3943684046274812767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3943684046274812767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1249955579780833018.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 423 transition count 572
Applied a total of 2 rules in 24 ms. Remains 423 /424 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 423 cols
[2024-05-29 17:58:54] [INFO ] Computed 121 invariants in 1 ms
[2024-05-29 17:59:00] [INFO ] Implicit Places using invariants in 5716 ms returned []
[2024-05-29 17:59:00] [INFO ] Invariant cache hit.
[2024-05-29 17:59:00] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 6152 ms to find 0 implicit places.
[2024-05-29 17:59:00] [INFO ] Redundant transitions in 113 ms returned []
[2024-05-29 17:59:00] [INFO ] Invariant cache hit.
[2024-05-29 17:59:00] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/424 places, 572/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6553 ms. Remains : 423/424 places, 572/573 transitions.
Built C files in :
/tmp/ltsmin17049107186969874656
[2024-05-29 17:59:00] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2024-05-29 17:59:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:59:00] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2024-05-29 17:59:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:59:01] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2024-05-29 17:59:01] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:59:01] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17049107186969874656
Running compilation step : cd /tmp/ltsmin17049107186969874656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1383 ms.
Running link step : cd /tmp/ltsmin17049107186969874656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17049107186969874656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11409750962474614935.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:59:16] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:59:16] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:59:16] [INFO ] Time to serialize gal into /tmp/LTL3678389247478792919.gal : 6 ms
[2024-05-29 17:59:16] [INFO ] Time to serialize properties into /tmp/LTL6555680172234438040.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3678389247478792919.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11217890070665855041.hoa' '-atoms' '/tmp/LTL6555680172234438040.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6555680172234438040.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11217890070665855041.hoa
Detected timeout of ITS tools.
[2024-05-29 17:59:31] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:59:31] [INFO ] Flatten gal took : 15 ms
[2024-05-29 17:59:31] [INFO ] Time to serialize gal into /tmp/LTL11769484127617790495.gal : 3 ms
[2024-05-29 17:59:31] [INFO ] Time to serialize properties into /tmp/LTL14011527627387944836.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11769484127617790495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14011527627387944836.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(p1046==1)"))||(X(G("(((p1069==1)&&(p1080==1))&&((p1106==1)&&(p1046==0)))")))))
Formula 0 simplified : G!"(p1046==1)" & XF!"(((p1069==1)&&(p1080==1))&&((p1106==1)&&(p1046==0)))"
Detected timeout of ITS tools.
[2024-05-29 17:59:46] [INFO ] Flatten gal took : 20 ms
[2024-05-29 17:59:46] [INFO ] Applying decomposition
[2024-05-29 17:59:46] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17167664527960850449.txt' '-o' '/tmp/graph17167664527960850449.bin' '-w' '/tmp/graph17167664527960850449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17167664527960850449.bin' '-l' '-1' '-v' '-w' '/tmp/graph17167664527960850449.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:59:46] [INFO ] Decomposing Gal with order
[2024-05-29 17:59:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:59:46] [INFO ] Removed a total of 628 redundant transitions.
[2024-05-29 17:59:46] [INFO ] Flatten gal took : 28 ms
[2024-05-29 17:59:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 650 labels/synchronizations in 6 ms.
[2024-05-29 17:59:46] [INFO ] Time to serialize gal into /tmp/LTL10872774658610391328.gal : 4 ms
[2024-05-29 17:59:46] [INFO ] Time to serialize properties into /tmp/LTL6838320743820301474.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10872774658610391328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6838320743820301474.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i10.i1.u104.p1046==1)"))||(X(G("(((i11.i0.u108.p1069==1)&&(i11.i0.u109.p1080==1))&&((i11.i1.u112.p1106==1)&&(i10.i1.u104.p1046...167
Formula 0 simplified : G!"(i10.i1.u104.p1046==1)" & XF!"(((i11.i0.u108.p1069==1)&&(i11.i0.u109.p1080==1))&&((i11.i1.u112.p1106==1)&&(i10.i1.u104.p1046==0))...157
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13509796083245070300
[2024-05-29 18:00:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13509796083245070300
Running compilation step : cd /tmp/ltsmin13509796083245070300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 907 ms.
Running link step : cd /tmp/ltsmin13509796083245070300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13509796083245070300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-06 finished in 116904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldRVs-PT-030B-LTLFireability-07
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1000 transition count 1030
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 880 transition count 1030
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 240 place count 880 transition count 879
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 542 place count 729 transition count 879
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 551 place count 720 transition count 870
Iterating global reduction 2 with 9 rules applied. Total rules applied 560 place count 720 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 560 place count 720 transition count 869
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 719 transition count 869
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1150 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1152 place count 423 transition count 573
Applied a total of 1152 rules in 70 ms. Remains 423 /1001 variables (removed 578) and now considering 573/1151 (removed 578) transitions.
// Phase 1: matrix 573 rows 423 cols
[2024-05-29 18:00:16] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 18:00:16] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-29 18:00:16] [INFO ] Invariant cache hit.
[2024-05-29 18:00:17] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2024-05-29 18:00:17] [INFO ] Invariant cache hit.
[2024-05-29 18:00:17] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 423/1001 places, 573/1151 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 909 ms. Remains : 423/1001 places, 573/1151 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s73 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][false, false]]
Product exploration explored 100000 steps with 27184 reset in 391 ms.
Product exploration explored 100000 steps with 27117 reset in 475 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/423 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-29 18:00:18] [INFO ] Invariant cache hit.
[2024-05-29 18:00:19] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2024-05-29 18:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:00:19] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-29 18:00:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:00:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-05-29 18:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:00:20] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2024-05-29 18:00:20] [INFO ] Computed and/alt/rep : 505/2162/505 causal constraints (skipped 66 transitions) in 34 ms.
[2024-05-29 18:00:26] [INFO ] Added : 499 causal constraints over 100 iterations in 5855 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 13 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-05-29 18:00:26] [INFO ] Invariant cache hit.
[2024-05-29 18:00:26] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-29 18:00:26] [INFO ] Invariant cache hit.
[2024-05-29 18:00:26] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-29 18:00:26] [INFO ] Redundant transitions in 127 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2024-05-29 18:00:26] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 18:00:27] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/423 places, 572/573 transitions.
Applied a total of 0 rules in 8 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1026 ms. Remains : 423/423 places, 572/573 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/423 stabilizing places and 2/572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-29 18:00:27] [INFO ] Invariant cache hit.
[2024-05-29 18:00:27] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-05-29 18:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:00:28] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-05-29 18:00:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:00:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-29 18:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:00:28] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2024-05-29 18:00:28] [INFO ] Computed and/alt/rep : 505/2163/505 causal constraints (skipped 65 transitions) in 35 ms.
[2024-05-29 18:00:34] [INFO ] Added : 499 causal constraints over 100 iterations in 6238 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27274 reset in 390 ms.
Product exploration explored 100000 steps with 26967 reset in 493 ms.
Built C files in :
/tmp/ltsmin8453296365469177977
[2024-05-29 18:00:35] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2024-05-29 18:00:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:00:35] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2024-05-29 18:00:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:00:35] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2024-05-29 18:00:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:00:35] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8453296365469177977
Running compilation step : cd /tmp/ltsmin8453296365469177977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1269 ms.
Running link step : cd /tmp/ltsmin8453296365469177977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin8453296365469177977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5219073221798219742.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 572/572 transitions.
Applied a total of 0 rules in 11 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2024-05-29 18:00:51] [INFO ] Invariant cache hit.
[2024-05-29 18:00:51] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-29 18:00:51] [INFO ] Invariant cache hit.
[2024-05-29 18:00:51] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-29 18:00:51] [INFO ] Redundant transitions in 100 ms returned []
[2024-05-29 18:00:51] [INFO ] Invariant cache hit.
[2024-05-29 18:00:51] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 951 ms. Remains : 423/423 places, 572/572 transitions.
Built C files in :
/tmp/ltsmin6705514529704099954
[2024-05-29 18:00:51] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2024-05-29 18:00:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:00:51] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2024-05-29 18:00:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:00:52] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2024-05-29 18:00:52] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:00:52] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6705514529704099954
Running compilation step : cd /tmp/ltsmin6705514529704099954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1308 ms.
Running link step : cd /tmp/ltsmin6705514529704099954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6705514529704099954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1851280215984433647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:01:07] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:01:07] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:01:07] [INFO ] Time to serialize gal into /tmp/LTL11065654218819795673.gal : 9 ms
[2024-05-29 18:01:07] [INFO ] Time to serialize properties into /tmp/LTL13159543789723235637.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11065654218819795673.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14478776051867640481.hoa' '-atoms' '/tmp/LTL13159543789723235637.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13159543789723235637.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14478776051867640481.hoa
Detected timeout of ITS tools.
[2024-05-29 18:01:22] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:01:22] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:01:22] [INFO ] Time to serialize gal into /tmp/LTL3494511153000268446.gal : 3 ms
[2024-05-29 18:01:22] [INFO ] Time to serialize properties into /tmp/LTL11638471813056822489.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3494511153000268446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11638471813056822489.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(p230==1)"))))
Formula 0 simplified : XG!"(p230==1)"
Detected timeout of ITS tools.
[2024-05-29 18:01:37] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:01:37] [INFO ] Applying decomposition
[2024-05-29 18:01:37] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8627352791881146522.txt' '-o' '/tmp/graph8627352791881146522.bin' '-w' '/tmp/graph8627352791881146522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8627352791881146522.bin' '-l' '-1' '-v' '-w' '/tmp/graph8627352791881146522.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:01:37] [INFO ] Decomposing Gal with order
[2024-05-29 18:01:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:01:37] [INFO ] Removed a total of 625 redundant transitions.
[2024-05-29 18:01:37] [INFO ] Flatten gal took : 27 ms
[2024-05-29 18:01:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 668 labels/synchronizations in 5 ms.
[2024-05-29 18:01:37] [INFO ] Time to serialize gal into /tmp/LTL14588678392278438272.gal : 3 ms
[2024-05-29 18:01:37] [INFO ] Time to serialize properties into /tmp/LTL552920124228640167.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14588678392278438272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL552920124228640167.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F("(i1.i2.u21.p230==1)"))))
Formula 0 simplified : XG!"(i1.i2.u21.p230==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17313133713392448690
[2024-05-29 18:01:52] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17313133713392448690
Running compilation step : cd /tmp/ltsmin17313133713392448690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 934 ms.
Running link step : cd /tmp/ltsmin17313133713392448690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17313133713392448690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 111032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(F(p1))||p0)))))'
Found a Lengthening insensitive property : ShieldRVs-PT-030B-LTLFireability-09
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1001/1001 places, 1151/1151 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1000 transition count 1029
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 879 transition count 1029
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 879 transition count 879
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 729 transition count 879
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 550 place count 721 transition count 871
Iterating global reduction 2 with 8 rules applied. Total rules applied 558 place count 721 transition count 871
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 558 place count 721 transition count 870
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 560 place count 720 transition count 870
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1148 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1150 place count 424 transition count 574
Applied a total of 1150 rules in 81 ms. Remains 424 /1001 variables (removed 577) and now considering 574/1151 (removed 577) transitions.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 18:02:07] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 18:02:08] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-29 18:02:08] [INFO ] Invariant cache hit.
[2024-05-29 18:02:08] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2024-05-29 18:02:08] [INFO ] Invariant cache hit.
[2024-05-29 18:02:08] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 424/1001 places, 574/1151 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 987 ms. Remains : 424/1001 places, 574/1151 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s412 1) (EQ s19 0)), p1:(EQ s186 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 247 reset in 370 ms.
Product exploration explored 100000 steps with 246 reset in 440 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 8151 steps, including 19 resets, run visited all 2 properties in 45 ms. (steps per millisecond=181 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2024-05-29 18:02:10] [INFO ] Invariant cache hit.
[2024-05-29 18:02:10] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 18:02:10] [INFO ] Invariant cache hit.
[2024-05-29 18:02:10] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-05-29 18:02:10] [INFO ] Invariant cache hit.
[2024-05-29 18:02:11] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 874 ms. Remains : 424/424 places, 574/574 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 776 steps, including 1 resets, run visited all 2 properties in 6 ms. (steps per millisecond=129 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 247 reset in 450 ms.
Product exploration explored 100000 steps with 248 reset in 519 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2024-05-29 18:02:13] [INFO ] Redundant transitions in 111 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2024-05-29 18:02:13] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 18:02:13] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/424 places, 573/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 386 ms. Remains : 424/424 places, 573/574 transitions.
Built C files in :
/tmp/ltsmin10780319076751487270
[2024-05-29 18:02:13] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10780319076751487270
Running compilation step : cd /tmp/ltsmin10780319076751487270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 912 ms.
Running link step : cd /tmp/ltsmin10780319076751487270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10780319076751487270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1820264583793037246.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 424 cols
[2024-05-29 18:02:28] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 18:02:29] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-29 18:02:29] [INFO ] Invariant cache hit.
[2024-05-29 18:02:29] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-05-29 18:02:29] [INFO ] Invariant cache hit.
[2024-05-29 18:02:29] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 999 ms. Remains : 424/424 places, 574/574 transitions.
Built C files in :
/tmp/ltsmin9765804762999570209
[2024-05-29 18:02:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9765804762999570209
Running compilation step : cd /tmp/ltsmin9765804762999570209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 908 ms.
Running link step : cd /tmp/ltsmin9765804762999570209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9765804762999570209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7087275971217978007.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:02:45] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:02:45] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:02:45] [INFO ] Time to serialize gal into /tmp/LTL4800623998814203537.gal : 3 ms
[2024-05-29 18:02:45] [INFO ] Time to serialize properties into /tmp/LTL6193647636955674944.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4800623998814203537.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15499390684000001588.hoa' '-atoms' '/tmp/LTL6193647636955674944.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6193647636955674944.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15499390684000001588.hoa
Detected timeout of ITS tools.
[2024-05-29 18:03:00] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:03:00] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:03:00] [INFO ] Time to serialize gal into /tmp/LTL11236121400262290071.gal : 3 ms
[2024-05-29 18:03:00] [INFO ] Time to serialize properties into /tmp/LTL3625159094034682598.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11236121400262290071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3625159094034682598.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((p1172==1)||(p81==0))")||(X(F("(p543==0)"))))))))
Formula 0 simplified : XXF(!"((p1172==1)||(p81==0))" & XG!"(p543==0)")
Detected timeout of ITS tools.
[2024-05-29 18:03:15] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:03:15] [INFO ] Applying decomposition
[2024-05-29 18:03:15] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8667154757222181609.txt' '-o' '/tmp/graph8667154757222181609.bin' '-w' '/tmp/graph8667154757222181609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8667154757222181609.bin' '-l' '-1' '-v' '-w' '/tmp/graph8667154757222181609.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:03:15] [INFO ] Decomposing Gal with order
[2024-05-29 18:03:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:03:15] [INFO ] Removed a total of 627 redundant transitions.
[2024-05-29 18:03:15] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:03:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 640 labels/synchronizations in 5 ms.
[2024-05-29 18:03:15] [INFO ] Time to serialize gal into /tmp/LTL16752761782356478262.gal : 3 ms
[2024-05-29 18:03:15] [INFO ] Time to serialize properties into /tmp/LTL14547376648329797646.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16752761782356478262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14547376648329797646.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i12.i1.u118.p1172==1)||(i0.i1.u5.p81==0))")||(X(F("(i5.u53.p543==0)"))))))))
Formula 0 simplified : XXF(!"((i12.i1.u118.p1172==1)||(i0.i1.u5.p81==0))" & XG!"(i5.u53.p543==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16410095274245538238
[2024-05-29 18:03:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16410095274245538238
Running compilation step : cd /tmp/ltsmin16410095274245538238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 914 ms.
Running link step : cd /tmp/ltsmin16410095274245538238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16410095274245538238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLFireability-09 finished in 98049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p0&&F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
[2024-05-29 18:03:45] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10304661851401074861
[2024-05-29 18:03:46] [INFO ] Applying decomposition
[2024-05-29 18:03:46] [INFO ] Computing symmetric may disable matrix : 1151 transitions.
[2024-05-29 18:03:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:46] [INFO ] Computing symmetric may enable matrix : 1151 transitions.
[2024-05-29 18:03:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:46] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4944152989059629519.txt' '-o' '/tmp/graph4944152989059629519.bin' '-w' '/tmp/graph4944152989059629519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4944152989059629519.bin' '-l' '-1' '-v' '-w' '/tmp/graph4944152989059629519.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:03:46] [INFO ] Decomposing Gal with order
[2024-05-29 18:03:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:03:46] [INFO ] Removed a total of 1071 redundant transitions.
[2024-05-29 18:03:46] [INFO ] Flatten gal took : 44 ms
[2024-05-29 18:03:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 18:03:46] [INFO ] Computing Do-Not-Accords matrix : 1151 transitions.
[2024-05-29 18:03:46] [INFO ] Time to serialize gal into /tmp/LTLFireability3748443813553240031.gal : 9 ms
[2024-05-29 18:03:46] [INFO ] Time to serialize properties into /tmp/LTLFireability17031083843108369404.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3748443813553240031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17031083843108369404.ltl' '-c' '-stutter-deadlock'
[2024-05-29 18:03:46] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:46] [INFO ] Built C files in 249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10304661851401074861
Running compilation step : cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 7 LTL properties
Checking formula 0 : !((X((F((G("(((i0.i1.u31.p83==1)&&(i0.i1.u32.p88==1))&&(i0.i1.u34.p96==1))"))||(G("(i5.i0.u147.p463!=1)"))))U(G("(i3.i6.u92.p281==1)")...159
Formula 0 simplified : X(G(F!"(((i0.i1.u31.p83==1)&&(i0.i1.u32.p88==1))&&(i0.i1.u34.p96==1))" & F!"(i5.i0.u147.p463!=1)") R F!"(i3.i6.u92.p281==1)")
Compilation finished in 3397 ms.
Running link step : cd /tmp/ltsmin10304661851401074861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 112 ms.
Running LTSmin : cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp3==true))||X([]((LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp3==true))||X([]((LTLAPp4==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X(<>((LTLAPp7==true)))||(LTLAPp6==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 18:31:17] [INFO ] Applying decomposition
[2024-05-29 18:31:17] [INFO ] Flatten gal took : 498 ms
[2024-05-29 18:31:17] [INFO ] Decomposing Gal with order
[2024-05-29 18:31:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:31:19] [INFO ] Removed a total of 627 redundant transitions.
[2024-05-29 18:31:19] [INFO ] Flatten gal took : 515 ms
[2024-05-29 18:31:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 952 labels/synchronizations in 224 ms.
[2024-05-29 18:31:20] [INFO ] Time to serialize gal into /tmp/LTLFireability17833912944621730655.gal : 71 ms
[2024-05-29 18:31:20] [INFO ] Time to serialize properties into /tmp/LTLFireability16584370941678566182.ltl : 61 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17833912944621730655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16584370941678566182.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 7 LTL properties
Checking formula 0 : !((X((F((G("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u41.p83==1)&&(i0.i0.i0.i0....540
Formula 0 simplified : X(G(F!"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u41.p83==1)&&(i0.i0.i0.i0.i0....529
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X(<>((LTLAPp7==true)))||(LTLAPp6==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10304661851401074861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp8==true))&&<>([]((LTLAPp9==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9878728 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15958384 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-030B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVs-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789500518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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