Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914200595.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is PermAdmissibility-COL-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.7K Mar 8 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Mar 8 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 8 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 8 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 16 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 8 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 8 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 8 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 16 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 54K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779792930746

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-26 10:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 10:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 10:55:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 10:55:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 10:55:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2026-05-26 10:55:32] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2026-05-26 10:55:32] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 5 ms.
[2026-05-26 10:55:32] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-COL-50-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40032 steps (48 resets) in 282 ms. (141 steps per ms) remains 1/34 properties
BEST_FIRST walk for 1661 steps (0 resets) in 20 ms. (79 steps per ms) remains 0/1 properties
[2026-05-26 10:55:32] [INFO ] Flatten gal took : 20 ms
[2026-05-26 10:55:32] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2026-05-26 10:55:33] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 11 ms.
[2026-05-26 10:55:33] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 27 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 16
Applied a total of 1 rules in 14 ms. Remains 39 /40 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8630279315876745564.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7866761698279964207.kers'
[2026-05-26 10:55:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8630279315876745564.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7866761698279964207.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 16 rows 34 cols 75 entries
Finished phase 1 with 1 SingleSign rule and 15 generalized
[2026-05-26 10:55:33] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7866761698279964207.kers
Total runtime 2 ms.
[2026-05-26 10:55:33] [INFO ] Implicit Places using invariants in 202 ms returned [4, 5, 6, 7]
[2026-05-26 10:55:33] [INFO ] Actually due to overlaps returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 233 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/40 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 37/40 places, 16/16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-922421584906114546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12490887836712119556.kers'
[2026-05-26 10:55:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-922421584906114546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12490887836712119556.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 16 rows 32 cols 69 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 10:55:33] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12490887836712119556.kers
Total runtime 0 ms.
[2026-05-26 10:55:33] [INFO ] Implicit Places using invariants in 41 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/37 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 35/37 places, 16/16 transitions.
Support contains 27 out of 35 places after structural reductions.
[2026-05-26 10:55:33] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:55:33] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:55:33] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40032 steps (48 resets) in 162 ms. (245 steps per ms) remains 1/34 properties
BEST_FIRST walk for 1664 steps (0 resets) in 14 ms. (110 steps per ms) remains 0/1 properties
FORMULA PermAdmissibility-COL-50-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 35 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(X(X(p1))))) U G(p1)))'
Support contains 3 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 26 transition count 16
Applied a total of 9 rules in 4 ms. Remains 26 /35 variables (removed 9) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6950723258715971165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5988993923843341312.kers'
[2026-05-26 10:55:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6950723258715971165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5988993923843341312.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 26 cols 59 entries
Finished phase 1 with 10 SingleSign rule and 6 generalized
[2026-05-26 10:55:33] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5988993923843341312.kers
Total runtime 0 ms.
[2026-05-26 10:55:33] [INFO ] Implicit Places using invariants in 43 ms returned [4, 10, 11, 13, 18, 19, 20, 21]
[2026-05-26 10:55:33] [INFO ] Actually due to overlaps returned [4, 10, 11, 18, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 44 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/35 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(X(X(p1))))) U G(p1)))'
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-00 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(X(G(p1)))))) U (p2||X(p3))))'
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 16
Applied a total of 8 rules in 2 ms. Remains 27 /35 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6572626358884005393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11011373861583202108.kers'
[2026-05-26 10:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6572626358884005393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11011373861583202108.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 27 cols 60 entries
Finished phase 1 with 9 SingleSign rule and 7 generalized
[2026-05-26 10:55:34] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11011373861583202108.kers
Total runtime 0 ms.
[2026-05-26 10:55:34] [INFO ] Implicit Places using invariants in 49 ms returned [4, 9, 10, 11, 12, 19, 21]
[2026-05-26 10:55:34] [INFO ] Actually due to overlaps returned [4, 9, 10, 11, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 50 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 22/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(X(G(p1)))))) U (p2||X(p3))))'
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 577 steps with 0 reset in 10 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-01 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F((p1||G(F(p2)))))))))))'
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 29 transition count 16
Applied a total of 6 rules in 2 ms. Remains 29 /35 variables (removed 6) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11686095961742696433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13038502707542766602.kers'
[2026-05-26 10:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11686095961742696433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13038502707542766602.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 28 cols 61 entries
Finished phase 1 with 8 SingleSign rule and 8 generalized
[2026-05-26 10:55:34] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13038502707542766602.kers
Total runtime 1 ms.
[2026-05-26 10:55:34] [INFO ] Implicit Places using invariants in 49 ms returned [4, 9, 10, 11, 12, 18, 19, 20, 21]
[2026-05-26 10:55:34] [INFO ] Actually due to overlaps returned [4, 9, 10, 11, 18, 19]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 50 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/35 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 23/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F((p1||G(F(p2)))))))))))'
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-02
Product exploration explored 100000 steps with 14256 reset in 203 ms.
Product exploration explored 100000 steps with 14252 reset in 119 ms.
Computed a total of 23 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 32339 steps (38 resets) in 49 ms. (646 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 545 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 1086 ms.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6508701664825224881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-185082252365716883.kers'
[2026-05-26 10:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6508701664825224881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-185082252365716883.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 22 cols 45 entries
Finished phase 1 with 12 SingleSign rule and 4 generalized
[2026-05-26 10:55:36] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-185082252365716883.kers
Total runtime 0 ms.
[2026-05-26 10:55:36] [INFO ] Implicit Places using invariants in 41 ms returned [8, 14, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 20/23 places, 16/16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40032 steps (48 resets) in 83 ms. (476 steps per ms) remains 1/4 properties
BEST_FIRST walk for 4202 steps (0 resets) in 17 ms. (233 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 588 ms.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 14265 reset in 61 ms.
Product exploration explored 100000 steps with 14254 reset in 125 ms.
Spot run failed in 74 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2236691571757758559
[2026-05-26 10:55:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2236691571757758559
Running compilation step : cd /tmp/ltsmin2236691571757758559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 203 ms.
Running link step : cd /tmp/ltsmin2236691571757758559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2236691571757758559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4489968166649777166.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2773838910249138863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6678411108763060221.kers'
[2026-05-26 10:55:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2773838910249138863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6678411108763060221.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 19 cols 36 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-26 10:55:53] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6678411108763060221.kers
Total runtime 0 ms.
[2026-05-26 10:55:53] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-26 10:55:53] [INFO ] Invariant cache hit.
[2026-05-26 10:55:53] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 10:55:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 3/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/36 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 24 constraints, problems are : Problem set: 0 solved, 15 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 3/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/36 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 39 constraints, problems are : Problem set: 0 solved, 15 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 552ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 560ms
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 20/20 places, 16/16 transitions.
Built C files in :
/tmp/ltsmin278896145031353996
[2026-05-26 10:55:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin278896145031353996
Running compilation step : cd /tmp/ltsmin278896145031353996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin278896145031353996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin278896145031353996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased17934391657806735370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 10:56:08] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:56:08] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:56:08] [INFO ] Time to serialize gal into /tmp/LTL890048996395242854.gal : 0 ms
[2026-05-26 10:56:08] [INFO ] Time to serialize properties into /tmp/LTL14281159241980145404.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL890048996395242854.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8692661402584507637.hoa' '-atoms' '/tmp/LTL14281159241980145404.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL14281159241980145404.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8692661402584507637.hoa
Detected timeout of ITS tools.
[2026-05-26 10:56:23] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:56:23] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:56:23] [INFO ] Time to serialize gal into /tmp/LTL5428534442216933360.gal : 2 ms
[2026-05-26 10:56:23] [INFO ] Time to serialize properties into /tmp/LTL3510296098817887326.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5428534442216933360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3510296098817887326.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(aux5<=c7)")||(X(X(X(X(F(("(out1<=out4)")||(G(F("(out3<3)"))))))))))))
Formula 0 simplified : F(!"(aux5<=c7)" & XXXXG(!"(out1<=out4)" & FG!"(out3<3)"))
Detected timeout of ITS tools.
[2026-05-26 10:56:38] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:56:38] [INFO ] Applying decomposition
[2026-05-26 10:56:38] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9254046306946079851.txt' '-o' '/tmp/graph9254046306946079851.bin' '-w' '/tmp/graph9254046306946079851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9254046306946079851.bin' '-l' '-1' '-v' '-w' '/tmp/graph9254046306946079851.weights' '-q' '0' '-e' '0.001'
[2026-05-26 10:56:39] [INFO ] Decomposing Gal with order
[2026-05-26 10:56:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 10:56:39] [INFO ] Removed a total of 1 redundant transitions.
[2026-05-26 10:56:39] [INFO ] Flatten gal took : 30 ms
[2026-05-26 10:56:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-26 10:56:39] [INFO ] Time to serialize gal into /tmp/LTL138491614615712538.gal : 1 ms
[2026-05-26 10:56:39] [INFO ] Time to serialize properties into /tmp/LTL11211043860865680259.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL138491614615712538.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11211043860865680259.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(gu2.aux5<=gu2.c7)")||(X(X(X(X(F(("(gu6.out1<=gu6.out4)")||(G(F("(gi1.gu4.out3<3)"))))))))))))
Formula 0 simplified : F(!"(gu2.aux5<=gu2.c7)" & XXXXG(!"(gu6.out1<=gu6.out4)" & FG!"(gi1.gu4.out3<3)"))
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-02 finished in 79491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 73 edges and 35 vertex of which 29 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 27 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 22 transition count 12
Applied a total of 11 rules in 14 ms. Remains 22 /35 variables (removed 13) and now considering 12/16 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7421998960411140050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11623061037484099635.kers'
[2026-05-26 10:56:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7421998960411140050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11623061037484099635.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 22 cols 47 entries
Finished phase 1 with 4 SingleSign rule and 8 generalized
[2026-05-26 10:56:54] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11623061037484099635.kers
Total runtime 1 ms.
[2026-05-26 10:56:54] [INFO ] Implicit Places using invariants in 45 ms returned [0, 6, 8, 9, 14, 15]
[2026-05-26 10:56:54] [INFO ] Actually due to overlaps returned [0, 6, 9, 14, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 46 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/35 places, 12/16 transitions.
Graph (complete) has 22 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 13 transition count 8
Applied a total of 4 rules in 4 ms. Remains 13 /17 variables (removed 4) and now considering 8/12 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6626096925333388737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12203536124005605621.kers'
[2026-05-26 10:56:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6626096925333388737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12203536124005605621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 13 cols 24 entries
Finished phase 1 with 6 SingleSign rule and 2 generalized
[2026-05-26 10:56:54] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12203536124005605621.kers
Total runtime 0 ms.
[2026-05-26 10:56:54] [INFO ] Implicit Places using invariants in 27 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/35 places, 8/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 6
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 6/8 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7560447946789543844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17950510311777140641.kers'
[2026-05-26 10:56:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7560447946789543844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17950510311777140641.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 10 cols 18 entries
Finished phase 1 with 4 SingleSign rule and 2 generalized
[2026-05-26 10:56:54] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17950510311777140641.kers
Total runtime 0 ms.
[2026-05-26 10:56:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 10:56:54] [INFO ] Invariant cache hit.
[2026-05-26 10:56:54] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 10/35 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 143 ms. Remains : 10/35 places, 6/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-04
Product exploration explored 100000 steps with 457 reset in 128 ms.
Product exploration explored 100000 steps with 462 reset in 130 ms.
Computed a total of 10 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 10 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40112 steps (128 resets) in 45 ms. (872 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (40 resets) in 206 ms. (193 steps per ms) remains 1/3 properties
BEST_FIRST walk for 143 steps (0 resets) in 6 ms. (20 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 358 ms.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2026-05-26 10:56:55] [INFO ] Invariant cache hit.
[2026-05-26 10:56:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 10:56:55] [INFO ] Invariant cache hit.
[2026-05-26 10:56:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-26 10:56:55] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-26 10:56:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 19 constraints, problems are : Problem set: 0 solved, 5 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 212ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 10/10 places, 6/6 transitions.
Computed a total of 10 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 10 factoid took 77 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40114 steps (128 resets) in 17 ms. (2228 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (40 resets) in 54 ms. (727 steps per ms) remains 1/3 properties
BEST_FIRST walk for 143 steps (0 resets) in 4 ms. (28 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 362 ms.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 461 reset in 85 ms.
Product exploration explored 100000 steps with 449 reset in 200 ms.
Built C files in :
/tmp/ltsmin2343437871476882089
[2026-05-26 10:56:56] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2026-05-26 10:56:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:56:56] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2026-05-26 10:56:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:56:56] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2026-05-26 10:56:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:56:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2343437871476882089
Running compilation step : cd /tmp/ltsmin2343437871476882089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin2343437871476882089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2343437871476882089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16274832403614589725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2026-05-26 10:57:11] [INFO ] Invariant cache hit.
[2026-05-26 10:57:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-26 10:57:11] [INFO ] Invariant cache hit.
[2026-05-26 10:57:11] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-26 10:57:11] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 10/10 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin11166761772860038363
[2026-05-26 10:57:11] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2026-05-26 10:57:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:57:11] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2026-05-26 10:57:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:57:11] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2026-05-26 10:57:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:57:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11166761772860038363
Running compilation step : cd /tmp/ltsmin11166761772860038363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin11166761772860038363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11166761772860038363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11411286340903191619.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 10:57:26] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:57:26] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:57:26] [INFO ] Time to serialize gal into /tmp/LTL3038469418626206900.gal : 1 ms
[2026-05-26 10:57:26] [INFO ] Time to serialize properties into /tmp/LTL15917655644638814063.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3038469418626206900.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13459173780062173353.hoa' '-atoms' '/tmp/LTL15917655644638814063.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15917655644638814063.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13459173780062173353.hoa
Detected timeout of ITS tools.
[2026-05-26 10:57:41] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:57:41] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:57:41] [INFO ] Time to serialize gal into /tmp/LTL3191176791554638855.gal : 0 ms
[2026-05-26 10:57:41] [INFO ] Time to serialize properties into /tmp/LTL15275920769031390926.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3191176791554638855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15275920769031390926.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((in2<=out6)||(out3<=c8))")||(G("(aux7>=3)"))))))
Formula 0 simplified : G(F!"(aux7>=3)" & FG!"((in2<=out6)||(out3<=c8))")
Detected timeout of ITS tools.
[2026-05-26 10:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:57:56] [INFO ] Applying decomposition
[2026-05-26 10:57:56] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3543041665896861165.txt' '-o' '/tmp/graph3543041665896861165.bin' '-w' '/tmp/graph3543041665896861165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3543041665896861165.bin' '-l' '-1' '-v' '-w' '/tmp/graph3543041665896861165.weights' '-q' '0' '-e' '0.001'
[2026-05-26 10:57:56] [INFO ] Decomposing Gal with order
[2026-05-26 10:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 10:57:56] [INFO ] Removed a total of 1 redundant transitions.
[2026-05-26 10:57:56] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 10:57:56] [INFO ] Time to serialize gal into /tmp/LTL2958237078302451564.gal : 0 ms
[2026-05-26 10:57:56] [INFO ] Time to serialize properties into /tmp/LTL13284432368558446554.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2958237078302451564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13284432368558446554.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((gu1.in2<=gu1.out6)||(gu0.out3<=gu0.c8))")||(G("(gu2.aux7>=3)"))))))
Formula 0 simplified : G(F!"(gu2.aux7>=3)" & FG!"((gu1.in2<=gu1.out6)||(gu0.out3<=gu0.c8))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-04 finished in 77359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||(p1 U p2)))) U (p3||G(p4))))'
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 73 edges and 35 vertex of which 27 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 22 transition count 13
Applied a total of 8 rules in 8 ms. Remains 22 /35 variables (removed 13) and now considering 13/16 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14198860232709987675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12207369546051231467.kers'
[2026-05-26 10:58:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14198860232709987675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12207369546051231467.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 22 cols 50 entries
Finished phase 1 with 7 SingleSign rule and 6 generalized
[2026-05-26 10:58:11] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12207369546051231467.kers
Total runtime 0 ms.
[2026-05-26 10:58:11] [INFO ] Implicit Places using invariants in 47 ms returned [1, 8, 9, 10, 15, 17]
[2026-05-26 10:58:11] [INFO ] Actually due to overlaps returned [1, 8, 9, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/35 places, 13/16 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 16 ms. Remains 17 /18 variables (removed 1) and now considering 12/13 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 73 ms. Remains : 17/35 places, 12/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(((p0 U p1)||p2))) U (p3||G(p4))))'
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-05
Product exploration explored 100000 steps with 186 reset in 145 ms.
Product exploration explored 100000 steps with 178 reset in 139 ms.
Computed a total of 17 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 32 factoid took 5462 ms. Reduced automaton from 4 states, 15 edges and 5 AP (stutter insensitive) to 4 states, 14 edges and 5 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40048 steps (64 resets) in 59 ms. (667 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40002 steps (20 resets) in 277 ms. (143 steps per ms) remains 2/4 properties
BEST_FIRST walk for 18049 steps (2 resets) in 59 ms. (300 steps per ms) remains 0/2 properties
Knowledge based reduction with 32 factoid took 27869 ms. Reduced automaton from 4 states, 14 edges and 5 AP (stutter insensitive) to 4 states, 14 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4))]
Knowledge-based reduction took 33793 ms.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4))]
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7462405663389678500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12239321515644119209.kers'
[2026-05-26 10:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7462405663389678500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12239321515644119209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 17 cols 36 entries
Finished phase 1 with 9 SingleSign rule and 3 generalized
[2026-05-26 10:58:46] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12239321515644119209.kers
Total runtime 0 ms.
[2026-05-26 10:58:46] [INFO ] Implicit Places using invariants in 38 ms returned [6, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/17 places, 12/12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 13 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 11 transition count 8
Applied a total of 8 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 8/12 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18436937214393730367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8329052668806233911.kers'
[2026-05-26 10:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18436937214393730367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8329052668806233911.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 11 cols 23 entries
Finished phase 1 with 5 SingleSign rule and 3 generalized
[2026-05-26 10:58:46] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8329052668806233911.kers
Total runtime 0 ms.
[2026-05-26 10:58:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 10:58:46] [INFO ] Invariant cache hit.
[2026-05-26 10:58:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/17 places, 8/12 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 11/17 places, 8/12 transitions.
Computed a total of 11 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 28 factoid took 865 ms. Reduced automaton from 4 states, 14 edges and 5 AP (stutter insensitive) to 4 states, 14 edges and 5 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40080 steps (96 resets) in 45 ms. (871 steps per ms) remains 2/12 properties
BEST_FIRST walk for 28768 steps (11 resets) in 21 ms. (1307 steps per ms) remains 0/2 properties
Knowledge based reduction with 28 factoid took 2787 ms. Reduced automaton from 4 states, 14 edges and 5 AP (stutter insensitive) to 4 states, 14 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4))]
Knowledge-based reduction took 3852 ms.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4))]
Product exploration explored 100000 steps with 482 reset in 110 ms.
Product exploration explored 100000 steps with 487 reset in 105 ms.
Built C files in :
/tmp/ltsmin20965364935292787
[2026-05-26 10:58:50] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2026-05-26 10:58:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:58:50] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2026-05-26 10:58:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:58:50] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2026-05-26 10:58:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:58:50] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin20965364935292787
Running compilation step : cd /tmp/ltsmin20965364935292787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin20965364935292787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin20965364935292787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2000818326466076553.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-26 10:59:05] [INFO ] Invariant cache hit.
[2026-05-26 10:59:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-26 10:59:05] [INFO ] Invariant cache hit.
[2026-05-26 10:59:05] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-26 10:59:05] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-26 10:59:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 21 constraints, problems are : Problem set: 0 solved, 7 unsolved in 99 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 11/11 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin13827931439095705338
[2026-05-26 10:59:05] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2026-05-26 10:59:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:59:05] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2026-05-26 10:59:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:59:05] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2026-05-26 10:59:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:59:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13827931439095705338
Running compilation step : cd /tmp/ltsmin13827931439095705338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin13827931439095705338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin13827931439095705338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased914044426144220005.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 10:59:20] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:59:20] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:59:20] [INFO ] Time to serialize gal into /tmp/LTL7034438606623476650.gal : 0 ms
[2026-05-26 10:59:20] [INFO ] Time to serialize properties into /tmp/LTL1777569138575149385.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7034438606623476650.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12082992181456141201.hoa' '-atoms' '/tmp/LTL1777569138575149385.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1777569138575149385.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12082992181456141201.hoa
Reverse transition relation is NOT exact ! Due to transitions t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...162
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 10:59:35] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:59:35] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:59:35] [INFO ] Time to serialize gal into /tmp/LTL7564003653038165752.gal : 0 ms
[2026-05-26 10:59:35] [INFO ] Time to serialize properties into /tmp/LTL6092431157000153183.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7564003653038165752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6092431157000153183.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(G((("(aux8<=c12)")U("(c8<=c7)"))||("((in2<=aux8)&&(aux14>=1))"))))U(("(in2<=aux8)")||(G("(aux14<1)")))))
Formula 0 simplified : GF(!"((in2<=aux8)&&(aux14>=1))" & (!"(aux8<=c12)" R !"(c8<=c7)")) R (!"(in2<=aux8)" & F!"(aux14<1)")
Reverse transition relation is NOT exact ! Due to transitions t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...162
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 10:59:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:59:50] [INFO ] Applying decomposition
[2026-05-26 10:59:50] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1563071615464478395.txt' '-o' '/tmp/graph1563071615464478395.bin' '-w' '/tmp/graph1563071615464478395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1563071615464478395.bin' '-l' '-1' '-v' '-w' '/tmp/graph1563071615464478395.weights' '-q' '0' '-e' '0.001'
[2026-05-26 10:59:50] [INFO ] Decomposing Gal with order
[2026-05-26 10:59:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 10:59:50] [INFO ] Removed a total of 1 redundant transitions.
[2026-05-26 10:59:50] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:59:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2026-05-26 10:59:50] [INFO ] Time to serialize gal into /tmp/LTL5108985993201025866.gal : 0 ms
[2026-05-26 10:59:50] [INFO ] Time to serialize properties into /tmp/LTL18335820698585098862.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5108985993201025866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18335820698585098862.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G((("(gu1.aux8<=gu1.c12)")U("(gu0.c8<=gu0.c7)"))||("((gu1.in2<=gu1.aux8)&&(gi2.gu2.aux14>=1))"))))U(("(gu1.in2<=gu1.aux8)")||(G(...179
Formula 0 simplified : GF(!"((gu1.in2<=gu1.aux8)&&(gi2.gu2.aux14>=1))" & (!"(gu1.aux8<=gu1.c12)" R !"(gu0.c8<=gu0.c7)")) R (!"(gu1.in2<=gu1.aux8)" & F!"(gi...171
Reverse transition relation is NOT exact ! Due to transitions gi2.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...166
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-05 finished in 114456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 26 transition count 16
Applied a total of 9 rules in 2 ms. Remains 26 /35 variables (removed 9) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3973312126759925597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12972564015857824263.kers'
[2026-05-26 11:00:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3973312126759925597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12972564015857824263.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 26 cols 59 entries
Finished phase 1 with 10 SingleSign rule and 6 generalized
[2026-05-26 11:00:05] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12972564015857824263.kers
Total runtime 1 ms.
[2026-05-26 11:00:06] [INFO ] Implicit Places using invariants in 55 ms returned [4, 9, 10, 11, 12, 18, 19, 20, 21]
[2026-05-26 11:00:06] [INFO ] Actually due to overlaps returned [4, 9, 10, 11, 18, 19]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 56 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/35 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 20/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 453 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-08 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 73 edges and 35 vertex of which 24 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 21 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 20 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 18 transition count 10
Applied a total of 10 rules in 3 ms. Remains 18 /35 variables (removed 17) and now considering 10/16 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10884113394640870838.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5233461673955411361.kers'
[2026-05-26 11:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10884113394640870838.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5233461673955411361.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 18 cols 39 entries
Finished phase 1 with 5 SingleSign rule and 5 generalized
[2026-05-26 11:00:06] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5233461673955411361.kers
Total runtime 0 ms.
[2026-05-26 11:00:06] [INFO ] Implicit Places using invariants in 34 ms returned [1, 6, 7, 8, 9, 10, 15]
[2026-05-26 11:00:06] [INFO ] Actually due to overlaps returned [1, 6, 7, 8, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/35 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 8 transition count 5
Applied a total of 7 rules in 2 ms. Remains 8 /13 variables (removed 5) and now considering 5/10 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8599116800524357445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1559889344705819708.kers'
[2026-05-26 11:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8599116800524357445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1559889344705819708.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 8 cols 14 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-26 11:00:06] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1559889344705819708.kers
Total runtime 1 ms.
[2026-05-26 11:00:06] [INFO ] Implicit Places using invariants in 31 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/35 places, 5/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5 transition count 2
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 2 transition count 1
Applied a total of 6 rules in 1 ms. Remains 2 /6 variables (removed 4) and now considering 1/5 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17655024220529508878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13898387206985891538.kers'
[2026-05-26 11:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17655024220529508878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13898387206985891538.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1 rows 1 cols 1 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-26 11:00:06] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13898387206985891538.kers
Total runtime 0 ms.
[2026-05-26 11:00:06] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 11:00:06] [INFO ] Invariant cache hit.
[2026-05-26 11:00:06] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2/35 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 114 ms. Remains : 2/35 places, 1/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 19 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 51 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLCardinality-09 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&(p1||G(p2))))))))'
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 28 transition count 16
Applied a total of 7 rules in 1 ms. Remains 28 /35 variables (removed 7) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13723397192441932280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10314087543558214763.kers'
[2026-05-26 11:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13723397192441932280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10314087543558214763.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 28 cols 61 entries
Finished phase 1 with 8 SingleSign rule and 8 generalized
[2026-05-26 11:00:06] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10314087543558214763.kers
Total runtime 0 ms.
[2026-05-26 11:00:06] [INFO ] Implicit Places using invariants in 39 ms returned [4, 9, 10, 11, 12, 13, 18, 19, 20, 21]
[2026-05-26 11:00:06] [INFO ] Actually due to overlaps returned [4, 9, 10, 11, 18, 19]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 41 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 22/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&(p1||G(p2))))))))'
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-10
Product exploration explored 100000 steps with 124 reset in 214 ms.
Product exploration explored 100000 steps with 124 reset in 181 ms.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 34022 steps (40 resets) in 17 ms. (1890 steps per ms) remains 0/14 properties
Knowledge based reduction with 4 factoid took 287 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 736 ms.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6906889555569705347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2586445176363140913.kers'
[2026-05-26 11:00:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6906889555569705347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2586445176363140913.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 22 cols 45 entries
Finished phase 1 with 12 SingleSign rule and 4 generalized
[2026-05-26 11:00:08] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2586445176363140913.kers
Total runtime 0 ms.
[2026-05-26 11:00:08] [INFO ] Implicit Places using invariants in 35 ms returned [8, 9, 14, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 18/22 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 31506 steps (37 resets) in 12 ms. (2423 steps per ms) remains 0/14 properties
Knowledge based reduction with 4 factoid took 301 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 705 ms.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 124 reset in 117 ms.
Product exploration explored 100000 steps with 124 reset in 125 ms.
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14226196747949604572
[2026-05-26 11:00:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14226196747949604572
Running compilation step : cd /tmp/ltsmin14226196747949604572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin14226196747949604572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14226196747949604572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9971489301113557393.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16438222534291647372.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4982027938948345167.kers'
[2026-05-26 11:00:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16438222534291647372.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4982027938948345167.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 18 cols 33 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-26 11:00:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4982027938948345167.kers
Total runtime 0 ms.
[2026-05-26 11:00:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-26 11:00:25] [INFO ] Invariant cache hit.
[2026-05-26 11:00:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 11:00:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 16/34 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/34 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 20 constraints, problems are : Problem set: 0 solved, 15 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 16/34 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 305ms
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 18/18 places, 16/16 transitions.
Built C files in :
/tmp/ltsmin3034115515242971864
[2026-05-26 11:00:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3034115515242971864
Running compilation step : cd /tmp/ltsmin3034115515242971864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin3034115515242971864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3034115515242971864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3699246515284527193.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 11:00:40] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:00:40] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:00:40] [INFO ] Time to serialize gal into /tmp/LTL16540092780147232221.gal : 0 ms
[2026-05-26 11:00:40] [INFO ] Time to serialize properties into /tmp/LTL8022594810627719666.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16540092780147232221.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8240048181997876840.hoa' '-atoms' '/tmp/LTL8022594810627719666.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8022594810627719666.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8240048181997876840.hoa
Reverse transition relation is NOT exact ! Due to transitions t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 11:00:55] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:00:55] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:00:55] [INFO ] Time to serialize gal into /tmp/LTL8531222161043182018.gal : 1 ms
[2026-05-26 11:00:55] [INFO ] Time to serialize properties into /tmp/LTL14975800356417320659.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8531222161043182018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14975800356417320659.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(c15<=c7)"))&&(("(out2>=2)")||(G("(out6<=c8)")))))))))
Formula 0 simplified : XXXG(F!"(c15<=c7)" | (!"(out2>=2)" & F!"(out6<=c8)"))
Reverse transition relation is NOT exact ! Due to transitions t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 11:01:10] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:01:10] [INFO ] Applying decomposition
[2026-05-26 11:01:10] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1558343777305400728.txt' '-o' '/tmp/graph1558343777305400728.bin' '-w' '/tmp/graph1558343777305400728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1558343777305400728.bin' '-l' '-1' '-v' '-w' '/tmp/graph1558343777305400728.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:01:10] [INFO ] Decomposing Gal with order
[2026-05-26 11:01:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:01:10] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 11:01:10] [INFO ] Time to serialize gal into /tmp/LTL3457882022356473828.gal : 1 ms
[2026-05-26 11:01:10] [INFO ] Time to serialize properties into /tmp/LTL18198093845118114767.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3457882022356473828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18198093845118114767.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(gu1.c15<=gu1.c7)"))&&(("(gi4.gu0.out2>=2)")||(G("(gu4.out6<=gu4.c8)")))))))))
Formula 0 simplified : XXXG(F!"(gu1.c15<=gu1.c7)" | (!"(gi4.gu0.out2>=2)" & F!"(gu4.out6<=gu4.c8)"))
Reverse transition relation is NOT exact ! Due to transitions gi4.gu6.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-10 finished in 79134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X((p0||X(p1)))&&(p2 U !p0)))))))'
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 16
Applied a total of 8 rules in 1 ms. Remains 27 /35 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5007309775886942005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13782639625932810577.kers'
[2026-05-26 11:01:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5007309775886942005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13782639625932810577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 27 cols 60 entries
Finished phase 1 with 11 SingleSign rule and 5 generalized
[2026-05-26 11:01:25] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13782639625932810577.kers
Total runtime 0 ms.
[2026-05-26 11:01:25] [INFO ] Implicit Places using invariants in 48 ms returned [4, 9, 10, 11, 12, 13, 20, 21]
[2026-05-26 11:01:25] [INFO ] Actually due to overlaps returned [4, 9, 10, 11, 20, 21]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 49 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/35 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X((p0||X(p1)))&&(p2 U !p0)))))))'
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-11
Product exploration explored 100000 steps with 2151 reset in 207 ms.
Product exploration explored 100000 steps with 2110 reset in 108 ms.
Computed a total of 21 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 37941 steps (45 resets) in 10 ms. (3449 steps per ms) remains 0/6 properties
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8049371036230833921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15120350440085657546.kers'
[2026-05-26 11:01:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8049371036230833921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15120350440085657546.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 21 cols 44 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-26 11:01:27] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15120350440085657546.kers
Total runtime 0 ms.
[2026-05-26 11:01:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-26 11:01:27] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-26 11:01:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-26 11:01:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 11:01:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-26 11:01:27] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-26 11:01:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-26 11:01:27] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 11:01:27] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG p0
Knowledge-based reduction took 844 ms.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 11:01:27] [INFO ] Invariant cache hit.
[2026-05-26 11:01:27] [INFO ] Implicit Places using invariants in 24 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/21 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26 ms. Remains : 19/21 places, 16/16 transitions.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 38757 steps (46 resets) in 13 ms. (2768 steps per ms) remains 0/6 properties
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-117339543628394828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15340342044411554756.kers'
[2026-05-26 11:01:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-117339543628394828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15340342044411554756.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 19 cols 38 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-26 11:01:28] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15340342044411554756.kers
Total runtime 1 ms.
[2026-05-26 11:01:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-26 11:01:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 11:01:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 11:01:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-26 11:01:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-26 11:01:28] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 11:01:28] [INFO ] Added : 15 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG p0
Knowledge-based reduction took 685 ms.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2148 reset in 92 ms.
Product exploration explored 100000 steps with 2178 reset in 97 ms.
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16712675492789236401
[2026-05-26 11:01:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16712675492789236401
Running compilation step : cd /tmp/ltsmin16712675492789236401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin16712675492789236401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16712675492789236401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased1527777974089475465.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 11:01:44] [INFO ] Invariant cache hit.
[2026-05-26 11:01:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-26 11:01:44] [INFO ] Invariant cache hit.
[2026-05-26 11:01:44] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 11:01:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 22 constraints, problems are : Problem set: 0 solved, 15 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 345ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 345ms
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 19/19 places, 16/16 transitions.
Built C files in :
/tmp/ltsmin10909997700532481803
[2026-05-26 11:01:44] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10909997700532481803
Running compilation step : cd /tmp/ltsmin10909997700532481803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin10909997700532481803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10909997700532481803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7578825701830659403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 11:01:59] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:01:59] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:01:59] [INFO ] Time to serialize gal into /tmp/LTL16121185721326163510.gal : 1 ms
[2026-05-26 11:01:59] [INFO ] Time to serialize properties into /tmp/LTL8268258340545311389.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16121185721326163510.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16854670608314084264.hoa' '-atoms' '/tmp/LTL8268258340545311389.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8268258340545311389.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16854670608314084264.hoa
Detected timeout of ITS tools.
[2026-05-26 11:02:14] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:02:14] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:02:14] [INFO ] Time to serialize gal into /tmp/LTL11157944693723919477.gal : 0 ms
[2026-05-26 11:02:14] [INFO ] Time to serialize properties into /tmp/LTL6392412801044374342.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11157944693723919477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6392412801044374342.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((X(("(aux15<=aux16)")||(X("(c17<2)"))))&&(("(c5<=out7)")U("(aux15>aux16)"))))))))
Formula 0 simplified : XXXG(X(!"(aux15<=aux16)" & X!"(c17<2)") | (!"(c5<=out7)" R !"(aux15>aux16)"))
Detected timeout of ITS tools.
[2026-05-26 11:02:29] [INFO ] Flatten gal took : 3 ms
[2026-05-26 11:02:29] [INFO ] Applying decomposition
[2026-05-26 11:02:29] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6711602692019404499.txt' '-o' '/tmp/graph6711602692019404499.bin' '-w' '/tmp/graph6711602692019404499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6711602692019404499.bin' '-l' '-1' '-v' '-w' '/tmp/graph6711602692019404499.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:02:29] [INFO ] Decomposing Gal with order
[2026-05-26 11:02:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:02:29] [INFO ] Removed a total of 2 redundant transitions.
[2026-05-26 11:02:29] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:02:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 11:02:29] [INFO ] Time to serialize gal into /tmp/LTL1398644562189386238.gal : 0 ms
[2026-05-26 11:02:29] [INFO ] Time to serialize properties into /tmp/LTL17148323757344084744.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1398644562189386238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17148323757344084744.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((X(("(gu6.aux15<=gu6.aux16)")||(X("(gi0.gi2.gu0.c17<2)"))))&&(("(gu8.c5<=gu8.out7)")U("(gu6.aux15>gu6.aux16)"))))))))
Formula 0 simplified : XXXG(X(!"(gu6.aux15<=gu6.aux16)" & X!"(gi0.gi2.gu0.c17<2)") | (!"(gu8.c5<=gu8.out7)" R !"(gu6.aux15>gu6.aux16)"))
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-11 finished in 79040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1) U p2))))'
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 73 edges and 35 vertex of which 28 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 24 transition count 14
Applied a total of 6 rules in 5 ms. Remains 24 /35 variables (removed 11) and now considering 14/16 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12480627689480130122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14350428114175579193.kers'
[2026-05-26 11:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12480627689480130122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14350428114175579193.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 24 cols 53 entries
Finished phase 1 with 7 SingleSign rule and 7 generalized
[2026-05-26 11:02:44] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14350428114175579193.kers
Total runtime 0 ms.
[2026-05-26 11:02:44] [INFO ] Implicit Places using invariants in 37 ms returned [7, 8, 9, 11, 16]
[2026-05-26 11:02:44] [INFO ] Actually due to overlaps returned [7, 8, 9, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/35 places, 14/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 13
Applied a total of 2 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 13/14 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18406740660264113411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9389614756570925495.kers'
[2026-05-26 11:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18406740660264113411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9389614756570925495.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 19 cols 40 entries
Finished phase 1 with 8 SingleSign rule and 5 generalized
[2026-05-26 11:02:44] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9389614756570925495.kers
Total runtime 3 ms.
[2026-05-26 11:02:44] [INFO ] Implicit Places using invariants in 39 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/35 places, 13/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 12
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 17 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 16 transition count 11
Applied a total of 4 rules in 1 ms. Remains 16 /18 variables (removed 2) and now considering 11/13 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8519682815804866338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2478200969481956928.kers'
[2026-05-26 11:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8519682815804866338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2478200969481956928.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 16 cols 33 entries
Finished phase 1 with 7 SingleSign rule and 4 generalized
[2026-05-26 11:02:44] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2478200969481956928.kers
Total runtime 0 ms.
[2026-05-26 11:02:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 11:02:44] [INFO ] Invariant cache hit.
[2026-05-26 11:02:44] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 16/35 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 162 ms. Remains : 16/35 places, 11/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1) U p2))))'
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-12
Product exploration explored 100000 steps with 1395 reset in 105 ms.
Product exploration explored 100000 steps with 1480 reset in 115 ms.
Computed a total of 16 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 14 factoid took 278 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
RANDOM walk for 40052 steps (68 resets) in 15 ms. (2503 steps per ms) remains 1/9 properties
BEST_FIRST walk for 4066 steps (0 resets) in 6 ms. (580 steps per ms) remains 0/1 properties
Knowledge based reduction with 14 factoid took 574 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), false, false, false, false]
[2026-05-26 11:02:46] [INFO ] Invariant cache hit.
[2026-05-26 11:02:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-26 11:02:46] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 11:02:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-26 11:02:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 11:02:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-26 11:02:46] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 11:02:46] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 11:02:46] [INFO ] Computed and/alt/rep : 10/16/10 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-26 11:02:46] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1312 ms.
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), false, false, false, false]
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2026-05-26 11:02:47] [INFO ] Invariant cache hit.
[2026-05-26 11:02:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-26 11:02:47] [INFO ] Invariant cache hit.
[2026-05-26 11:02:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2026-05-26 11:02:47] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-26 11:02:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 11/27 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 11/27 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 270ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 16/16 places, 11/11 transitions.
Computed a total of 16 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 19 factoid took 242 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
RANDOM walk for 40052 steps (68 resets) in 14 ms. (2670 steps per ms) remains 2/9 properties
BEST_FIRST walk for 28631 steps (6 resets) in 39 ms. (715 steps per ms) remains 0/2 properties
Knowledge based reduction with 19 factoid took 518 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), false, false, false, false]
[2026-05-26 11:02:48] [INFO ] Invariant cache hit.
[2026-05-26 11:02:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-26 11:02:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 11:02:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 11:02:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 11:02:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-26 11:02:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 11:02:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 11:02:48] [INFO ] Computed and/alt/rep : 10/16/10 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 11:02:48] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1194 ms.
Stuttering acceptance computed with spot in 339 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), false, false, false, false]
Stuttering acceptance computed with spot in 328 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), false, false, false, false]
Product exploration explored 100000 steps with 1393 reset in 112 ms.
Product exploration explored 100000 steps with 1386 reset in 111 ms.
Built C files in :
/tmp/ltsmin746947726082041461
[2026-05-26 11:02:49] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2026-05-26 11:02:49] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:02:49] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2026-05-26 11:02:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:02:49] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2026-05-26 11:02:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:02:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin746947726082041461
Running compilation step : cd /tmp/ltsmin746947726082041461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 101 ms.
Running link step : cd /tmp/ltsmin746947726082041461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin746947726082041461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11102587504816890551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2026-05-26 11:03:04] [INFO ] Invariant cache hit.
[2026-05-26 11:03:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-26 11:03:04] [INFO ] Invariant cache hit.
[2026-05-26 11:03:04] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2026-05-26 11:03:04] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 16/16 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin4906719822586651141
[2026-05-26 11:03:04] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2026-05-26 11:03:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:03:04] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2026-05-26 11:03:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:03:04] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2026-05-26 11:03:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:03:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4906719822586651141
Running compilation step : cd /tmp/ltsmin4906719822586651141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin4906719822586651141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4906719822586651141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15052121428399114479.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 11:03:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:03:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:03:19] [INFO ] Time to serialize gal into /tmp/LTL1110050344097766840.gal : 1 ms
[2026-05-26 11:03:19] [INFO ] Time to serialize properties into /tmp/LTL7254899895282602992.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1110050344097766840.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11220307240926142633.hoa' '-atoms' '/tmp/LTL7254899895282602992.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7254899895282602992.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11220307240926142633.hoa
Detected timeout of ITS tools.
[2026-05-26 11:03:34] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:03:34] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:03:34] [INFO ] Time to serialize gal into /tmp/LTL13165973463142403872.gal : 0 ms
[2026-05-26 11:03:34] [INFO ] Time to serialize properties into /tmp/LTL8318552093570571426.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13165973463142403872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8318552093570571426.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(out4<=c7)")&&((F("(aux6<=aux13)"))U("(aux14>in1)")))))
Formula 0 simplified : G(!"(out4<=c7)" | (G!"(aux6<=aux13)" R !"(aux14>in1)"))
Detected timeout of ITS tools.
[2026-05-26 11:03:49] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:03:49] [INFO ] Applying decomposition
[2026-05-26 11:03:49] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5886434897398905640.txt' '-o' '/tmp/graph5886434897398905640.bin' '-w' '/tmp/graph5886434897398905640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5886434897398905640.bin' '-l' '-1' '-v' '-w' '/tmp/graph5886434897398905640.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:03:49] [INFO ] Decomposing Gal with order
[2026-05-26 11:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:03:49] [INFO ] Removed a total of 4 redundant transitions.
[2026-05-26 11:03:49] [INFO ] Flatten gal took : 4 ms
[2026-05-26 11:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2026-05-26 11:03:49] [INFO ] Time to serialize gal into /tmp/LTL15168709175570189535.gal : 0 ms
[2026-05-26 11:03:49] [INFO ] Time to serialize properties into /tmp/LTL17571904242264209614.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15168709175570189535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17571904242264209614.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(gu6.out4<=gu6.c7)")&&((F("(gu3.aux6<=gu3.aux13)"))U("(gu2.aux14>gu2.in1)")))))
Formula 0 simplified : G(!"(gu6.out4<=gu6.c7)" | (G!"(gu3.aux6<=gu3.aux13)" R !"(gu2.aux14>gu2.in1)"))
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-COL-50-LTLCardinality-12 finished in 79957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((X(p0)&&F(!p0)) U (p1 U (!p1 U p2)))))'
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 16
Applied a total of 8 rules in 1 ms. Remains 27 /35 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10641277381221759148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17665687348885121340.kers'
[2026-05-26 11:04:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10641277381221759148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17665687348885121340.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 27 cols 60 entries
Finished phase 1 with 9 SingleSign rule and 7 generalized
[2026-05-26 11:04:04] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17665687348885121340.kers
Total runtime 1 ms.
[2026-05-26 11:04:04] [INFO ] Implicit Places using invariants in 43 ms returned [4, 10, 11, 12, 18, 19, 20, 21]
[2026-05-26 11:04:04] [INFO ] Actually due to overlaps returned [4, 10, 11, 18, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 45 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/35 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 22/35 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((X(p0)&&F(!p0)) U (p1 U (!p1 U p2)))))'
Stuttering acceptance computed with spot in 410 ms :[p2, p2, true, p2, p2, (AND p0 p2), false, (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 413 steps with 6 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-13 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 73 edges and 35 vertex of which 24 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 21 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 20 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 18 transition count 10
Applied a total of 10 rules in 3 ms. Remains 18 /35 variables (removed 17) and now considering 10/16 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11697632963746625532.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16628617211531048219.kers'
[2026-05-26 11:04:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11697632963746625532.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16628617211531048219.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 18 cols 39 entries
Finished phase 1 with 5 SingleSign rule and 5 generalized
[2026-05-26 11:04:05] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16628617211531048219.kers
Total runtime 0 ms.
[2026-05-26 11:04:05] [INFO ] Implicit Places using invariants in 38 ms returned [6, 7, 8, 9, 10, 15]
[2026-05-26 11:04:05] [INFO ] Actually due to overlaps returned [6, 7, 8, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/35 places, 10/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 7
Applied a total of 6 rules in 3 ms. Remains 11 /14 variables (removed 3) and now considering 7/10 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14841627844351577272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14468855085151427916.kers'
[2026-05-26 11:04:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14841627844351577272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14468855085151427916.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 11 cols 22 entries
Finished phase 1 with 5 SingleSign rule and 2 generalized
[2026-05-26 11:04:05] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14468855085151427916.kers
Total runtime 1 ms.
[2026-05-26 11:04:05] [INFO ] Implicit Places using invariants in 26 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/35 places, 7/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 4
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 6 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 5 transition count 3
Applied a total of 8 rules in 1 ms. Remains 5 /9 variables (removed 4) and now considering 3/7 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5122790474960842010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3204806916656591146.kers'
[2026-05-26 11:04:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5122790474960842010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3204806916656591146.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 5 cols 8 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-26 11:04:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3204806916656591146.kers
Total runtime 1 ms.
[2026-05-26 11:04:05] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-26 11:04:05] [INFO ] Invariant cache hit.
[2026-05-26 11:04:05] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 5/35 places, 3/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 112 ms. Remains : 5/35 places, 3/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-14
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-14 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 16/16 transitions.
Graph (complete) has 73 edges and 35 vertex of which 28 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 26 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 21 transition count 12
Applied a total of 11 rules in 4 ms. Remains 21 /35 variables (removed 14) and now considering 12/16 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2137748173655137451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3658340616015784188.kers'
[2026-05-26 11:04:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2137748173655137451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3658340616015784188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 21 cols 46 entries
Finished phase 1 with 5 SingleSign rule and 7 generalized
[2026-05-26 11:04:05] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3658340616015784188.kers
Total runtime 0 ms.
[2026-05-26 11:04:05] [INFO ] Implicit Places using invariants in 33 ms returned [0, 5, 6, 7, 8, 9, 14, 15]
[2026-05-26 11:04:05] [INFO ] Actually due to overlaps returned [0, 5, 6, 7, 14, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 35 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/35 places, 12/16 transitions.
Graph (complete) has 18 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 10 transition count 7
Applied a total of 6 rules in 2 ms. Remains 10 /15 variables (removed 5) and now considering 7/12 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11767782676110713837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2406769652022795059.kers'
[2026-05-26 11:04:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11767782676110713837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2406769652022795059.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 10 cols 18 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-26 11:04:05] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2406769652022795059.kers
Total runtime 0 ms.
[2026-05-26 11:04:05] [INFO ] Implicit Places using invariants in 18 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/35 places, 7/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4 transition count 3
Applied a total of 6 rules in 2 ms. Remains 4 /8 variables (removed 4) and now considering 3/7 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10027058297630722410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3063829108320175773.kers'
[2026-05-26 11:04:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10027058297630722410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3063829108320175773.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 4 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-26 11:04:05] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3063829108320175773.kers
Total runtime 0 ms.
[2026-05-26 11:04:05] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-26 11:04:05] [INFO ] Invariant cache hit.
[2026-05-26 11:04:05] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4/35 places, 3/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 98 ms. Remains : 4/35 places, 3/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLCardinality-15
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-50-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLCardinality-15 finished in 158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F((p1||G(F(p2)))))))))))'
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||(p1 U p2)))) U (p3||G(p4))))'
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&(p1||G(p2))))))))'
Spot run failed in 41 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X((p0||X(p1)))&&(p2 U !p0)))))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1) U p2))))'
Spot run failed in 40 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 11:04:06] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7696450926557758426
[2026-05-26 11:04:06] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2026-05-26 11:04:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:04:06] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2026-05-26 11:04:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:04:06] [INFO ] Applying decomposition
[2026-05-26 11:04:06] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2026-05-26 11:04:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:04:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7696450926557758426
Running compilation step : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 11:04:06] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12189825302255565161.txt' '-o' '/tmp/graph12189825302255565161.bin' '-w' '/tmp/graph12189825302255565161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12189825302255565161.bin' '-l' '-1' '-v' '-w' '/tmp/graph12189825302255565161.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:04:06] [INFO ] Decomposing Gal with order
[2026-05-26 11:04:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:04:06] [INFO ] Removed a total of 6 redundant transitions.
[2026-05-26 11:04:06] [INFO ] Flatten gal took : 4 ms
[2026-05-26 11:04:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2026-05-26 11:04:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality5579910036929532195.gal : 1 ms
[2026-05-26 11:04:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality4264921459462623519.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5579910036929532195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4264921459462623519.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 6 LTL properties
Checking formula 0 : !((G(("(gi6.gu2.aux5<=gi6.gu2.c7)")||(X(X(X(X(F(("(gi6.gu9.out1<=gi6.gu9.out4)")||(G(F("(gu3.out3<3)"))))))))))))
Formula 0 simplified : F(!"(gi6.gu2.aux5<=gi6.gu2.c7)" & XXXXG(!"(gi6.gu9.out1<=gi6.gu9.out4)" & FG!"(gu3.out3<3)"))
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin7696450926557758426;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X(X(<>(((LTLAPp1==true)||[](<>((LTLAPp2==true)))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X(X(<>(((LTLAPp1==true)||[](<>((LTLAPp2==true)))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '(<>([](((LTLAPp5==true)||((LTLAPp6==true) U (LTLAPp7==true))))) U ((LTLAPp8==true)||[]((LTLAPp9==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '(<>([](((LTLAPp5==true)||((LTLAPp6==true) U (LTLAPp7==true))))) U ((LTLAPp8==true)||[]((LTLAPp9==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(<>(([]((LTLAPp10==true))&&((LTLAPp11==true)||[]((LTLAPp12==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(<>(([]((LTLAPp10==true))&&((LTLAPp11==true)||[]((LTLAPp12==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(<>((X(((LTLAPp13==true)||X((LTLAPp14==true))))&&((LTLAPp15==true) U !(LTLAPp13==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(<>((X(((LTLAPp13==true)||X((LTLAPp14==true))))&&((LTLAPp15==true) U !(LTLAPp13==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp16==true)&&(<>((LTLAPp17==true)) U (LTLAPp18==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp16==true)&&(<>((LTLAPp17==true)) U (LTLAPp18==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X(X(<>(((LTLAPp1==true)||[](<>((LTLAPp2==true)))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 11:26:58] [INFO ] Applying decomposition
[2026-05-26 11:26:58] [INFO ] Flatten gal took : 46 ms
[2026-05-26 11:26:58] [INFO ] Decomposing Gal with order
[2026-05-26 11:26:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:26:58] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to c16 in partition

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-26 11:26:58] [INFO ] Flatten gal took : 16 ms
[2026-05-26 11:26:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality16909565127449436351.gal : 29 ms
[2026-05-26 11:26:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality11983565711036172049.ltl : 8 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16909565127449436351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11983565711036172049.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 6 LTL properties
Checking formula 0 : !((G(("(aux5<=c7)")||(X(X(X(X(F(("(out1<=out4)")||(G(F("(out3<3)"))))))))))))
Formula 0 simplified : F(!"(aux5<=c7)" & XXXXG(!"(out1<=out4)" & FG!"(out3<3)"))
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X(X(<>(((LTLAPp1==true)||[](<>((LTLAPp2==true)))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '(<>([](((LTLAPp5==true)||((LTLAPp6==true) U (LTLAPp7==true))))) U ((LTLAPp8==true)||[]((LTLAPp9==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 11:49:50] [INFO ] Flatten gal took : 12 ms
[2026-05-26 11:49:50] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:49:50] [INFO ] Transformed 35 places.
[2026-05-26 11:49:50] [INFO ] Transformed 16 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-26 11:49:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality1410295256695478697.gal : 3 ms
[2026-05-26 11:49:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality10554297194343046360.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1410295256695478697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10554297194343046360.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 6 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(aux5<=c7)")||(X(X(X(X(F(("(out1<=out4)")||(G(F("(out3<3)"))))))))))))
Formula 0 simplified : F(!"(aux5<=c7)" & XXXXG(!"(out1<=out4)" & FG!"(out3<3)"))
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '(<>([](((LTLAPp5==true)||((LTLAPp6==true) U (LTLAPp7==true))))) U ((LTLAPp8==true)||[]((LTLAPp9==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7696450926557758426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(<>(([]((LTLAPp10==true))&&((LTLAPp11==true)||[]((LTLAPp12==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="PermAdmissibility-COL-50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-COL-50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914200595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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