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.r400-tall-171690531800220.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 itstools
Input is StigmergyCommit-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 155M 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 StigmergyCommit-PT-10a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716999572980

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 16:19:34] [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 16:19:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:19:39] [INFO ] Load time of PNML (sax parser for PT used): 4989 ms
[2024-05-29 16:19:39] [INFO ] Transformed 400 places.
[2024-05-29 16:19:39] [INFO ] Transformed 136960 transitions.
[2024-05-29 16:19:39] [INFO ] Found NUPN structural information;
[2024-05-29 16:19:39] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 5830 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 312 transition count 4516
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 312 transition count 4516
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 187 place count 312 transition count 4505
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 232 place count 267 transition count 4449
Iterating global reduction 1 with 45 rules applied. Total rules applied 277 place count 267 transition count 4449
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 288 place count 267 transition count 4438
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 299 place count 256 transition count 4427
Iterating global reduction 2 with 11 rules applied. Total rules applied 310 place count 256 transition count 4427
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 321 place count 245 transition count 4416
Iterating global reduction 2 with 11 rules applied. Total rules applied 332 place count 245 transition count 4416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 343 place count 234 transition count 4405
Iterating global reduction 2 with 11 rules applied. Total rules applied 354 place count 234 transition count 4405
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 365 place count 223 transition count 4394
Iterating global reduction 2 with 11 rules applied. Total rules applied 376 place count 223 transition count 4394
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 387 place count 223 transition count 4383
Applied a total of 387 rules in 257 ms. Remains 223 /400 variables (removed 177) and now considering 4383/4615 (removed 232) transitions.
[2024-05-29 16:19:41] [INFO ] Flow matrix only has 4371 transitions (discarded 12 similar events)
// Phase 1: matrix 4371 rows 223 cols
[2024-05-29 16:19:41] [INFO ] Computed 2 invariants in 78 ms
[2024-05-29 16:19:41] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-29 16:19:41] [INFO ] Flow matrix only has 4371 transitions (discarded 12 similar events)
[2024-05-29 16:19:41] [INFO ] Invariant cache hit.
[2024-05-29 16:19:43] [INFO ] State equation strengthened by 4192 read => feed constraints.
[2024-05-29 16:19:46] [INFO ] Implicit Places using invariants and state equation in 4372 ms returned [222]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4719 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 222/400 places, 4383/4615 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 190 transition count 4351
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 190 transition count 4351
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 75 place count 190 transition count 4340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 179 transition count 4329
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 179 transition count 4329
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 108 place count 168 transition count 4318
Iterating global reduction 1 with 11 rules applied. Total rules applied 119 place count 168 transition count 4318
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 130 place count 157 transition count 4307
Iterating global reduction 1 with 11 rules applied. Total rules applied 141 place count 157 transition count 4307
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 152 place count 146 transition count 4296
Iterating global reduction 1 with 11 rules applied. Total rules applied 163 place count 146 transition count 4296
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 173 place count 136 transition count 4286
Iterating global reduction 1 with 10 rules applied. Total rules applied 183 place count 136 transition count 4286
Applied a total of 183 rules in 125 ms. Remains 136 /222 variables (removed 86) and now considering 4286/4383 (removed 97) transitions.
[2024-05-29 16:19:46] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:19:46] [INFO ] Computed 1 invariants in 30 ms
[2024-05-29 16:19:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 16:19:46] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:19:46] [INFO ] Invariant cache hit.
[2024-05-29 16:19:47] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:19:48] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 136/400 places, 4286/4615 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6779 ms. Remains : 136/400 places, 4286/4615 transitions.
Support contains 11 out of 136 places after structural reductions.
[2024-05-29 16:19:48] [INFO ] Flatten gal took : 530 ms
[2024-05-29 16:19:49] [INFO ] Flatten gal took : 284 ms
[2024-05-29 16:19:49] [INFO ] Input system was already deterministic with 4286 transitions.
Reduction of identical properties reduced properties to check from 10 to 3
RANDOM walk for 40000 steps (9 resets) in 11650 ms. (3 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
[2024-05-29 16:19:52] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:19:52] [INFO ] Invariant cache hit.
[2024-05-29 16:19:53] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4273/4409 variables, 136/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4409 variables, 4103/4240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4409 variables, 0/4240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/4410 variables, 1/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4410 variables, 0/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4410 variables, 0/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4410/4410 variables, and 4241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 136/4410 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/136 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2510ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-10a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA StigmergyCommit-PT-10a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((F(p0)&&p1)))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:19:55] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:19:55] [INFO ] Invariant cache hit.
[2024-05-29 16:19:55] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 16:19:55] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:19:55] [INFO ] Invariant cache hit.
[2024-05-29 16:19:57] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:19:57] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:19:57] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:19:57] [INFO ] Invariant cache hit.
[2024-05-29 16:19:58] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98167ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98222ms
Finished structural reductions in LTL mode , in 1 iterations and 99948 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-01
Product exploration explored 100000 steps with 1428 reset in 1926 ms.
Product exploration explored 100000 steps with 1428 reset in 1809 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (8 resets) in 10792 ms. (3 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 623 ms. (64 steps per ms) remains 1/1 properties
[2024-05-29 16:21:43] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:21:43] [INFO ] Invariant cache hit.
[2024-05-29 16:21:43] [INFO ] State equation strengthened by 4104 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 11/4410 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/136 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-29 16:21:43] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:21:43] [INFO ] Invariant cache hit.
[2024-05-29 16:21:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:21:47] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2024-05-29 16:21:48] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:21:48] [INFO ] [Real]Added 4104 Read/Feed constraints in 378 ms returned sat
[2024-05-29 16:21:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:21:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-29 16:21:51] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2024-05-29 16:21:52] [INFO ] [Nat]Added 4104 Read/Feed constraints in 444 ms returned sat
[2024-05-29 16:21:53] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1080 ms.
[2024-05-29 16:21:57] [INFO ] Added : 111 causal constraints over 23 iterations in 5160 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:21:57] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:21:57] [INFO ] Invariant cache hit.
[2024-05-29 16:21:57] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 16:21:57] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:21:57] [INFO ] Invariant cache hit.
[2024-05-29 16:21:58] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:21:58] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:21:58] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:21:58] [INFO ] Invariant cache hit.
[2024-05-29 16:21:59] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97540ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97594ms
Finished structural reductions in LTL mode , in 1 iterations and 99075 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 276 steps (0 resets) in 22 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-29 16:23:37] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:23:37] [INFO ] Invariant cache hit.
[2024-05-29 16:23:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:23:40] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2024-05-29 16:23:40] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:23:40] [INFO ] [Real]Added 4104 Read/Feed constraints in 368 ms returned sat
[2024-05-29 16:23:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:23:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:23:44] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2024-05-29 16:23:44] [INFO ] [Nat]Added 4104 Read/Feed constraints in 460 ms returned sat
[2024-05-29 16:23:45] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1027 ms.
[2024-05-29 16:23:49] [INFO ] Added : 111 causal constraints over 23 iterations in 5108 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1428 reset in 1768 ms.
Product exploration explored 100000 steps with 1428 reset in 1790 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 1 ms
Applied a total of 2328 rules in 2196 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-05-29 16:23:56] [INFO ] Redundant transitions in 299 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-05-29 16:23:56] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-05-29 16:23:56] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 16:23:56] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 3 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 16:24:38] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 16:24:39] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 16:24:39] [INFO ] Deduced a trap composed of 5 places in 613 ms of which 1 ms to minimize.
[2024-05-29 16:24:40] [INFO ] Deduced a trap composed of 5 places in 607 ms of which 1 ms to minimize.
[2024-05-29 16:24:40] [INFO ] Deduced a trap composed of 5 places in 499 ms of which 1 ms to minimize.
[2024-05-29 16:24:41] [INFO ] Deduced a trap composed of 5 places in 670 ms of which 1 ms to minimize.
[2024-05-29 16:24:42] [INFO ] Deduced a trap composed of 5 places in 558 ms of which 1 ms to minimize.
[2024-05-29 16:24:42] [INFO ] Deduced a trap composed of 5 places in 565 ms of which 1 ms to minimize.
[2024-05-29 16:24:43] [INFO ] Deduced a trap composed of 5 places in 547 ms of which 0 ms to minimize.
[2024-05-29 16:24:43] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 1 ms to minimize.
[2024-05-29 16:24:44] [INFO ] Deduced a trap composed of 5 places in 404 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:24:45] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 1 ms to minimize.
[2024-05-29 16:24:45] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 0 ms to minimize.
[2024-05-29 16:24:45] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 1 ms to minimize.
[2024-05-29 16:24:45] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2024-05-29 16:24:46] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2024-05-29 16:24:46] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2024-05-29 16:24:46] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2024-05-29 16:24:46] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 0 ms to minimize.
[2024-05-29 16:24:47] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 16:24:47] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2024-05-29 16:24:47] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2024-05-29 16:24:47] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 1 ms to minimize.
[2024-05-29 16:24:48] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 2 ms to minimize.
[2024-05-29 16:24:48] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 2 ms to minimize.
[2024-05-29 16:24:48] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 4 ms to minimize.
[2024-05-29 16:24:48] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2024-05-29 16:24:49] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2024-05-29 16:24:49] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2024-05-29 16:24:49] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2024-05-29 16:24:49] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:24:54] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2024-05-29 16:24:54] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
[2024-05-29 16:24:55] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2024-05-29 16:24:55] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2024-05-29 16:24:55] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 16:24:55] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 16:24:55] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 16:24:56] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 16:24:56] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2024-05-29 16:24:56] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 16:24:56] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-05-29 16:24:56] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2024-05-29 16:24:56] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-29 16:24:57] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2024-05-29 16:24:57] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
[2024-05-29 16:24:57] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-29 16:24:57] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 16:24:57] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 16:24:57] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2024-05-29 16:24:57] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:24:58] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2024-05-29 16:24:58] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-05-29 16:24:58] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2024-05-29 16:24:59] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 16:24:59] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/2205 variables, and 66 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/68 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2148/56 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:25:05] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2024-05-29 16:25:05] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2024-05-29 16:25:06] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2024-05-29 16:25:06] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 16:25:06] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 16:25:06] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 16:25:06] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2024-05-29 16:25:06] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-05-29 16:25:06] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-05-29 16:25:07] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2024-05-29 16:25:07] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-29 16:25:07] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 16:25:07] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 16:25:07] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 16:25:07] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 16:25:07] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2024-05-29 16:25:08] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2024-05-29 16:25:08] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2024-05-29 16:25:08] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 16:25:08] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:25:10] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 16:25:10] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2024-05-29 16:25:10] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2024-05-29 16:25:10] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
[2024-05-29 16:25:10] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 2 ms to minimize.
[2024-05-29 16:25:10] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-29 16:25:13] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 1 ms to minimize.
[2024-05-29 16:25:13] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
[2024-05-29 16:25:13] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2024-05-29 16:25:13] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2024-05-29 16:25:14] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2024-05-29 16:25:14] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2024-05-29 16:25:14] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 16:25:14] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 16:25:15] [INFO ] Deduced a trap composed of 5 places in 421 ms of which 1 ms to minimize.
[2024-05-29 16:25:15] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 0 ms to minimize.
[2024-05-29 16:25:15] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 0 ms to minimize.
[2024-05-29 16:25:15] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
[2024-05-29 16:25:16] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2024-05-29 16:25:16] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/106 constraints. Problems are: Problem set: 44 solved, 2104 unsolved
[2024-05-29 16:25:18] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2024-05-29 16:25:18] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 16:25:18] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-29 16:25:19] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2024-05-29 16:25:19] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 16:25:19] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2024-05-29 16:25:19] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-29 16:25:19] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-05-29 16:25:20] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2024-05-29 16:25:20] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2024-05-29 16:25:20] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2024-05-29 16:25:20] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 16:25:20] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 0 ms to minimize.
[2024-05-29 16:25:20] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2024-05-29 16:25:21] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 16:25:21] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2024-05-29 16:25:21] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-29 16:25:21] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2024-05-29 16:25:21] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
[2024-05-29 16:25:21] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 20/126 constraints. Problems are: Problem set: 44 solved, 2104 unsolved
[2024-05-29 16:25:24] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 16:25:24] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 16:25:24] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-29 16:25:24] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2024-05-29 16:25:24] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 68/2205 variables, and 131 constraints, problems are : Problem set: 44 solved, 2104 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/68 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/56 constraints, Known Traps: 130/130 constraints]
After SMT, in 93032ms problems are : Problem set: 44 solved, 2104 unsolved
Search for dead transitions found 44 dead transitions in 93053ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2105/4286 transitions.
Graph (complete) has 419 edges and 68 vertex of which 35 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.7 ms
Discarding 33 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 687 ms. Remains 35 /68 variables (removed 33) and now considering 2105/2105 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/136 places, 2105/4286 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96251 ms. Remains : 35/136 places, 2105/4286 transitions.
Built C files in :
/tmp/ltsmin8212221173118284619
[2024-05-29 16:25:30] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8212221173118284619
Running compilation step : cd /tmp/ltsmin8212221173118284619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8212221173118284619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8212221173118284619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:25:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:25:33] [INFO ] Computed 1 invariants in 19 ms
[2024-05-29 16:25:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 16:25:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:25:33] [INFO ] Invariant cache hit.
[2024-05-29 16:25:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:25:34] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:25:34] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:25:34] [INFO ] Invariant cache hit.
[2024-05-29 16:25:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97941ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97984ms
Finished structural reductions in LTL mode , in 1 iterations and 99462 ms. Remains : 136/136 places, 4286/4286 transitions.
Built C files in :
/tmp/ltsmin6128489019362319468
[2024-05-29 16:27:12] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6128489019362319468
Running compilation step : cd /tmp/ltsmin6128489019362319468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6128489019362319468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6128489019362319468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 16:27:16] [INFO ] Flatten gal took : 265 ms
[2024-05-29 16:27:16] [INFO ] Flatten gal took : 262 ms
[2024-05-29 16:27:16] [INFO ] Time to serialize gal into /tmp/LTL6214906689503830331.gal : 98 ms
[2024-05-29 16:27:16] [INFO ] Time to serialize properties into /tmp/LTL7280131552545716949.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6214906689503830331.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13812750211327779608.hoa' '-atoms' '/tmp/LTL7280131552545716949.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7280131552545716949.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13812750211327779608.hoa
Detected timeout of ITS tools.
[2024-05-29 16:27:32] [INFO ] Flatten gal took : 263 ms
[2024-05-29 16:27:32] [INFO ] Flatten gal took : 263 ms
[2024-05-29 16:27:32] [INFO ] Time to serialize gal into /tmp/LTL8869976757684684053.gal : 52 ms
[2024-05-29 16:27:32] [INFO ] Time to serialize properties into /tmp/LTL5457161768447823749.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8869976757684684053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5457161768447823749.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F(("((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))")&&(("((p318==1)&&(p354==...472
Formula 0 simplified : X(!"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&(p...460
Detected timeout of ITS tools.
[2024-05-29 16:27:48] [INFO ] Flatten gal took : 259 ms
[2024-05-29 16:27:48] [INFO ] Applying decomposition
[2024-05-29 16:27:48] [INFO ] Flatten gal took : 262 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph986870340099462789.txt' '-o' '/tmp/graph986870340099462789.bin' '-w' '/tmp/graph986870340099462789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph986870340099462789.bin' '-l' '-1' '-v' '-w' '/tmp/graph986870340099462789.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:27:49] [INFO ] Decomposing Gal with order
[2024-05-29 16:27:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:27:50] [INFO ] Removed a total of 45152 redundant transitions.
[2024-05-29 16:27:50] [INFO ] Flatten gal took : 1127 ms
[2024-05-29 16:27:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 396 ms.
[2024-05-29 16:27:51] [INFO ] Time to serialize gal into /tmp/LTL6834286007913464680.gal : 52 ms
[2024-05-29 16:27:51] [INFO ] Time to serialize properties into /tmp/LTL14053842011630011451.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6834286007913464680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14053842011630011451.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(("((((i0.u5.p30==1)&&(i0.u24.p66==1))&&((i0.u7.p102==1)&&(i0.u18.p138==1)))&&(((i0.u40.p174==1)&&(i0.u1.p210==1))&&((i0.u34.p2...694
Formula 0 simplified : X(!"(((((i0.u5.p30==1)&&(i0.u24.p66==1))&&((i0.u7.p102==1)&&(i0.u18.p138==1)))&&(((i0.u40.p174==1)&&(i0.u1.p210==1))&&((i0.u34.p246=...682
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-01 finished in 490553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2403 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-05-29 16:28:08] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 16:28:08] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 16:28:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 16:28:08] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:28:08] [INFO ] Invariant cache hit.
[2024-05-29 16:28:09] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:28:09] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2024-05-29 16:28:09] [INFO ] Redundant transitions in 300 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 16:28:09] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:28:09] [INFO ] Invariant cache hit.
[2024-05-29 16:28:09] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:28:49] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 16:28:49] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:28:49] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 16:28:49] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:28:49] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-29 16:28:49] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 16:28:50] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 16:28:50] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 16:28:50] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 16:28:51] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 1 ms to minimize.
[2024-05-29 16:28:51] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2024-05-29 16:28:52] [INFO ] Deduced a trap composed of 4 places in 610 ms of which 2 ms to minimize.
[2024-05-29 16:28:52] [INFO ] Deduced a trap composed of 4 places in 597 ms of which 1 ms to minimize.
[2024-05-29 16:28:53] [INFO ] Deduced a trap composed of 4 places in 600 ms of which 0 ms to minimize.
[2024-05-29 16:28:54] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 0 ms to minimize.
[2024-05-29 16:28:54] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 0 ms to minimize.
[2024-05-29 16:28:55] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 0 ms to minimize.
[2024-05-29 16:28:55] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 1 ms to minimize.
[2024-05-29 16:28:55] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2024-05-29 16:28:56] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:28:56] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 16:28:56] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:28:56] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 16:28:57] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 16:28:58] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2024-05-29 16:28:58] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-29 16:28:58] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 16:28:58] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 16:28:58] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-29 16:28:59] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 16:28:59] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:29:03] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2024-05-29 16:29:03] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2024-05-29 16:29:03] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 16:29:03] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 16:29:04] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-29 16:29:04] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-29 16:29:04] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-29 16:29:04] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 16:29:04] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-29 16:29:05] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 16:29:05] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 16:29:05] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 16:29:05] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 16:29:05] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 16:29:05] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93462ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93484ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96907 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-02 finished in 97080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 17 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:29:43] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:29:43] [INFO ] Computed 1 invariants in 21 ms
[2024-05-29 16:29:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 16:29:43] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:29:43] [INFO ] Invariant cache hit.
[2024-05-29 16:29:44] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:29:44] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1482 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:29:45] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:29:45] [INFO ] Invariant cache hit.
[2024-05-29 16:29:45] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97511ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97554ms
Finished structural reductions in LTL mode , in 1 iterations and 99072 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-03
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 11 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-03 finished in 99291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2396 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-05-29 16:31:25] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 16:31:25] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 16:31:25] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 16:31:25] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:31:25] [INFO ] Invariant cache hit.
[2024-05-29 16:31:25] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:31:25] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-05-29 16:31:26] [INFO ] Redundant transitions in 272 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 16:31:26] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:31:26] [INFO ] Invariant cache hit.
[2024-05-29 16:31:26] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:32:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 16:32:05] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 16:32:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 16:32:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 16:32:05] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-29 16:32:05] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 16:32:05] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-29 16:32:06] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-29 16:32:06] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 16:32:06] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 1 ms to minimize.
[2024-05-29 16:32:07] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 0 ms to minimize.
[2024-05-29 16:32:08] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 0 ms to minimize.
[2024-05-29 16:32:08] [INFO ] Deduced a trap composed of 4 places in 596 ms of which 1 ms to minimize.
[2024-05-29 16:32:09] [INFO ] Deduced a trap composed of 4 places in 597 ms of which 0 ms to minimize.
[2024-05-29 16:32:10] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2024-05-29 16:32:10] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 1 ms to minimize.
[2024-05-29 16:32:10] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 0 ms to minimize.
[2024-05-29 16:32:11] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2024-05-29 16:32:11] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 0 ms to minimize.
[2024-05-29 16:32:12] [INFO ] Deduced a trap composed of 4 places in 500 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:32:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:32:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 16:32:12] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 16:32:12] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 16:32:12] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 16:32:13] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 16:32:13] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 16:32:13] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 16:32:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 16:32:13] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 16:32:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 16:32:13] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 16:32:13] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 16:32:14] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2024-05-29 16:32:14] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-29 16:32:14] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 16:32:14] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 16:32:14] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-29 16:32:14] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 16:32:14] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:32:18] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 0 ms to minimize.
[2024-05-29 16:32:19] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2024-05-29 16:32:19] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-29 16:32:19] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2024-05-29 16:32:19] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 16:32:19] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 16:32:20] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-29 16:32:20] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 16:32:20] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 16:32:20] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 16:32:20] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 16:32:21] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 16:32:21] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 16:32:21] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 16:32:21] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2125 variables, 1/2159 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92882ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92902ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96249 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 5 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-04 finished in 96392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:32:59] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:32:59] [INFO ] Computed 1 invariants in 22 ms
[2024-05-29 16:32:59] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 16:32:59] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:32:59] [INFO ] Invariant cache hit.
[2024-05-29 16:33:00] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:33:00] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:33:00] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:33:00] [INFO ] Invariant cache hit.
[2024-05-29 16:33:00] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97663ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97705ms
Finished structural reductions in LTL mode , in 1 iterations and 99150 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-05 finished in 99296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p1)||X((p1 U X(p1)))||p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 16 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:34:38] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:34:38] [INFO ] Invariant cache hit.
[2024-05-29 16:34:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 16:34:38] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:34:38] [INFO ] Invariant cache hit.
[2024-05-29 16:34:39] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:34:39] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:34:39] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:34:39] [INFO ] Invariant cache hit.
[2024-05-29 16:34:40] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97619ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97662ms
Finished structural reductions in LTL mode , in 1 iterations and 99108 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 310 ms :[false, false, p1, false, false, (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 30 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-10a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-10a-LTLFireability-06 finished in 100033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:36:18] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:36:18] [INFO ] Invariant cache hit.
[2024-05-29 16:36:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 16:36:18] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:36:18] [INFO ] Invariant cache hit.
[2024-05-29 16:36:19] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:36:19] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:36:19] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:36:19] [INFO ] Invariant cache hit.
[2024-05-29 16:36:20] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98105ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98149ms
Finished structural reductions in LTL mode , in 1 iterations and 99615 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 1428 reset in 1941 ms.
Product exploration explored 100000 steps with 1428 reset in 1973 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 16 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 16:38:02] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:38:02] [INFO ] Invariant cache hit.
[2024-05-29 16:38:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:38:06] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2024-05-29 16:38:06] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:38:06] [INFO ] [Real]Added 4104 Read/Feed constraints in 365 ms returned sat
[2024-05-29 16:38:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:38:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:38:09] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2024-05-29 16:38:10] [INFO ] [Nat]Added 4104 Read/Feed constraints in 461 ms returned sat
[2024-05-29 16:38:11] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1012 ms.
[2024-05-29 16:38:15] [INFO ] Added : 111 causal constraints over 23 iterations in 5055 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:38:15] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:38:15] [INFO ] Invariant cache hit.
[2024-05-29 16:38:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 16:38:15] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:38:15] [INFO ] Invariant cache hit.
[2024-05-29 16:38:16] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:38:16] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:38:16] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:38:16] [INFO ] Invariant cache hit.
[2024-05-29 16:38:17] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97752ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97794ms
Finished structural reductions in LTL mode , in 1 iterations and 99259 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 14 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 16:39:55] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:39:55] [INFO ] Invariant cache hit.
[2024-05-29 16:39:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:39:58] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2024-05-29 16:39:59] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:39:59] [INFO ] [Real]Added 4104 Read/Feed constraints in 370 ms returned sat
[2024-05-29 16:39:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:40:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 16:40:02] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-29 16:40:03] [INFO ] [Nat]Added 4104 Read/Feed constraints in 461 ms returned sat
[2024-05-29 16:40:03] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 595 ms.
[2024-05-29 16:40:07] [INFO ] Added : 111 causal constraints over 23 iterations in 4552 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1428 reset in 1933 ms.
Product exploration explored 100000 steps with 1428 reset in 1945 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 2328 rules in 1713 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-05-29 16:40:13] [INFO ] Redundant transitions in 287 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-05-29 16:40:13] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-05-29 16:40:13] [INFO ] Computed 1 invariants in 18 ms
[2024-05-29 16:40:14] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 16:40:56] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-29 16:40:57] [INFO ] Deduced a trap composed of 5 places in 599 ms of which 1 ms to minimize.
[2024-05-29 16:40:58] [INFO ] Deduced a trap composed of 5 places in 609 ms of which 1 ms to minimize.
[2024-05-29 16:40:58] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 1 ms to minimize.
[2024-05-29 16:40:59] [INFO ] Deduced a trap composed of 5 places in 664 ms of which 1 ms to minimize.
[2024-05-29 16:40:59] [INFO ] Deduced a trap composed of 5 places in 558 ms of which 1 ms to minimize.
[2024-05-29 16:41:00] [INFO ] Deduced a trap composed of 5 places in 560 ms of which 1 ms to minimize.
[2024-05-29 16:41:00] [INFO ] Deduced a trap composed of 5 places in 569 ms of which 1 ms to minimize.
[2024-05-29 16:41:01] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 1 ms to minimize.
[2024-05-29 16:41:01] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:41:02] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 0 ms to minimize.
[2024-05-29 16:41:03] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 0 ms to minimize.
[2024-05-29 16:41:03] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
[2024-05-29 16:41:03] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2024-05-29 16:41:03] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2024-05-29 16:41:04] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2024-05-29 16:41:04] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 0 ms to minimize.
[2024-05-29 16:41:04] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2024-05-29 16:41:04] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 0 ms to minimize.
[2024-05-29 16:41:05] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2024-05-29 16:41:05] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
[2024-05-29 16:41:05] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 0 ms to minimize.
[2024-05-29 16:41:05] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 0 ms to minimize.
[2024-05-29 16:41:06] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2024-05-29 16:41:06] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2024-05-29 16:41:06] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2024-05-29 16:41:06] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2024-05-29 16:41:07] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2024-05-29 16:41:07] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2024-05-29 16:41:07] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:41:12] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 0 ms to minimize.
[2024-05-29 16:41:12] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 0 ms to minimize.
[2024-05-29 16:41:12] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2024-05-29 16:41:12] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 16:41:13] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2024-05-29 16:41:13] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 16:41:13] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 16:41:13] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 16:41:13] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2024-05-29 16:41:13] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2024-05-29 16:41:14] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 16:41:14] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2024-05-29 16:41:14] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2024-05-29 16:41:14] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2024-05-29 16:41:14] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 16:41:14] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2024-05-29 16:41:14] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 16:41:15] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-05-29 16:41:15] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 16:41:15] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:41:16] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2024-05-29 16:41:16] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2024-05-29 16:41:16] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2024-05-29 16:41:16] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-29 16:41:16] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 16:41:17] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
SMT process timed out in 63104ms, After SMT, problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 63125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2149/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65141 ms. Remains : 68/136 places, 2149/4286 transitions.
Built C files in :
/tmp/ltsmin6230353282548747426
[2024-05-29 16:41:17] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6230353282548747426
Running compilation step : cd /tmp/ltsmin6230353282548747426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6230353282548747426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6230353282548747426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:41:20] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:41:20] [INFO ] Computed 1 invariants in 22 ms
[2024-05-29 16:41:20] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 16:41:20] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:41:20] [INFO ] Invariant cache hit.
[2024-05-29 16:41:21] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:41:21] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:41:21] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:41:21] [INFO ] Invariant cache hit.
[2024-05-29 16:41:21] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98318ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98362ms
Finished structural reductions in LTL mode , in 1 iterations and 99866 ms. Remains : 136/136 places, 4286/4286 transitions.
Built C files in :
/tmp/ltsmin11755453107707714232
[2024-05-29 16:43:00] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11755453107707714232
Running compilation step : cd /tmp/ltsmin11755453107707714232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin11755453107707714232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin11755453107707714232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 16:43:03] [INFO ] Flatten gal took : 270 ms
[2024-05-29 16:43:03] [INFO ] Flatten gal took : 265 ms
[2024-05-29 16:43:03] [INFO ] Time to serialize gal into /tmp/LTL11272567074569827568.gal : 51 ms
[2024-05-29 16:43:03] [INFO ] Time to serialize properties into /tmp/LTL3428836580979365128.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11272567074569827568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10017206510587725115.hoa' '-atoms' '/tmp/LTL3428836580979365128.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3428836580979365128.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10017206510587725115.hoa
Detected timeout of ITS tools.
[2024-05-29 16:43:19] [INFO ] Flatten gal took : 273 ms
[2024-05-29 16:43:19] [INFO ] Flatten gal took : 260 ms
[2024-05-29 16:43:19] [INFO ] Time to serialize gal into /tmp/LTL17594854499095569886.gal : 52 ms
[2024-05-29 16:43:19] [INFO ] Time to serialize properties into /tmp/LTL1256077190489188775.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17594854499095569886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1256077190489188775.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1...177
Formula 0 simplified : XXXG!"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&...167
Detected timeout of ITS tools.
[2024-05-29 16:43:35] [INFO ] Flatten gal took : 258 ms
[2024-05-29 16:43:35] [INFO ] Applying decomposition
[2024-05-29 16:43:35] [INFO ] Flatten gal took : 260 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4428772376738200622.txt' '-o' '/tmp/graph4428772376738200622.bin' '-w' '/tmp/graph4428772376738200622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4428772376738200622.bin' '-l' '-1' '-v' '-w' '/tmp/graph4428772376738200622.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:43:36] [INFO ] Decomposing Gal with order
[2024-05-29 16:43:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:43:37] [INFO ] Removed a total of 45148 redundant transitions.
[2024-05-29 16:43:37] [INFO ] Flatten gal took : 650 ms
[2024-05-29 16:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 226 ms.
[2024-05-29 16:43:37] [INFO ] Time to serialize gal into /tmp/LTL5680108255688281239.gal : 30 ms
[2024-05-29 16:43:37] [INFO ] Time to serialize properties into /tmp/LTL14421813168743871645.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5680108255688281239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14421813168743871645.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((((i1.u5.p30==1)&&(i1.u23.p66==1))&&((i1.u14.p102==1)&&(i1.u27.p138==1)))&&(((i1.u10.p174==1)&&(i1.u16.p210==1))&&((i1.u...252
Formula 0 simplified : XXXG!"(((((i1.u5.p30==1)&&(i1.u23.p66==1))&&((i1.u14.p102==1)&&(i1.u27.p138==1)))&&(((i1.u10.p174==1)&&(i1.u16.p210==1))&&((i1.u46.p...242
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-07 finished in 454064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2345 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-05-29 16:43:54] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 16:43:54] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 16:43:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 16:43:54] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:43:54] [INFO ] Invariant cache hit.
[2024-05-29 16:43:55] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:43:55] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-29 16:43:55] [INFO ] Redundant transitions in 275 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 16:43:55] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:43:55] [INFO ] Invariant cache hit.
[2024-05-29 16:43:55] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:44:35] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:44:35] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 16:44:35] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 16:44:35] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 16:44:35] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 16:44:35] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 16:44:35] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 16:44:36] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-29 16:44:36] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 16:44:36] [INFO ] Deduced a trap composed of 4 places in 639 ms of which 1 ms to minimize.
[2024-05-29 16:44:37] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 0 ms to minimize.
[2024-05-29 16:44:38] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 0 ms to minimize.
[2024-05-29 16:44:38] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 0 ms to minimize.
[2024-05-29 16:44:39] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 0 ms to minimize.
[2024-05-29 16:44:40] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 1 ms to minimize.
[2024-05-29 16:44:40] [INFO ] Deduced a trap composed of 4 places in 530 ms of which 0 ms to minimize.
[2024-05-29 16:44:41] [INFO ] Deduced a trap composed of 4 places in 469 ms of which 1 ms to minimize.
[2024-05-29 16:44:41] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2024-05-29 16:44:41] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2024-05-29 16:44:42] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:44:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 16:44:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 16:44:42] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-29 16:44:43] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-29 16:44:44] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2024-05-29 16:44:44] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 16:44:44] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-29 16:44:44] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 16:44:44] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 16:44:45] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 16:44:45] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:44:49] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2024-05-29 16:44:49] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2024-05-29 16:44:49] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-29 16:44:49] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 16:44:50] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 16:44:50] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-29 16:44:50] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-29 16:44:50] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 16:44:50] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 16:44:51] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-29 16:44:51] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 16:44:51] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 16:44:51] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 16:44:51] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 16:44:51] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93202ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93223ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96522 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-10
Stuttering criterion allowed to conclude after 24312 steps with 2025 reset in 1192 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-10 finished in 97824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G((F(p0)&&p2))&&p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:45:30] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:45:30] [INFO ] Computed 1 invariants in 22 ms
[2024-05-29 16:45:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 16:45:30] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:45:30] [INFO ] Invariant cache hit.
[2024-05-29 16:45:31] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:45:31] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:45:31] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:45:31] [INFO ] Invariant cache hit.
[2024-05-29 16:45:32] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97940ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97984ms
Finished structural reductions in LTL mode , in 1 iterations and 99485 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 7 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-11 finished in 99747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||G((G(p1)||p2))||p0))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:47:10] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:47:10] [INFO ] Invariant cache hit.
[2024-05-29 16:47:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 16:47:10] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:47:10] [INFO ] Invariant cache hit.
[2024-05-29 16:47:11] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:47:11] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:47:11] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:47:11] [INFO ] Invariant cache hit.
[2024-05-29 16:47:11] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98029ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98073ms
Finished structural reductions in LTL mode , in 1 iterations and 99577 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-13
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-13 finished in 99880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 16 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:48:49] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:48:49] [INFO ] Invariant cache hit.
[2024-05-29 16:48:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 16:48:50] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:48:50] [INFO ] Invariant cache hit.
[2024-05-29 16:48:51] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:48:51] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:48:51] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:48:51] [INFO ] Invariant cache hit.
[2024-05-29 16:48:51] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97919ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97962ms
Finished structural reductions in LTL mode , in 1 iterations and 99430 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 1428 reset in 1963 ms.
Product exploration explored 100000 steps with 1428 reset in 1963 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 14 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 16:50:34] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:50:34] [INFO ] Invariant cache hit.
[2024-05-29 16:50:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:50:37] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2024-05-29 16:50:37] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:50:38] [INFO ] [Real]Added 4104 Read/Feed constraints in 373 ms returned sat
[2024-05-29 16:50:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:50:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:50:41] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2024-05-29 16:50:41] [INFO ] [Nat]Added 4104 Read/Feed constraints in 454 ms returned sat
[2024-05-29 16:50:42] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 595 ms.
[2024-05-29 16:50:46] [INFO ] Added : 111 causal constraints over 23 iterations in 4688 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:50:46] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:50:46] [INFO ] Invariant cache hit.
[2024-05-29 16:50:46] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 16:50:46] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:50:46] [INFO ] Invariant cache hit.
[2024-05-29 16:50:47] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:50:47] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:50:47] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:50:47] [INFO ] Invariant cache hit.
[2024-05-29 16:50:48] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98082ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98124ms
Finished structural reductions in LTL mode , in 1 iterations and 99601 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 18 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 16:52:26] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:52:26] [INFO ] Invariant cache hit.
[2024-05-29 16:52:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:52:29] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2024-05-29 16:52:30] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:52:30] [INFO ] [Real]Added 4104 Read/Feed constraints in 378 ms returned sat
[2024-05-29 16:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:52:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:52:33] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2024-05-29 16:52:34] [INFO ] [Nat]Added 4104 Read/Feed constraints in 456 ms returned sat
[2024-05-29 16:52:34] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 595 ms.
[2024-05-29 16:52:38] [INFO ] Added : 111 causal constraints over 23 iterations in 4610 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1428 reset in 1931 ms.
Product exploration explored 100000 steps with 1428 reset in 1953 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 2328 rules in 1733 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-05-29 16:52:45] [INFO ] Redundant transitions in 291 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-05-29 16:52:45] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-05-29 16:52:45] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 16:52:45] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:53:27] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-29 16:53:27] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 16:53:27] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 16:53:27] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 16:53:27] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 16:53:27] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 16:53:28] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 16:53:28] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:53:28] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 16:53:28] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 16:53:28] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 16:53:28] [INFO ] Deduced a trap composed of 5 places in 597 ms of which 1 ms to minimize.
[2024-05-29 16:53:29] [INFO ] Deduced a trap composed of 5 places in 612 ms of which 0 ms to minimize.
[2024-05-29 16:53:30] [INFO ] Deduced a trap composed of 5 places in 508 ms of which 0 ms to minimize.
[2024-05-29 16:53:30] [INFO ] Deduced a trap composed of 5 places in 670 ms of which 1 ms to minimize.
[2024-05-29 16:53:31] [INFO ] Deduced a trap composed of 5 places in 553 ms of which 1 ms to minimize.
[2024-05-29 16:53:31] [INFO ] Deduced a trap composed of 5 places in 556 ms of which 0 ms to minimize.
[2024-05-29 16:53:32] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 1 ms to minimize.
[2024-05-29 16:53:32] [INFO ] Deduced a trap composed of 5 places in 461 ms of which 1 ms to minimize.
[2024-05-29 16:53:33] [INFO ] Deduced a trap composed of 5 places in 398 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:53:34] [INFO ] Deduced a trap composed of 5 places in 358 ms of which 1 ms to minimize.
[2024-05-29 16:53:34] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 0 ms to minimize.
[2024-05-29 16:53:34] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 1 ms to minimize.
[2024-05-29 16:53:35] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2024-05-29 16:53:35] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2024-05-29 16:53:35] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2024-05-29 16:53:35] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2024-05-29 16:53:36] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
[2024-05-29 16:53:36] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2024-05-29 16:53:36] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 0 ms to minimize.
[2024-05-29 16:53:36] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2024-05-29 16:53:37] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 0 ms to minimize.
[2024-05-29 16:53:37] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2024-05-29 16:53:37] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2024-05-29 16:53:37] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-29 16:53:38] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2024-05-29 16:53:38] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 0 ms to minimize.
[2024-05-29 16:53:38] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2024-05-29 16:53:38] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2024-05-29 16:53:38] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:53:43] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 1 ms to minimize.
[2024-05-29 16:53:44] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 0 ms to minimize.
[2024-05-29 16:53:44] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2024-05-29 16:53:44] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2024-05-29 16:53:44] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2024-05-29 16:53:44] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2024-05-29 16:53:45] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-29 16:53:45] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 16:53:45] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2024-05-29 16:53:45] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2024-05-29 16:53:45] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 16:53:45] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 16:53:46] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 16:53:46] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2024-05-29 16:53:46] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2024-05-29 16:53:46] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-29 16:53:46] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2024-05-29 16:53:46] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 16:53:46] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2024-05-29 16:53:47] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:53:47] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2024-05-29 16:53:47] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 16:53:48] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2024-05-29 16:53:48] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 16:53:48] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/2205 variables, and 66 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/68 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2148/56 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:53:54] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 16:53:54] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 16:53:55] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 16:53:55] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 16:53:55] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-29 16:53:55] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 16:53:55] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2024-05-29 16:53:55] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 16:53:55] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-29 16:53:56] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 16:53:56] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-29 16:53:56] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-29 16:53:56] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 16:53:56] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2024-05-29 16:53:56] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2024-05-29 16:53:56] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 16:53:57] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 16:53:57] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2024-05-29 16:53:57] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 16:53:57] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-05-29 16:53:59] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 16:53:59] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 16:53:59] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2024-05-29 16:53:59] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 16:53:59] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 16:53:59] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-29 16:54:02] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2024-05-29 16:54:02] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 1 ms to minimize.
[2024-05-29 16:54:02] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 0 ms to minimize.
[2024-05-29 16:54:02] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2024-05-29 16:54:03] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2024-05-29 16:54:03] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2024-05-29 16:54:03] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
[2024-05-29 16:54:03] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 16:54:04] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 1 ms to minimize.
[2024-05-29 16:54:04] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 1 ms to minimize.
[2024-05-29 16:54:04] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2024-05-29 16:54:05] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2024-05-29 16:54:05] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2024-05-29 16:54:05] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/106 constraints. Problems are: Problem set: 44 solved, 2104 unsolved
[2024-05-29 16:54:07] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 16:54:07] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-05-29 16:54:08] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 16:54:08] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2024-05-29 16:54:08] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 16:54:08] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2024-05-29 16:54:08] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-29 16:54:08] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 16:54:09] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2024-05-29 16:54:09] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2024-05-29 16:54:09] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2024-05-29 16:54:09] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 16:54:09] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2024-05-29 16:54:09] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2024-05-29 16:54:10] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-29 16:54:10] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2024-05-29 16:54:10] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 16:54:10] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2024-05-29 16:54:10] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2024-05-29 16:54:10] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 20/126 constraints. Problems are: Problem set: 44 solved, 2104 unsolved
[2024-05-29 16:54:13] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 16:54:13] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-29 16:54:13] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2024-05-29 16:54:13] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 16:54:13] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 68/2205 variables, and 131 constraints, problems are : Problem set: 44 solved, 2104 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/68 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/56 constraints, Known Traps: 130/130 constraints]
After SMT, in 93223ms problems are : Problem set: 44 solved, 2104 unsolved
Search for dead transitions found 44 dead transitions in 93244ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2105/4286 transitions.
Graph (complete) has 419 edges and 68 vertex of which 35 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.5 ms
Discarding 33 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 670 ms. Remains 35 /68 variables (removed 33) and now considering 2105/2105 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/136 places, 2105/4286 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95951 ms. Remains : 35/136 places, 2105/4286 transitions.
Built C files in :
/tmp/ltsmin4781066615882123408
[2024-05-29 16:54:19] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4781066615882123408
Running compilation step : cd /tmp/ltsmin4781066615882123408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4781066615882123408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4781066615882123408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 17 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-05-29 16:54:22] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-05-29 16:54:22] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 16:54:22] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 16:54:22] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:54:22] [INFO ] Invariant cache hit.
[2024-05-29 16:54:23] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:54:23] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-05-29 16:54:23] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-05-29 16:54:23] [INFO ] Invariant cache hit.
[2024-05-29 16:54:23] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98143ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98184ms
Finished structural reductions in LTL mode , in 1 iterations and 99673 ms. Remains : 136/136 places, 4286/4286 transitions.
Built C files in :
/tmp/ltsmin11599462801328761884
[2024-05-29 16:56:01] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11599462801328761884
Running compilation step : cd /tmp/ltsmin11599462801328761884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin11599462801328761884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin11599462801328761884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 16:56:05] [INFO ] Flatten gal took : 258 ms
[2024-05-29 16:56:05] [INFO ] Flatten gal took : 259 ms
[2024-05-29 16:56:05] [INFO ] Time to serialize gal into /tmp/LTL11654499194668461580.gal : 51 ms
[2024-05-29 16:56:05] [INFO ] Time to serialize properties into /tmp/LTL17185469286418063417.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11654499194668461580.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5576574708927237596.hoa' '-atoms' '/tmp/LTL17185469286418063417.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17185469286418063417.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5576574708927237596.hoa
Detected timeout of ITS tools.
[2024-05-29 16:56:21] [INFO ] Flatten gal took : 256 ms
[2024-05-29 16:56:21] [INFO ] Flatten gal took : 260 ms
[2024-05-29 16:56:21] [INFO ] Time to serialize gal into /tmp/LTL14421038770895134077.gal : 50 ms
[2024-05-29 16:56:21] [INFO ] Time to serialize properties into /tmp/LTL16702188892719371571.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14421038770895134077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16702188892719371571.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))...174
Formula 0 simplified : XXG!"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&(...166
Detected timeout of ITS tools.
[2024-05-29 16:56:36] [INFO ] Flatten gal took : 259 ms
[2024-05-29 16:56:36] [INFO ] Applying decomposition
[2024-05-29 16:56:37] [INFO ] Flatten gal took : 260 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12119020840490365850.txt' '-o' '/tmp/graph12119020840490365850.bin' '-w' '/tmp/graph12119020840490365850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12119020840490365850.bin' '-l' '-1' '-v' '-w' '/tmp/graph12119020840490365850.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:56:37] [INFO ] Decomposing Gal with order
[2024-05-29 16:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:56:38] [INFO ] Removed a total of 45144 redundant transitions.
[2024-05-29 16:56:38] [INFO ] Flatten gal took : 647 ms
[2024-05-29 16:56:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 215 ms.
[2024-05-29 16:56:39] [INFO ] Time to serialize gal into /tmp/LTL8563506825259825366.gal : 30 ms
[2024-05-29 16:56:39] [INFO ] Time to serialize properties into /tmp/LTL15084767160085137135.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8563506825259825366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15084767160085137135.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((i2.u51.p30==1)&&(i2.u11.p66==1))&&((i2.u32.p102==1)&&(i2.u45.p138==1)))&&(((i2.u26.p174==1)&&(i2.u7.p210==1))&&((i2.u1....248
Formula 0 simplified : XXG!"(((((i2.u51.p30==1)&&(i2.u11.p66==1))&&((i2.u32.p102==1)&&(i2.u45.p138==1)))&&(((i2.u26.p174==1)&&(i2.u7.p210==1))&&((i2.u1.p24...240
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-14 finished in 484215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2388 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-05-29 16:56:56] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 16:56:56] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 16:56:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 16:56:56] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:56:56] [INFO ] Invariant cache hit.
[2024-05-29 16:56:57] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:56:57] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-05-29 16:56:57] [INFO ] Redundant transitions in 290 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 16:56:57] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 16:56:57] [INFO ] Invariant cache hit.
[2024-05-29 16:56:57] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:57:37] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 16:57:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 16:57:37] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 16:57:37] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 16:57:37] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 16:57:37] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 16:57:37] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 16:57:38] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 16:57:38] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 16:57:38] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2024-05-29 16:57:39] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 1 ms to minimize.
[2024-05-29 16:57:40] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2024-05-29 16:57:40] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 0 ms to minimize.
[2024-05-29 16:57:41] [INFO ] Deduced a trap composed of 4 places in 612 ms of which 1 ms to minimize.
[2024-05-29 16:57:41] [INFO ] Deduced a trap composed of 4 places in 607 ms of which 1 ms to minimize.
[2024-05-29 16:57:42] [INFO ] Deduced a trap composed of 4 places in 519 ms of which 0 ms to minimize.
[2024-05-29 16:57:42] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 0 ms to minimize.
[2024-05-29 16:57:43] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 1 ms to minimize.
[2024-05-29 16:57:43] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2024-05-29 16:57:44] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:57:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-05-29 16:57:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 16:57:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 16:57:44] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-29 16:57:44] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 16:57:45] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 16:57:45] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 16:57:45] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 16:57:45] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 16:57:45] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 16:57:45] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 16:57:45] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 16:57:45] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 16:57:46] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-29 16:57:46] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-05-29 16:57:46] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 16:57:46] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 16:57:46] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 16:57:46] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 16:57:47] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 16:57:51] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2024-05-29 16:57:51] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2024-05-29 16:57:51] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2024-05-29 16:57:51] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 16:57:52] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 16:57:52] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 16:57:52] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-29 16:57:52] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 16:57:52] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 16:57:53] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 16:57:53] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 16:57:53] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 16:57:53] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 16:57:53] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 16:57:53] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93403ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96784 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-15
Stuttering criterion allowed to conclude after 1991 steps with 165 reset in 101 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-15 finished in 97025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((F(p0)&&p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : StigmergyCommit-PT-10a-LTLFireability-07
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2236 place count 45 transition count 2126
Applied a total of 2236 rules in 308 ms. Remains 45 /136 variables (removed 91) and now considering 2126/4286 (removed 2160) transitions.
[2024-05-29 16:58:31] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-05-29 16:58:31] [INFO ] Computed 1 invariants in 12 ms
[2024-05-29 16:58:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 16:58:31] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 16:58:31] [INFO ] Invariant cache hit.
[2024-05-29 16:58:32] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:58:32] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 16:58:32] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 16:58:32] [INFO ] Invariant cache hit.
[2024-05-29 16:58:32] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 16:59:12] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 16:59:12] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:59:12] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:59:13] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 16:59:13] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 16:59:13] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:59:13] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 16:59:13] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-29 16:59:13] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 16:59:13] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 16:59:14] [INFO ] Deduced a trap composed of 5 places in 522 ms of which 1 ms to minimize.
[2024-05-29 16:59:14] [INFO ] Deduced a trap composed of 5 places in 454 ms of which 1 ms to minimize.
[2024-05-29 16:59:15] [INFO ] Deduced a trap composed of 6 places in 388 ms of which 0 ms to minimize.
[2024-05-29 16:59:15] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 1 ms to minimize.
[2024-05-29 16:59:15] [INFO ] Deduced a trap composed of 5 places in 379 ms of which 0 ms to minimize.
[2024-05-29 16:59:16] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 0 ms to minimize.
[2024-05-29 16:59:16] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 0 ms to minimize.
[2024-05-29 16:59:16] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 0 ms to minimize.
[2024-05-29 16:59:17] [INFO ] Deduced a trap composed of 5 places in 448 ms of which 0 ms to minimize.
[2024-05-29 16:59:17] [INFO ] Deduced a trap composed of 5 places in 444 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 16:59:18] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 1 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
[2024-05-29 16:59:19] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2024-05-29 16:59:20] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 0 ms to minimize.
[2024-05-29 16:59:20] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2024-05-29 16:59:20] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
[2024-05-29 16:59:20] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2024-05-29 16:59:20] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 16:59:33] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 1 ms to minimize.
[2024-05-29 16:59:33] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 0 ms to minimize.
[2024-05-29 16:59:33] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 0 ms to minimize.
[2024-05-29 16:59:34] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
[2024-05-29 16:59:34] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 0 ms to minimize.
[2024-05-29 16:59:34] [INFO ] Deduced a trap composed of 5 places in 349 ms of which 0 ms to minimize.
[2024-05-29 16:59:35] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2024-05-29 16:59:35] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2024-05-29 16:59:35] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 0 ms to minimize.
[2024-05-29 16:59:35] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2024-05-29 16:59:36] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
SMT process timed out in 63637ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63660ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/136 places, 2126/4286 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64630 ms. Remains : 45/136 places, 2126/4286 transitions.
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 8333 reset in 4920 ms.
Product exploration explored 100000 steps with 8333 reset in 4939 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 16:59:46] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 16:59:46] [INFO ] Invariant cache hit.
[2024-05-29 16:59:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 16:59:48] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2024-05-29 16:59:48] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:59:48] [INFO ] [Real]Added 2069 Read/Feed constraints in 181 ms returned sat
[2024-05-29 16:59:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 16:59:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 16:59:50] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2024-05-29 16:59:50] [INFO ] [Nat]Added 2069 Read/Feed constraints in 218 ms returned sat
[2024-05-29 16:59:50] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 236 ms.
[2024-05-29 16:59:50] [INFO ] Added : 0 causal constraints over 0 iterations in 412 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-05-29 16:59:50] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 16:59:50] [INFO ] Invariant cache hit.
[2024-05-29 16:59:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 16:59:50] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 16:59:50] [INFO ] Invariant cache hit.
[2024-05-29 16:59:51] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 16:59:51] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 16:59:51] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 16:59:51] [INFO ] Invariant cache hit.
[2024-05-29 16:59:51] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:00:31] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:00:31] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:00:32] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 17:00:32] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 17:00:32] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-29 17:00:32] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:00:32] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-29 17:00:32] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2024-05-29 17:00:32] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-29 17:00:32] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2024-05-29 17:00:33] [INFO ] Deduced a trap composed of 5 places in 527 ms of which 1 ms to minimize.
[2024-05-29 17:00:33] [INFO ] Deduced a trap composed of 5 places in 456 ms of which 0 ms to minimize.
[2024-05-29 17:00:34] [INFO ] Deduced a trap composed of 6 places in 391 ms of which 1 ms to minimize.
[2024-05-29 17:00:34] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 1 ms to minimize.
[2024-05-29 17:00:34] [INFO ] Deduced a trap composed of 5 places in 391 ms of which 1 ms to minimize.
[2024-05-29 17:00:35] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2024-05-29 17:00:35] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 0 ms to minimize.
[2024-05-29 17:00:36] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 0 ms to minimize.
[2024-05-29 17:00:36] [INFO ] Deduced a trap composed of 5 places in 439 ms of which 0 ms to minimize.
[2024-05-29 17:00:36] [INFO ] Deduced a trap composed of 5 places in 442 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:00:37] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2024-05-29 17:00:37] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:00:37] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:00:37] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:00:37] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:00:37] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:00:38] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 0 ms to minimize.
[2024-05-29 17:00:38] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2024-05-29 17:00:38] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2024-05-29 17:00:38] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2024-05-29 17:00:39] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2024-05-29 17:00:39] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2024-05-29 17:00:39] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 0 ms to minimize.
[2024-05-29 17:00:39] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2024-05-29 17:00:40] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:00:52] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 0 ms to minimize.
[2024-05-29 17:00:52] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 0 ms to minimize.
[2024-05-29 17:00:52] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2024-05-29 17:00:53] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 0 ms to minimize.
[2024-05-29 17:00:53] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2024-05-29 17:00:53] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 1 ms to minimize.
[2024-05-29 17:00:54] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2024-05-29 17:00:54] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 0 ms to minimize.
[2024-05-29 17:00:54] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2024-05-29 17:00:55] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
SMT process timed out in 63562ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63585ms
Finished structural reductions in LTL mode , in 1 iterations and 64258 ms. Remains : 45/45 places, 2126/2126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:00:55] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:00:55] [INFO ] Invariant cache hit.
[2024-05-29 17:00:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:00:57] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2024-05-29 17:00:57] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:00:57] [INFO ] [Real]Added 2069 Read/Feed constraints in 177 ms returned sat
[2024-05-29 17:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:00:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:00:59] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2024-05-29 17:00:59] [INFO ] [Nat]Added 2069 Read/Feed constraints in 217 ms returned sat
[2024-05-29 17:00:59] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 232 ms.
[2024-05-29 17:00:59] [INFO ] Added : 0 causal constraints over 0 iterations in 408 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4924 ms.
Product exploration explored 100000 steps with 8333 reset in 4906 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 45 transition count 2115
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 22 rules in 1458 ms. Remains 45 /45 variables (removed 0) and now considering 2115/2126 (removed 11) transitions.
[2024-05-29 17:01:11] [INFO ] Redundant transitions in 286 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-29 17:01:11] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-05-29 17:01:11] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 17:01:12] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:01:52] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 17:01:52] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:01:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:01:52] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:01:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:01:52] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:01:52] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:01:52] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:01:53] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:01:53] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:01:53] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 1 ms to minimize.
[2024-05-29 17:01:54] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 1 ms to minimize.
[2024-05-29 17:01:54] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 1 ms to minimize.
[2024-05-29 17:01:55] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2024-05-29 17:01:55] [INFO ] Deduced a trap composed of 4 places in 470 ms of which 0 ms to minimize.
[2024-05-29 17:01:56] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 1 ms to minimize.
[2024-05-29 17:01:56] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2024-05-29 17:01:56] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2024-05-29 17:01:57] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2024-05-29 17:01:57] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:01:57] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 17:01:58] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-29 17:01:58] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 17:01:58] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-29 17:01:58] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 17:01:58] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 17:01:59] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 17:01:59] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 17:01:59] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
[2024-05-29 17:02:00] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-29 17:02:00] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 17:02:00] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 17:02:00] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:02:12] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-29 17:02:12] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 45/2148 variables, and 36 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2104/12 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 4 places in 477 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 0 ms to minimize.
[2024-05-29 17:02:21] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2024-05-29 17:02:21] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 0 ms to minimize.
[2024-05-29 17:02:21] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
[2024-05-29 17:02:22] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2024-05-29 17:02:22] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 17:02:22] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-29 17:02:22] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 17:02:23] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 17:02:23] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-29 17:02:23] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 17:02:24] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2024-05-29 17:02:24] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 17:02:24] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-29 17:02:24] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 17:02:24] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 17:02:25] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-05-29 17:02:25] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-29 17:02:25] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:02:26] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2024-05-29 17:02:27] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 0 ms to minimize.
[2024-05-29 17:02:27] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-05-29 17:02:27] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 0 ms to minimize.
[2024-05-29 17:02:28] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 0 ms to minimize.
[2024-05-29 17:02:28] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 17:02:28] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 17:02:28] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 17:02:28] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 17:02:29] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 17:02:29] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 17:02:29] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 17:02:29] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2024-05-29 17:02:29] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 17:02:29] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 17:02:30] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
[2024-05-29 17:02:30] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 17:02:30] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-29 17:02:31] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-29 17:02:31] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:02:32] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 1 ms to minimize.
[2024-05-29 17:02:32] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2024-05-29 17:02:33] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
[2024-05-29 17:02:33] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-29 17:02:33] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-29 17:02:33] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2024-05-29 17:02:34] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 17:02:34] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-29 17:02:34] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 17:02:34] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 17:02:35] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 17:02:35] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 17:02:35] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 17:02:35] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 17:02:35] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 17:02:36] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 17:02:36] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 17:02:36] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 17:02:36] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 17:02:36] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:02:37] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-29 17:02:38] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 17:02:38] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 17:02:38] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2024-05-29 17:02:38] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-29 17:02:39] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 17:02:39] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 17:02:39] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 17:02:39] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-29 17:02:39] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 45/2148 variables, and 106 constraints, problems are : Problem set: 11 solved, 2093 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/12 constraints, Known Traps: 105/105 constraints]
After SMT, in 93678ms problems are : Problem set: 11 solved, 2093 unsolved
Search for dead transitions found 11 dead transitions in 93698ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 2104/2126 transitions.
Graph (complete) has 408 edges and 45 vertex of which 34 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 660 ms. Remains 34 /45 variables (removed 11) and now considering 2104/2104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/45 places, 2104/2126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96117 ms. Remains : 34/45 places, 2104/2126 transitions.
Built C files in :
/tmp/ltsmin15536375224571579269
[2024-05-29 17:02:46] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15536375224571579269
Running compilation step : cd /tmp/ltsmin15536375224571579269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15536375224571579269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15536375224571579269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 12 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-05-29 17:02:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-05-29 17:02:49] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 17:02:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 17:02:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:02:49] [INFO ] Invariant cache hit.
[2024-05-29 17:02:49] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:02:50] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:02:50] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:02:50] [INFO ] Invariant cache hit.
[2024-05-29 17:02:50] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:03:30] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:03:30] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:03:30] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 17:03:30] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:03:30] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-05-29 17:03:30] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:03:31] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 17:03:31] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-29 17:03:31] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 17:03:31] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 17:03:31] [INFO ] Deduced a trap composed of 5 places in 535 ms of which 1 ms to minimize.
[2024-05-29 17:03:32] [INFO ] Deduced a trap composed of 5 places in 448 ms of which 1 ms to minimize.
[2024-05-29 17:03:32] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 0 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 1 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 0 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 0 ms to minimize.
[2024-05-29 17:03:34] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 1 ms to minimize.
[2024-05-29 17:03:34] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 1 ms to minimize.
[2024-05-29 17:03:35] [INFO ] Deduced a trap composed of 5 places in 447 ms of which 1 ms to minimize.
[2024-05-29 17:03:35] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:03:36] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:03:36] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 17:03:36] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:03:36] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-05-29 17:03:36] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-29 17:03:36] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 17:03:36] [INFO ] Deduced a trap composed of 5 places in 349 ms of which 1 ms to minimize.
[2024-05-29 17:03:37] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2024-05-29 17:03:37] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 0 ms to minimize.
[2024-05-29 17:03:37] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2024-05-29 17:03:37] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 0 ms to minimize.
[2024-05-29 17:03:38] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2024-05-29 17:03:38] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2024-05-29 17:03:38] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2024-05-29 17:03:38] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:03:51] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 1 ms to minimize.
[2024-05-29 17:03:51] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 1 ms to minimize.
[2024-05-29 17:03:51] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 1 ms to minimize.
[2024-05-29 17:03:52] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 0 ms to minimize.
[2024-05-29 17:03:52] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2024-05-29 17:03:52] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 1 ms to minimize.
[2024-05-29 17:03:53] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 1 ms to minimize.
[2024-05-29 17:03:53] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 1 ms to minimize.
[2024-05-29 17:03:53] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 0 ms to minimize.
SMT process timed out in 63698ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63721ms
Finished structural reductions in LTL mode , in 1 iterations and 64393 ms. Remains : 45/45 places, 2126/2126 transitions.
Built C files in :
/tmp/ltsmin8682575865164068661
[2024-05-29 17:03:53] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8682575865164068661
Running compilation step : cd /tmp/ltsmin8682575865164068661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8682575865164068661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8682575865164068661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 17:03:57] [INFO ] Flatten gal took : 129 ms
[2024-05-29 17:03:57] [INFO ] Flatten gal took : 130 ms
[2024-05-29 17:03:57] [INFO ] Time to serialize gal into /tmp/LTL12622870199020408613.gal : 26 ms
[2024-05-29 17:03:57] [INFO ] Time to serialize properties into /tmp/LTL16305591145336686098.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12622870199020408613.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3334588182729039567.hoa' '-atoms' '/tmp/LTL16305591145336686098.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16305591145336686098.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3334588182729039567.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t53, t4264, t4266, t4268, t4270, t4272, t4274...390
Detected timeout of ITS tools.
[2024-05-29 17:04:12] [INFO ] Flatten gal took : 129 ms
[2024-05-29 17:04:12] [INFO ] Flatten gal took : 129 ms
[2024-05-29 17:04:12] [INFO ] Time to serialize gal into /tmp/LTL2834896474683687667.gal : 25 ms
[2024-05-29 17:04:12] [INFO ] Time to serialize properties into /tmp/LTL10977566875309030249.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2834896474683687667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10977566875309030249.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1...177
Formula 0 simplified : XXXG!"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&...167
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t53, t4264, t4266, t4268, t4270, t4272, t4274...390
Detected timeout of ITS tools.
[2024-05-29 17:04:27] [INFO ] Flatten gal took : 129 ms
[2024-05-29 17:04:27] [INFO ] Applying decomposition
[2024-05-29 17:04:28] [INFO ] Flatten gal took : 130 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17492822895540085212.txt' '-o' '/tmp/graph17492822895540085212.bin' '-w' '/tmp/graph17492822895540085212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17492822895540085212.bin' '-l' '-1' '-v' '-w' '/tmp/graph17492822895540085212.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:04:28] [INFO ] Decomposing Gal with order
[2024-05-29 17:04:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:04:28] [INFO ] Removed a total of 22725 redundant transitions.
[2024-05-29 17:04:28] [INFO ] Flatten gal took : 251 ms
[2024-05-29 17:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 81 ms.
[2024-05-29 17:04:28] [INFO ] Time to serialize gal into /tmp/LTL10029050303554801508.gal : 15 ms
[2024-05-29 17:04:28] [INFO ] Time to serialize properties into /tmp/LTL12779792572874508718.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10029050303554801508.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12779792572874508718.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1)))...211
Formula 0 simplified : XXXG!"(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1))))&&(...201
Reverse transition relation is NOT exact ! Due to transitions u0.t53, u0.t4284, u0.t55.t54, u1.t48, u1.t4282, u1.t50.t49, u2.t43, u2.t4280, u2.t45.t44, u3....492
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
67 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.830408,29740,1,0,6654,206,19677,2001,188,431,27872
no accepting run found
Formula 0 is TRUE no accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-07 finished in 358515 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-07 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : StigmergyCommit-PT-10a-LTLFireability-14
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2236 place count 45 transition count 2126
Applied a total of 2236 rules in 281 ms. Remains 45 /136 variables (removed 91) and now considering 2126/4286 (removed 2160) transitions.
[2024-05-29 17:04:30] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:04:30] [INFO ] Invariant cache hit.
[2024-05-29 17:04:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 17:04:30] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:04:30] [INFO ] Invariant cache hit.
[2024-05-29 17:04:30] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:04:31] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:04:31] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:04:31] [INFO ] Invariant cache hit.
[2024-05-29 17:04:31] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:05:11] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:05:11] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 17:05:11] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:05:11] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 17:05:11] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 17:05:11] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:05:11] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2024-05-29 17:05:11] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 17:05:12] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 17:05:12] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 17:05:12] [INFO ] Deduced a trap composed of 5 places in 531 ms of which 0 ms to minimize.
[2024-05-29 17:05:13] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 1 ms to minimize.
[2024-05-29 17:05:13] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 0 ms to minimize.
[2024-05-29 17:05:14] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 0 ms to minimize.
[2024-05-29 17:05:14] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 0 ms to minimize.
[2024-05-29 17:05:14] [INFO ] Deduced a trap composed of 5 places in 406 ms of which 0 ms to minimize.
[2024-05-29 17:05:15] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 0 ms to minimize.
[2024-05-29 17:05:15] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 0 ms to minimize.
[2024-05-29 17:05:16] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 1 ms to minimize.
[2024-05-29 17:05:16] [INFO ] Deduced a trap composed of 5 places in 454 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:05:16] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:05:16] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:05:17] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:05:17] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 17:05:17] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 17:05:17] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 17:05:17] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2024-05-29 17:05:17] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2024-05-29 17:05:18] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2024-05-29 17:05:18] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 0 ms to minimize.
[2024-05-29 17:05:18] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 0 ms to minimize.
[2024-05-29 17:05:19] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2024-05-29 17:05:19] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2024-05-29 17:05:19] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2024-05-29 17:05:19] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:05:31] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 1 ms to minimize.
[2024-05-29 17:05:32] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 1 ms to minimize.
[2024-05-29 17:05:32] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2024-05-29 17:05:32] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2024-05-29 17:05:33] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2024-05-29 17:05:33] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 0 ms to minimize.
[2024-05-29 17:05:33] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2024-05-29 17:05:34] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2024-05-29 17:05:34] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 0 ms to minimize.
[2024-05-29 17:05:34] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
SMT process timed out in 63524ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63549ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/136 places, 2126/4286 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64482 ms. Remains : 45/136 places, 2126/4286 transitions.
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 8333 reset in 4971 ms.
Product exploration explored 100000 steps with 8333 reset in 4966 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:05:45] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:05:45] [INFO ] Invariant cache hit.
[2024-05-29 17:05:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:05:46] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2024-05-29 17:05:46] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:05:47] [INFO ] [Real]Added 2069 Read/Feed constraints in 181 ms returned sat
[2024-05-29 17:05:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:05:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:05:48] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-05-29 17:05:48] [INFO ] [Nat]Added 2069 Read/Feed constraints in 224 ms returned sat
[2024-05-29 17:05:49] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 235 ms.
[2024-05-29 17:05:49] [INFO ] Added : 0 causal constraints over 0 iterations in 416 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 8 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-05-29 17:05:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:05:49] [INFO ] Invariant cache hit.
[2024-05-29 17:05:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 17:05:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:05:49] [INFO ] Invariant cache hit.
[2024-05-29 17:05:49] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:05:49] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:05:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:05:49] [INFO ] Invariant cache hit.
[2024-05-29 17:05:50] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:06:30] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:06:30] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:06:30] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 17:06:30] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 17:06:31] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2024-05-29 17:06:31] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:06:31] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 17:06:31] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2024-05-29 17:06:31] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 17:06:31] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 1 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 5 places in 447 ms of which 0 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 6 places in 401 ms of which 0 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 0 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 5 places in 395 ms of which 0 ms to minimize.
[2024-05-29 17:06:34] [INFO ] Deduced a trap composed of 5 places in 412 ms of which 1 ms to minimize.
[2024-05-29 17:06:34] [INFO ] Deduced a trap composed of 5 places in 396 ms of which 0 ms to minimize.
[2024-05-29 17:06:35] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 0 ms to minimize.
[2024-05-29 17:06:35] [INFO ] Deduced a trap composed of 5 places in 460 ms of which 0 ms to minimize.
[2024-05-29 17:06:35] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:06:36] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:06:36] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 17:06:36] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:06:36] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:06:36] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:06:36] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 17:06:37] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 1 ms to minimize.
[2024-05-29 17:06:37] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 0 ms to minimize.
[2024-05-29 17:06:37] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 0 ms to minimize.
[2024-05-29 17:06:37] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 0 ms to minimize.
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2024-05-29 17:06:39] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:06:51] [INFO ] Deduced a trap composed of 5 places in 358 ms of which 1 ms to minimize.
[2024-05-29 17:06:52] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 1 ms to minimize.
[2024-05-29 17:06:52] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 0 ms to minimize.
[2024-05-29 17:06:52] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2024-05-29 17:06:53] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 0 ms to minimize.
[2024-05-29 17:06:53] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 0 ms to minimize.
[2024-05-29 17:06:53] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
SMT process timed out in 63793ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63817ms
Finished structural reductions in LTL mode , in 1 iterations and 64490 ms. Remains : 45/45 places, 2126/2126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 17:06:54] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:06:54] [INFO ] Invariant cache hit.
[2024-05-29 17:06:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:06:55] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-29 17:06:56] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:06:56] [INFO ] [Real]Added 2069 Read/Feed constraints in 180 ms returned sat
[2024-05-29 17:06:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:06:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 17:06:57] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-05-29 17:06:58] [INFO ] [Nat]Added 2069 Read/Feed constraints in 220 ms returned sat
[2024-05-29 17:06:58] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 251 ms.
[2024-05-29 17:06:58] [INFO ] Added : 0 causal constraints over 0 iterations in 425 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4923 ms.
Product exploration explored 100000 steps with 8333 reset in 4914 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 45 transition count 2115
Deduced a syphon composed of 11 places in 1 ms
Applied a total of 22 rules in 1422 ms. Remains 45 /45 variables (removed 0) and now considering 2115/2126 (removed 11) transitions.
[2024-05-29 17:07:10] [INFO ] Redundant transitions in 274 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-29 17:07:10] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-05-29 17:07:10] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 17:07:10] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 17:07:52] [INFO ] Deduced a trap composed of 4 places in 566 ms of which 0 ms to minimize.
[2024-05-29 17:07:52] [INFO ] Deduced a trap composed of 4 places in 477 ms of which 1 ms to minimize.
[2024-05-29 17:07:53] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2024-05-29 17:07:53] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 3 ms to minimize.
[2024-05-29 17:07:54] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 0 ms to minimize.
[2024-05-29 17:07:54] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 0 ms to minimize.
[2024-05-29 17:07:54] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 0 ms to minimize.
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 0 ms to minimize.
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:07:56] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 17:07:56] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-29 17:07:57] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 17:07:58] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2024-05-29 17:07:58] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2024-05-29 17:07:58] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 17:07:58] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 17:07:58] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:08:10] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 17:08:10] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 45/2148 variables, and 36 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2104/12 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:08:18] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 1 ms to minimize.
[2024-05-29 17:08:19] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 0 ms to minimize.
[2024-05-29 17:08:19] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 0 ms to minimize.
[2024-05-29 17:08:20] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 0 ms to minimize.
[2024-05-29 17:08:20] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2024-05-29 17:08:20] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2024-05-29 17:08:20] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 17:08:21] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 17:08:21] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 17:08:21] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 17:08:21] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-29 17:08:22] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 17:08:22] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2024-05-29 17:08:22] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2024-05-29 17:08:23] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-29 17:08:23] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 17:08:23] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 17:08:23] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-05-29 17:08:24] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 0 ms to minimize.
[2024-05-29 17:08:24] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:08:25] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 0 ms to minimize.
[2024-05-29 17:08:25] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 0 ms to minimize.
[2024-05-29 17:08:25] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-29 17:08:26] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2024-05-29 17:08:26] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-29 17:08:26] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-29 17:08:26] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 17:08:27] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-29 17:08:27] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 17:08:27] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 17:08:27] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 17:08:27] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 17:08:28] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 17:08:28] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 17:08:28] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 17:08:28] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 0 ms to minimize.
[2024-05-29 17:08:29] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-29 17:08:29] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 17:08:29] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 17:08:29] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:08:30] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2024-05-29 17:08:31] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2024-05-29 17:08:31] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
[2024-05-29 17:08:31] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2024-05-29 17:08:32] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-29 17:08:32] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 1 ms to minimize.
[2024-05-29 17:08:32] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-29 17:08:32] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2024-05-29 17:08:33] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 17:08:33] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 17:08:33] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 17:08:33] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 17:08:34] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 17:08:34] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 17:08:34] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 17:08:34] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 17:08:34] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 17:08:34] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 17:08:35] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-29 17:08:35] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 17:08:36] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 17:08:36] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 17:08:36] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 17:08:37] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
[2024-05-29 17:08:37] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 17:08:37] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 17:08:37] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 17:08:37] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 17:08:38] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 17:08:38] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 45/2148 variables, and 106 constraints, problems are : Problem set: 11 solved, 2093 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/12 constraints, Known Traps: 105/105 constraints]
After SMT, in 93539ms problems are : Problem set: 11 solved, 2093 unsolved
Search for dead transitions found 11 dead transitions in 93560ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 2104/2126 transitions.
Graph (complete) has 408 edges and 45 vertex of which 34 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 663 ms. Remains 34 /45 variables (removed 11) and now considering 2104/2104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/45 places, 2104/2126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95932 ms. Remains : 34/45 places, 2104/2126 transitions.
Built C files in :
/tmp/ltsmin10024103124555489840
[2024-05-29 17:08:44] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10024103124555489840
Running compilation step : cd /tmp/ltsmin10024103124555489840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10024103124555489840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10024103124555489840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 9 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-05-29 17:08:47] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-05-29 17:08:47] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 17:08:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 17:08:47] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:08:47] [INFO ] Invariant cache hit.
[2024-05-29 17:08:48] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 17:08:48] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-05-29 17:08:48] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-05-29 17:08:48] [INFO ] Invariant cache hit.
[2024-05-29 17:08:48] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 17:09:29] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-29 17:09:30] [INFO ] Deduced a trap composed of 5 places in 540 ms of which 0 ms to minimize.
[2024-05-29 17:09:31] [INFO ] Deduced a trap composed of 5 places in 456 ms of which 1 ms to minimize.
[2024-05-29 17:09:31] [INFO ] Deduced a trap composed of 6 places in 400 ms of which 1 ms to minimize.
[2024-05-29 17:09:31] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 0 ms to minimize.
[2024-05-29 17:09:32] [INFO ] Deduced a trap composed of 5 places in 395 ms of which 0 ms to minimize.
[2024-05-29 17:09:32] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 0 ms to minimize.
[2024-05-29 17:09:33] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 0 ms to minimize.
[2024-05-29 17:09:33] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 0 ms to minimize.
[2024-05-29 17:09:33] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 0 ms to minimize.
[2024-05-29 17:09:34] [INFO ] Deduced a trap composed of 5 places in 446 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:09:34] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 17:09:34] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:09:34] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 17:09:34] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:09:34] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 17:09:35] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:09:35] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 0 ms to minimize.
[2024-05-29 17:09:35] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2024-05-29 17:09:36] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 0 ms to minimize.
[2024-05-29 17:09:36] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2024-05-29 17:09:36] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 0 ms to minimize.
[2024-05-29 17:09:36] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2024-05-29 17:09:37] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2024-05-29 17:09:37] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2024-05-29 17:09:37] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-05-29 17:09:50] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2024-05-29 17:09:50] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 1 ms to minimize.
[2024-05-29 17:09:50] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 1 ms to minimize.
[2024-05-29 17:09:51] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 0 ms to minimize.
[2024-05-29 17:09:51] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 0 ms to minimize.
[2024-05-29 17:09:51] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 0 ms to minimize.
[2024-05-29 17:09:51] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 0 ms to minimize.
SMT process timed out in 63612ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63634ms
Finished structural reductions in LTL mode , in 1 iterations and 64307 ms. Remains : 45/45 places, 2126/2126 transitions.
Built C files in :
/tmp/ltsmin17362036250361214547
[2024-05-29 17:09:52] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17362036250361214547
Running compilation step : cd /tmp/ltsmin17362036250361214547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17362036250361214547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin17362036250361214547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 17:09:55] [INFO ] Flatten gal took : 138 ms
[2024-05-29 17:09:55] [INFO ] Flatten gal took : 131 ms
[2024-05-29 17:09:55] [INFO ] Time to serialize gal into /tmp/LTL9882913007663162084.gal : 26 ms
[2024-05-29 17:09:55] [INFO ] Time to serialize properties into /tmp/LTL2362261314664743702.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9882913007663162084.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13992672015400325443.hoa' '-atoms' '/tmp/LTL2362261314664743702.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2362261314664743702.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13992672015400325443.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t53, t4264, t4266, t4268, t4270, t4272, t4274...390
Detected timeout of ITS tools.
[2024-05-29 17:10:10] [INFO ] Flatten gal took : 130 ms
[2024-05-29 17:10:11] [INFO ] Flatten gal took : 130 ms
[2024-05-29 17:10:11] [INFO ] Time to serialize gal into /tmp/LTL11073014087952633002.gal : 124 ms
[2024-05-29 17:10:11] [INFO ] Time to serialize properties into /tmp/LTL4834901565955814872.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11073014087952633002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4834901565955814872.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))...174
Formula 0 simplified : XXG!"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&(((p318==1)&&(p354==1))&&(...166
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t53, t4264, t4266, t4268, t4270, t4272, t4274...390
Detected timeout of ITS tools.
[2024-05-29 17:10:26] [INFO ] Flatten gal took : 130 ms
[2024-05-29 17:10:26] [INFO ] Applying decomposition
[2024-05-29 17:10:26] [INFO ] Flatten gal took : 132 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10210070072197910577.txt' '-o' '/tmp/graph10210070072197910577.bin' '-w' '/tmp/graph10210070072197910577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10210070072197910577.bin' '-l' '-1' '-v' '-w' '/tmp/graph10210070072197910577.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:10:26] [INFO ] Decomposing Gal with order
[2024-05-29 17:10:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:10:27] [INFO ] Removed a total of 22725 redundant transitions.
[2024-05-29 17:10:27] [INFO ] Flatten gal took : 256 ms
[2024-05-29 17:10:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 81 ms.
[2024-05-29 17:10:27] [INFO ] Time to serialize gal into /tmp/LTL1646293736013095384.gal : 15 ms
[2024-05-29 17:10:27] [INFO ] Time to serialize properties into /tmp/LTL16760287897805634656.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1646293736013095384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16760287897805634656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1))))&...208
Formula 0 simplified : XXG!"(((((u0.p30==1)&&(u1.p66==1))&&((u2.p102==1)&&(u3.p138==1)))&&(((u4.p174==1)&&(u5.p210==1))&&((u6.p246==1)&&(u7.p282==1))))&&((...200
Reverse transition relation is NOT exact ! Due to transitions u0.t53, u0.t4284, u0.t55.t54, u1.t48, u1.t4282, u1.t50.t49, u2.t43, u2.t4280, u2.t45.t44, u3....492
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
64 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.815616,29740,1,0,6669,204,19675,1993,185,418,27938
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-14 finished in 358330 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-14 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-29 17:10:28] [INFO ] Flatten gal took : 258 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14240981124387260125
[2024-05-29 17:10:28] [INFO ] Too many transitions (4286) to apply POR reductions. Disabling POR matrices.
[2024-05-29 17:10:28] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14240981124387260125
Running compilation step : cd /tmp/ltsmin14240981124387260125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 17:10:28] [INFO ] Applying decomposition
[2024-05-29 17:10:29] [INFO ] Flatten gal took : 259 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16364153610029217206.txt' '-o' '/tmp/graph16364153610029217206.bin' '-w' '/tmp/graph16364153610029217206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16364153610029217206.bin' '-l' '-1' '-v' '-w' '/tmp/graph16364153610029217206.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:10:29] [INFO ] Decomposing Gal with order
[2024-05-29 17:10:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:10:30] [INFO ] Removed a total of 45142 redundant transitions.
[2024-05-29 17:10:30] [INFO ] Flatten gal took : 647 ms
[2024-05-29 17:10:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 147 ms.
[2024-05-29 17:10:31] [INFO ] Time to serialize gal into /tmp/LTLFireability15383148434575260539.gal : 146 ms
[2024-05-29 17:10:31] [INFO ] Time to serialize properties into /tmp/LTLFireability6095082205152996273.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15383148434575260539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6095082205152996273.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("(((((i1.u22.p30==1)&&(i1.u16.p66==1))&&((i1.u14.p102==1)&&(i1.u20.p138==1)))&&(((i1.u9.p174==1)&&(i1.u31.p210==1))&&((i1.u5.p24...694
Formula 0 simplified : X(!"(((((i1.u22.p30==1)&&(i1.u16.p66==1))&&((i1.u14.p102==1)&&(i1.u20.p138==1)))&&(((i1.u9.p174==1)&&(i1.u31.p210==1))&&((i1.u5.p246...682
Compilation finished in 26786 ms.
Running link step : cd /tmp/ltsmin14240981124387260125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin14240981124387260125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="StigmergyCommit-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-10a, 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 r400-tall-171690531800220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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