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.r034-tall-177946841800252.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 BridgeAndVehicles-PT-V50P50N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841800252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 23K Mar 5 08:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 5 08:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 134K Mar 5 08:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 539K Mar 5 08:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Mar 15 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 15 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 63K Mar 15 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K Mar 15 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 57K Mar 5 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 336K Mar 5 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 322K Mar 5 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Mar 5 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Mar 15 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 BridgeAndVehicles-PT-V50P50N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779553328152

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 16:22:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 16:22:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:22:09] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2026-05-23 16:22:09] [INFO ] Transformed 128 places.
[2026-05-23 16:22:09] [INFO ] Transformed 1328 transitions.
[2026-05-23 16:22:09] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 34 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2026-05-23 16:22:10] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14858995072583631812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8362500117754601058.kers'
[2026-05-23 16:22:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14858995072583631812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8362500117754601058.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 126 cols 1288 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-23 16:22:10] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8362500117754601058.kers
Total runtime 2 ms.
[2026-05-23 16:22:10] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 7 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 250/376 variables, 126/133 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 22/155 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1277 constraints, problems are : Problem set: 102 solved, 1223 unsolved in 21382 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1223/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43736ms problems are : Problem set: 102 solved, 1223 unsolved
Search for dead transitions found 102 dead transitions in 43770ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
[2026-05-23 16:22:53] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18085844842626599957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4601676036351722742.kers'
[2026-05-23 16:22:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18085844842626599957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4601676036351722742.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 16:22:53] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4601676036351722742.kers
Total runtime 4 ms.
[2026-05-23 16:22:53] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 16:22:53] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:22:53] [INFO ] Invariant cache hit.
[2026-05-23 16:22:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:22:53] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1226/1328 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44029 ms. Remains : 126/128 places, 1226/1328 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2026-05-23 16:22:54] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:22:54] [INFO ] Invariant cache hit.
[2026-05-23 16:22:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1276 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42634ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 42637ms
[2026-05-23 16:23:36] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:23:36] [INFO ] Invariant cache hit.
[2026-05-23 16:23:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 16:23:36] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:23:36] [INFO ] Invariant cache hit.
[2026-05-23 16:23:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:23:36] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 42784 ms. Remains : 126/126 places, 1226/1226 transitions.
Support contains 126 out of 126 places after structural reductions.
[2026-05-23 16:23:37] [INFO ] Flatten gal took : 149 ms
[2026-05-23 16:23:37] [INFO ] Flatten gal took : 143 ms
[2026-05-23 16:23:37] [INFO ] Input system was already deterministic with 1226 transitions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40001 steps (88 resets) in 2289 ms. (17 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40004 steps (36 resets) in 188 ms. (211 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (36 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (36 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
[2026-05-23 16:23:38] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:23:38] [INFO ] Invariant cache hit.
[2026-05-23 16:23:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 115/121 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/365 variables, 121/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/372 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 115/121 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/365 variables, 121/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/372 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 278 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 121 transition count 1222
Applied a total of 9 rules in 227 ms. Remains 121 /126 variables (removed 5) and now considering 1222/1226 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 121/126 places, 1222/1226 transitions.
RANDOM walk for 40000 steps (127 resets) in 1427 ms. (28 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (63 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
[2026-05-23 16:23:40] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18048056603091702599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5729892193798560952.kers'
[2026-05-23 16:23:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18048056603091702599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5729892193798560952.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 1068 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-05-23 16:23:40] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5729892193798560952.kers
Total runtime 1 ms.
[2026-05-23 16:23:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/361 variables, 119/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/363 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/363 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/361 variables, 119/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/363 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/363 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1222/1222 transitions.
Applied a total of 0 rules in 67 ms. Remains 121 /121 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 121/121 places, 1222/1222 transitions.
RANDOM walk for 40000 steps (125 resets) in 430 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (64 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 558455 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 558455 steps, saw 163808 distinct states, run finished after 3006 ms. (steps per millisecond=185 ) properties seen :0
[2026-05-23 16:23:44] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:23:44] [INFO ] Invariant cache hit.
[2026-05-23 16:23:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/361 variables, 119/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/363 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/363 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/361 variables, 119/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/363 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/363 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 694ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1222/1222 transitions.
Applied a total of 0 rules in 69 ms. Remains 121 /121 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 121/121 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1222/1222 transitions.
Applied a total of 0 rules in 49 ms. Remains 121 /121 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2026-05-23 16:23:45] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:23:45] [INFO ] Invariant cache hit.
[2026-05-23 16:23:46] [INFO ] Implicit Places using invariants in 279 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 284 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/121 places, 1222/1222 transitions.
Applied a total of 0 rules in 53 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 386 ms. Remains : 119/121 places, 1222/1222 transitions.
RANDOM walk for 40000 steps (127 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (64 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 623757 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 1
Probabilistic random walk after 623757 steps, saw 181056 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
[2026-05-23 16:23:49] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17909343097157762638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12328622703726550738.kers'
[2026-05-23 16:23:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17909343097157762638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12328622703726550738.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 119 cols 868 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-23 16:23:49] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12328622703726550738.kers
Total runtime 3 ms.
[2026-05-23 16:23:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/359 variables, 117/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/361 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/359 variables, 117/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/361 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 844ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 52 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 119/119 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 55 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2026-05-23 16:23:50] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:23:50] [INFO ] Invariant cache hit.
[2026-05-23 16:23:50] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-23 16:23:50] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:23:50] [INFO ] Invariant cache hit.
[2026-05-23 16:23:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:23:50] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2026-05-23 16:23:50] [INFO ] Redundant transitions in 65 ms returned []
Running 1219 sub problems to find dead transitions.
[2026-05-23 16:23:50] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:23:50] [INFO ] Invariant cache hit.
[2026-05-23 16:23:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1218/1361 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 1361 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61868ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 61871ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62720 ms. Remains : 119/119 places, 1222/1222 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 119 transition count 242
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 982 place count 119 transition count 240
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 984 place count 117 transition count 240
Applied a total of 984 rules in 12 ms. Remains 117 /119 variables (removed 2) and now considering 240/1222 (removed 982) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11191182124669420850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11255049965580452183.kers'
[2026-05-23 16:24:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11191182124669420850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11255049965580452183.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 240 rows 117 cols 860 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 16:24:52] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11255049965580452183.kers
Total runtime 1 ms.
[2026-05-23 16:24:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 16:24:52] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 16:24:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 16:24:53] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-23 16:24:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 16:24:53] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 16:24:53] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 16:24:53] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 271 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 109 stabilizing places and 202 stable 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((X(X(X(p0)))&&(!p1 U (G((!p1||G(p2)))||(p3&&(!p1||G(p2))))))))'
Support contains 117 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2026-05-23 16:24:53] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17521733917509955661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12308344193359034582.kers'
[2026-05-23 16:24:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17521733917509955661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12308344193359034582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 16:24:53] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12308344193359034582.kers
Total runtime 1 ms.
[2026-05-23 16:24:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1276 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42768ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 42771ms
[2026-05-23 16:25:36] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:25:36] [INFO ] Invariant cache hit.
[2026-05-23 16:25:36] [INFO ] Implicit Places using invariants in 90 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42884 ms. Remains : 125/126 places, 1226/1226 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((X(X(X(p0)))&&(!p1 U (G((!p1||G(p2)))||(p3&&(!p1||G(p2))))))))'
Stuttering acceptance computed with spot in 1933 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-00
Product exploration explored 100000 steps with 3258 reset in 3226 ms.
Product exploration explored 100000 steps with 3205 reset in 3135 ms.
Computed a total of 108 stabilizing places and 202 stable transitions
Computed a total of 108 stabilizing places and 202 stable transitions
Detected a total of 108/125 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 29 factoid took 2021 ms. Reduced automaton from 32 states, 160 edges and 4 AP (stutter sensitive) to 32 states, 160 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (88 resets) in 1787 ms. (22 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40003 steps (29 resets) in 912 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (29 resets) in 2391 ms. (16 steps per ms) remains 2/2 properties
[2026-05-23 16:25:48] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10205110982950026529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17046485313718538150.kers'
[2026-05-23 16:25:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10205110982950026529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17046485313718538150.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 125 cols 1176 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 16:25:48] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17046485313718538150.kers
Total runtime 1 ms.
[2026-05-23 16:25:48] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1036ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 383 ms.
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 45 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2026-05-23 16:25:49] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:25:49] [INFO ] Invariant cache hit.
[2026-05-23 16:25:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/371 variables, and 7 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1172 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/371 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1324 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21238 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1172 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42905ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 42908ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42957 ms. Remains : 125/125 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 709 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (31 resets) in 547 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (31 resets) in 2140 ms. (18 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 303761 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 2
Probabilistic random walk after 303761 steps, saw 83317 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2026-05-23 16:26:36] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:26:36] [INFO ] Invariant cache hit.
[2026-05-23 16:26:36] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1077ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 309 ms.
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 52 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 125/125 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 43 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2026-05-23 16:26:38] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:26:38] [INFO ] Invariant cache hit.
[2026-05-23 16:26:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 16:26:38] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:26:38] [INFO ] Invariant cache hit.
[2026-05-23 16:26:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:26:38] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2026-05-23 16:26:38] [INFO ] Redundant transitions in 17 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 125/125 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 125 transition count 246
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 984 place count 123 transition count 244
Applied a total of 984 rules in 7 ms. Remains 123 /125 variables (removed 2) and now considering 244/1226 (removed 982) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9786026216122569317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10857093003091860128.kers'
[2026-05-23 16:26:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9786026216122569317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10857093003091860128.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 123 cols 1172 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 16:26:38] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10857093003091860128.kers
Total runtime 4 ms.
[2026-05-23 16:26:38] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-23 16:26:38] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-23 16:26:38] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-23 16:26:38] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-23 16:26:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-23 16:26:39] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 16:26:39] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 16:26:39] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 455 ms.
Knowledge based reduction with 29 factoid took 2565 ms. Reduced automaton from 32 states, 160 edges and 4 AP (stutter sensitive) to 32 states, 160 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1820 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
[2026-05-23 16:26:43] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13896364217396976099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1114477969815950557.kers'
[2026-05-23 16:26:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13896364217396976099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1114477969815950557.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 125 cols 1176 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 16:26:43] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1114477969815950557.kers
Total runtime 5 ms.
[2026-05-23 16:26:50] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 16:26:51] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2026-05-23 16:26:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 16:26:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 16:26:59] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2026-05-23 16:26:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:26:59] [INFO ] [Nat]Added 20 Read/Feed constraints in 228 ms returned sat
[2026-05-23 16:26:59] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 44 ms.
[2026-05-23 16:27:01] [INFO ] Added : 56 causal constraints over 16 iterations in 1724 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 76508 ms.
Stuttering acceptance computed with spot in 1822 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 16:27:03] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:27:03] [INFO ] Invariant cache hit.
[2026-05-23 16:27:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 16:27:03] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:27:03] [INFO ] Invariant cache hit.
[2026-05-23 16:27:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:27:03] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 125/125 places, 1226/1226 transitions.
Computed a total of 108 stabilizing places and 202 stable transitions
Computed a total of 108 stabilizing places and 202 stable transitions
Detected a total of 108/125 stabilizing places and 202/1226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 29 factoid took 1968 ms. Reduced automaton from 32 states, 160 edges and 4 AP (stutter sensitive) to 32 states, 160 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (88 resets) in 1322 ms. (30 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40002 steps (31 resets) in 429 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (31 resets) in 1715 ms. (23 steps per ms) remains 2/2 properties
[2026-05-23 16:27:06] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:27:06] [INFO ] Invariant cache hit.
[2026-05-23 16:27:06] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1076ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 347 ms.
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 41 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 125/125 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 561 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (29 resets) in 506 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (29 resets) in 2113 ms. (18 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 298068 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 298068 steps, saw 81782 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-23 16:27:12] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:27:12] [INFO ] Invariant cache hit.
[2026-05-23 16:27:12] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1071ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 314 ms.
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 41 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 125/125 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 40 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2026-05-23 16:27:13] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:27:13] [INFO ] Invariant cache hit.
[2026-05-23 16:27:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 16:27:13] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:27:13] [INFO ] Invariant cache hit.
[2026-05-23 16:27:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:27:13] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2026-05-23 16:27:13] [INFO ] Redundant transitions in 70 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 125/125 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 125 transition count 246
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 984 place count 123 transition count 244
Applied a total of 984 rules in 7 ms. Remains 123 /125 variables (removed 2) and now considering 244/1226 (removed 982) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7589329802335964482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9102604266109732192.kers'
[2026-05-23 16:27:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7589329802335964482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9102604266109732192.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 123 cols 1172 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 16:27:14] [INFO ] Computed 6 invariants in 3 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9102604266109732192.kers
Total runtime 4 ms.
[2026-05-23 16:27:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-23 16:27:14] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
TRAPS : Iteration 0
[2026-05-23 16:27:14] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-23 16:27:14] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2026-05-23 16:27:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-23 16:27:14] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 16:27:14] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 16:27:14] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 481 ms.
Knowledge based reduction with 29 factoid took 2701 ms. Reduced automaton from 32 states, 160 edges and 4 AP (stutter sensitive) to 32 states, 160 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1764 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
[2026-05-23 16:27:18] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5120360197137577038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17426329359253979893.kers'
[2026-05-23 16:27:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5120360197137577038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17426329359253979893.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 125 cols 1176 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 16:27:19] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17426329359253979893.kers
Total runtime 2 ms.
[2026-05-23 16:27:26] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 16:27:26] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2026-05-23 16:27:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 16:27:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 16:27:34] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2026-05-23 16:27:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:27:35] [INFO ] [Nat]Added 20 Read/Feed constraints in 225 ms returned sat
[2026-05-23 16:27:35] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 38 ms.
[2026-05-23 16:27:36] [INFO ] Added : 56 causal constraints over 16 iterations in 1689 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 33133 ms.
Stuttering acceptance computed with spot in 1858 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 1763 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 3342 reset in 7434 ms.
Product exploration explored 100000 steps with 3275 reset in 7420 ms.
Spot run failed in 76 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/ltsmin5304296713830182048
[2026-05-23 16:27:55] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5304296713830182048
Running compilation step : cd /tmp/ltsmin5304296713830182048;'/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 2814 ms.
Running link step : cd /tmp/ltsmin5304296713830182048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin5304296713830182048;'/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/stateBased15181134884022722691.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1226/1226 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 16:28:10] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:28:10] [INFO ] Invariant cache hit.
[2026-05-23 16:28:10] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 16:28:10] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:28:10] [INFO ] Invariant cache hit.
[2026-05-23 16:28:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:28:10] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 125/125 places, 1226/1226 transitions.
Built C files in :
/tmp/ltsmin6571029897913981781
[2026-05-23 16:28:10] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6571029897913981781
Running compilation step : cd /tmp/ltsmin6571029897913981781;'/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 2720 ms.
Running link step : cd /tmp/ltsmin6571029897913981781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6571029897913981781;'/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/stateBased5774852812090193296.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 16:28:26] [INFO ] Flatten gal took : 62 ms
[2026-05-23 16:28:26] [INFO ] Flatten gal took : 41 ms
[2026-05-23 16:28:26] [INFO ] Time to serialize gal into /tmp/LTL10243555717380978442.gal : 20 ms
[2026-05-23 16:28:26] [INFO ] Time to serialize properties into /tmp/LTL701146640169928467.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10243555717380978442.gal' '-t' 'CGAL' '-hoa' '/tmp/aut101168139424028179.hoa' '-atoms' '/tmp/LTL701146640169928467.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...316
Loading property file /tmp/LTL701146640169928467.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut101168139424028179.hoa
Detected timeout of ITS tools.
[2026-05-23 16:28:41] [INFO ] Flatten gal took : 39 ms
[2026-05-23 16:28:41] [INFO ] Flatten gal took : 35 ms
[2026-05-23 16:28:41] [INFO ] Time to serialize gal into /tmp/LTL357149746647451451.gal : 10 ms
[2026-05-23 16:28:41] [INFO ] Time to serialize properties into /tmp/LTL18059982939130331323.ltl : 11 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/LTL357149746647451451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18059982939130331323.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((X(X(X("(((((((((((((NB_ATTENTE_A_32>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_0>=1)&&(COMPTEUR_3>=1)))||(((NB_ATTENTE_A_35>=1)&&(C...63929
Formula 0 simplified : G(XXX!"(((((((((((((NB_ATTENTE_A_32>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_0>=1)&&(COMPTEUR_3>=1)))||(((NB_ATTENTE_A_35>=1)&&(CONTR...63902
Detected timeout of ITS tools.
[2026-05-23 16:28:56] [INFO ] Flatten gal took : 34 ms
[2026-05-23 16:28:56] [INFO ] Applying decomposition
[2026-05-23 16:28:56] [INFO ] Flatten gal took : 32 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/graph10507677091950792322.txt' '-o' '/tmp/graph10507677091950792322.bin' '-w' '/tmp/graph10507677091950792322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10507677091950792322.bin' '-l' '-1' '-v' '-w' '/tmp/graph10507677091950792322.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:28:56] [INFO ] Decomposing Gal with order
[2026-05-23 16:28:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:28:57] [INFO ] Removed a total of 2517 redundant transitions.
[2026-05-23 16:28:57] [INFO ] Flatten gal took : 516 ms
[2026-05-23 16:28:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 341 labels/synchronizations in 21 ms.
[2026-05-23 16:28:57] [INFO ] Time to serialize gal into /tmp/LTL553616111543325953.gal : 3 ms
[2026-05-23 16:28:57] [INFO ] Time to serialize properties into /tmp/LTL15505817624415936263.ltl : 7 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/LTL553616111543325953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15505817624415936263.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((F((X(X(X("(((((((((((((u2.NB_ATTENTE_A_32>=1)&&(u2.CONTROLEUR_2>=1))&&((u2.NB_ATTENTE_B_0>=1)&&(i2.u4.COMPTEUR_3>=1)))||(((u2.NB_AT...76553
Formula 0 simplified : G(XXX!"(((((((((((((u2.NB_ATTENTE_A_32>=1)&&(u2.CONTROLEUR_2>=1))&&((u2.NB_ATTENTE_B_0>=1)&&(i2.u4.COMPTEUR_3>=1)))||(((u2.NB_ATTENT...76526
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 finished in 258897 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 63 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 123 transition count 1224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 121 transition count 1222
Applied a total of 9 rules in 176 ms. Remains 121 /126 variables (removed 5) and now considering 1222/1226 (removed 4) transitions.
[2026-05-23 16:29:12] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9353160294154087627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4624368507897551828.kers'
[2026-05-23 16:29:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9353160294154087627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4624368507897551828.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 1068 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-05-23 16:29:12] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4624368507897551828.kers
Total runtime 1 ms.
[2026-05-23 16:29:12] [INFO ] Implicit Places using invariants in 233 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 234 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/126 places, 1222/1226 transitions.
Applied a total of 0 rules in 57 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 468 ms. Remains : 119/126 places, 1222/1226 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 32 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-01
Product exploration explored 100000 steps with 319 reset in 4628 ms.
Product exploration explored 100000 steps with 319 reset in 4623 ms.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 963 steps (3 resets) in 38 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Knowledge-based reduction took 249 ms.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 63 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 59 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2026-05-23 16:29:22] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17894429456361206187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1594567887098431144.kers'
[2026-05-23 16:29:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17894429456361206187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1594567887098431144.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 119 cols 868 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-23 16:29:22] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1594567887098431144.kers
Total runtime 3 ms.
[2026-05-23 16:29:22] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 16:29:22] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:29:22] [INFO ] Invariant cache hit.
[2026-05-23 16:29:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:29:23] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2026-05-23 16:29:23] [INFO ] Redundant transitions in 25 ms returned []
Running 1219 sub problems to find dead transitions.
[2026-05-23 16:29:23] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:29:23] [INFO ] Invariant cache hit.
[2026-05-23 16:29:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 143 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 2 (OVERLAPS) 242/361 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1218/1361 constraints. Problems are: Problem set: 0 solved, 1219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 1361 constraints, problems are : Problem set: 0 solved, 1219 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1219/1218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61971ms problems are : Problem set: 0 solved, 1219 unsolved
Search for dead transitions found 0 dead transitions in 61975ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62507 ms. Remains : 119/119 places, 1222/1222 transitions.
Computed a total of 104 stabilizing places and 200 stable transitions
Computed a total of 104 stabilizing places and 200 stable transitions
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 1568 steps (5 resets) in 56 ms. (27 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Knowledge-based reduction took 229 ms.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 319 reset in 4571 ms.
Product exploration explored 100000 steps with 319 reset in 4572 ms.
Built C files in :
/tmp/ltsmin14534318167346596752
[2026-05-23 16:30:34] [INFO ] Computing symmetric may disable matrix : 1222 transitions.
[2026-05-23 16:30:34] [INFO ] Computation of Complete disable matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:30:34] [INFO ] Computing symmetric may enable matrix : 1222 transitions.
[2026-05-23 16:30:34] [INFO ] Computation of Complete enable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:30:35] [INFO ] Computing Do-Not-Accords matrix : 1222 transitions.
[2026-05-23 16:30:35] [INFO ] Computation of Completed DNA matrix. took 80 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:30:35] [INFO ] Built C files in 729ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14534318167346596752
Running compilation step : cd /tmp/ltsmin14534318167346596752;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14534318167346596752;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14534318167346596752;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 63 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1222/1222 transitions.
Applied a total of 0 rules in 83 ms. Remains 119 /119 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2026-05-23 16:30:38] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:30:38] [INFO ] Invariant cache hit.
[2026-05-23 16:30:38] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 16:30:38] [INFO ] Flow matrix only has 242 transitions (discarded 980 similar events)
[2026-05-23 16:30:38] [INFO ] Invariant cache hit.
[2026-05-23 16:30:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:30:38] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2026-05-23 16:30:38] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 119/119 places, 1222/1222 transitions.
Built C files in :
/tmp/ltsmin14752902890791093212
[2026-05-23 16:30:38] [INFO ] Computing symmetric may disable matrix : 1222 transitions.
[2026-05-23 16:30:38] [INFO ] Computation of Complete disable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:30:38] [INFO ] Computing symmetric may enable matrix : 1222 transitions.
[2026-05-23 16:30:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:30:39] [INFO ] Computing Do-Not-Accords matrix : 1222 transitions.
[2026-05-23 16:30:39] [INFO ] Computation of Completed DNA matrix. took 76 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:30:39] [INFO ] Built C files in 611ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14752902890791093212
Running compilation step : cd /tmp/ltsmin14752902890791093212;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14752902890791093212;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14752902890791093212;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:30:42] [INFO ] Flatten gal took : 26 ms
[2026-05-23 16:30:42] [INFO ] Flatten gal took : 26 ms
[2026-05-23 16:30:42] [INFO ] Time to serialize gal into /tmp/LTL15335612650872585781.gal : 7 ms
[2026-05-23 16:30:42] [INFO ] Time to serialize properties into /tmp/LTL7064314519142807610.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/LTL15335612650872585781.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7480879102430777595.hoa' '-atoms' '/tmp/LTL7064314519142807610.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/LTL7064314519142807610.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7480879102430777595.hoa
Detected timeout of ITS tools.
[2026-05-23 16:30:57] [INFO ] Flatten gal took : 27 ms
[2026-05-23 16:30:57] [INFO ] Flatten gal took : 27 ms
[2026-05-23 16:30:57] [INFO ] Time to serialize gal into /tmp/LTL6862846979526846478.gal : 6 ms
[2026-05-23 16:30:57] [INFO ] Time to serialize properties into /tmp/LTL12909779722574440304.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6862846979526846478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12909779722574440304.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("(((((((((((((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_46<1)||(COMPTEUR_6<1)))&&(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1...45631
Formula 0 simplified : GF!"(((((((((((((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_46<1)||(COMPTEUR_6<1)))&&(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1...45625
Detected timeout of ITS tools.
[2026-05-23 16:31:12] [INFO ] Flatten gal took : 25 ms
[2026-05-23 16:31:12] [INFO ] Applying decomposition
[2026-05-23 16:31:12] [INFO ] Flatten gal took : 25 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/graph8251607409567039404.txt' '-o' '/tmp/graph8251607409567039404.bin' '-w' '/tmp/graph8251607409567039404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8251607409567039404.bin' '-l' '-1' '-v' '-w' '/tmp/graph8251607409567039404.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:31:12] [INFO ] Decomposing Gal with order
[2026-05-23 16:31:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:31:13] [INFO ] Removed a total of 2586 redundant transitions.
[2026-05-23 16:31:13] [INFO ] Flatten gal took : 194 ms
[2026-05-23 16:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 16 ms.
[2026-05-23 16:31:13] [INFO ] Time to serialize gal into /tmp/LTL8314658723543539211.gal : 2 ms
[2026-05-23 16:31:13] [INFO ] Time to serialize properties into /tmp/LTL13725311609813950039.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8314658723543539211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13725311609813950039.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((((((u4.NB_ATTENTE_A_0<1)||(u4.CONTROLEUR_1<1))||((u4.NB_ATTENTE_B_46<1)||(i0.u2.COMPTEUR_6<1)))&&(((u4.NB_ATTENTE_A_0...53881
Formula 0 simplified : GF!"(((((((((((((u4.NB_ATTENTE_A_0<1)||(u4.CONTROLEUR_1<1))||((u4.NB_ATTENTE_B_46<1)||(i0.u2.COMPTEUR_6<1)))&&(((u4.NB_ATTENTE_A_0<1...53875
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-01 finished in 135791 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 U p1))))'
Support contains 55 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 80 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:31:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11607067476492112740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14391762664353100828.kers'
[2026-05-23 16:31:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11607067476492112740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14391762664353100828.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 124 cols 1173 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-23 16:31:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14391762664353100828.kers
Total runtime 4 ms.
[2026-05-23 16:31:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1274 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21141 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42659ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42662ms
[2026-05-23 16:32:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:32:11] [INFO ] Invariant cache hit.
[2026-05-23 16:32:11] [INFO ] Implicit Places using invariants in 197 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 76 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43020 ms. Remains : 124/126 places, 1225/1226 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))))'
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-02
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-02 finished in 43171 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((G(p0)&&(p1||F(p2))))))'
Support contains 14 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2026-05-23 16:32:11] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13281722765690249110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4955198103017168581.kers'
[2026-05-23 16:32:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13281722765690249110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4955198103017168581.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 16:32:11] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4955198103017168581.kers
Total runtime 1 ms.
[2026-05-23 16:32:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1276 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21178 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42888ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 42891ms
[2026-05-23 16:32:54] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:32:54] [INFO ] Invariant cache hit.
[2026-05-23 16:32:54] [INFO ] Implicit Places using invariants in 246 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 248 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43153 ms. Remains : 124/126 places, 1226/1226 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((G(p0)&&(p1||F(p2))))))'
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-04 finished in 43396 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 66 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 62 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:32:54] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2294465025024511303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17713088156227950988.kers'
[2026-05-23 16:32:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2294465025024511303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17713088156227950988.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 124 cols 1173 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-23 16:32:54] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17713088156227950988.kers
Total runtime 2 ms.
[2026-05-23 16:32:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1274 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42483ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42485ms
[2026-05-23 16:33:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:33:37] [INFO ] Invariant cache hit.
[2026-05-23 16:33:37] [INFO ] Implicit Places using invariants in 151 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 157 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 76 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42783 ms. Remains : 123/126 places, 1225/1226 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 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-05
Product exploration explored 100000 steps with 1142 reset in 2664 ms.
Product exploration explored 100000 steps with 1144 reset in 2642 ms.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 140 steps (0 resets) in 10 ms. (12 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 196 ms.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 66 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 53 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:33:43] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7642025601180311798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10967923517890648206.kers'
[2026-05-23 16:33:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7642025601180311798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10967923517890648206.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 973 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 16:33:43] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10967923517890648206.kers
Total runtime 2 ms.
[2026-05-23 16:33:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21262 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42742ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42746ms
[2026-05-23 16:34:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:34:26] [INFO ] Invariant cache hit.
[2026-05-23 16:34:26] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-23 16:34:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:34:26] [INFO ] Invariant cache hit.
[2026-05-23 16:34:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:34:26] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2026-05-23 16:34:26] [INFO ] Redundant transitions in 13 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43227 ms. Remains : 123/123 places, 1225/1225 transitions.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Knowledge based reduction with 3 factoid took 44 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 183 steps (0 resets) in 11 ms. (15 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 185 ms.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1154 reset in 2612 ms.
Product exploration explored 100000 steps with 1198 reset in 2614 ms.
Built C files in :
/tmp/ltsmin16251142194510919493
[2026-05-23 16:34:32] [INFO ] Computing symmetric may disable matrix : 1225 transitions.
[2026-05-23 16:34:32] [INFO ] Computation of Complete disable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:32] [INFO ] Computing symmetric may enable matrix : 1225 transitions.
[2026-05-23 16:34:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:32] [INFO ] Computing Do-Not-Accords matrix : 1225 transitions.
[2026-05-23 16:34:32] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:32] [INFO ] Built C files in 615ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16251142194510919493
Running compilation step : cd /tmp/ltsmin16251142194510919493;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16251142194510919493;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16251142194510919493;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 66 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 53 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 16:34:35] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:34:35] [INFO ] Invariant cache hit.
[2026-05-23 16:34:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 16:34:35] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:34:35] [INFO ] Invariant cache hit.
[2026-05-23 16:34:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:34:36] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2026-05-23 16:34:36] [INFO ] Redundant transitions in 13 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 466 ms. Remains : 123/123 places, 1225/1225 transitions.
Built C files in :
/tmp/ltsmin12659584136173922483
[2026-05-23 16:34:36] [INFO ] Computing symmetric may disable matrix : 1225 transitions.
[2026-05-23 16:34:36] [INFO ] Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:36] [INFO ] Computing symmetric may enable matrix : 1225 transitions.
[2026-05-23 16:34:36] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:36] [INFO ] Computing Do-Not-Accords matrix : 1225 transitions.
[2026-05-23 16:34:36] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:36] [INFO ] Built C files in 599ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12659584136173922483
Running compilation step : cd /tmp/ltsmin12659584136173922483;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12659584136173922483;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12659584136173922483;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:34:39] [INFO ] Flatten gal took : 22 ms
[2026-05-23 16:34:39] [INFO ] Flatten gal took : 21 ms
[2026-05-23 16:34:39] [INFO ] Time to serialize gal into /tmp/LTL9568486666304600844.gal : 7 ms
[2026-05-23 16:34:39] [INFO ] Time to serialize properties into /tmp/LTL15863875788548448101.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9568486666304600844.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16074343979355750082.hoa' '-atoms' '/tmp/LTL15863875788548448101.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/LTL15863875788548448101.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16074343979355750082.hoa
Detected timeout of ITS tools.
[2026-05-23 16:34:55] [INFO ] Flatten gal took : 23 ms
[2026-05-23 16:34:55] [INFO ] Flatten gal took : 23 ms
[2026-05-23 16:34:55] [INFO ] Time to serialize gal into /tmp/LTL4963271877589445935.gal : 6 ms
[2026-05-23 16:34:55] [INFO ] Time to serialize properties into /tmp/LTL6075401700727815414.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4963271877589445935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6075401700727815414.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(F("(((((((((((((NB_ATTENTE_A_32<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_0<1)||(COMPTEUR_3<1)))&&(((NB_ATTENTE_A_35<1)||(CONTROLEUR_...45699
Formula 0 simplified : FG!"(((((((((((((NB_ATTENTE_A_32<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_0<1)||(COMPTEUR_3<1)))&&(((NB_ATTENTE_A_35<1)||(CONTROLEUR_2<...45693
Detected timeout of ITS tools.
[2026-05-23 16:35:10] [INFO ] Flatten gal took : 23 ms
[2026-05-23 16:35:10] [INFO ] Applying decomposition
[2026-05-23 16:35:10] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7891407648138691481.txt' '-o' '/tmp/graph7891407648138691481.bin' '-w' '/tmp/graph7891407648138691481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7891407648138691481.bin' '-l' '-1' '-v' '-w' '/tmp/graph7891407648138691481.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:35:10] [INFO ] Decomposing Gal with order
[2026-05-23 16:35:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:35:10] [INFO ] Removed a total of 2176 redundant transitions.
[2026-05-23 16:35:10] [INFO ] Flatten gal took : 191 ms
[2026-05-23 16:35:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 7 ms.
[2026-05-23 16:35:10] [INFO ] Time to serialize gal into /tmp/LTL13136415411407785901.gal : 2 ms
[2026-05-23 16:35:10] [INFO ] Time to serialize properties into /tmp/LTL11143324263089621775.ltl : 21 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/LTL13136415411407785901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11143324263089621775.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((((i0.u3.NB_ATTENTE_A_32<1)||(i0.u3.CONTROLEUR_2<1))||((i0.u3.NB_ATTENTE_B_0<1)||(i0.u5.COMPTEUR_3<1)))&&(((i0.u3.NB...58914
Formula 0 simplified : FG!"(((((((((((((i0.u3.NB_ATTENTE_A_32<1)||(i0.u3.CONTROLEUR_2<1))||((i0.u3.NB_ATTENTE_B_0<1)||(i0.u5.COMPTEUR_3<1)))&&(((i0.u3.NB_A...58908
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-05 finished in 150863 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(p0)))||G(p1)))'
Support contains 54 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2026-05-23 16:35:25] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16667954630893501801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11418889482321146234.kers'
[2026-05-23 16:35:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16667954630893501801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11418889482321146234.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 16:35:25] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11418889482321146234.kers
Total runtime 1 ms.
[2026-05-23 16:35:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1276 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21180 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43000ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 43002ms
[2026-05-23 16:36:08] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:36:08] [INFO ] Invariant cache hit.
[2026-05-23 16:36:08] [INFO ] Implicit Places using invariants in 177 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43200 ms. Remains : 125/126 places, 1226/1226 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(p0)))||G(p1)))'
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-06 finished in 43569 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((G(p0)||G(!p0)))&&(G(p1)||F(!p2))))'
Support contains 67 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 16:36:09] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:36:09] [INFO ] Invariant cache hit.
[2026-05-23 16:36:09] [INFO ] Implicit Places using invariants in 151 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 124/126 places, 1226/1226 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((G(p0)||G(!p0)))&&(G(p1)||F(p2))))'
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), p0, true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-07 finished in 451 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(G((G(p2)||p1)))))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 12 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:36:09] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17864995802457046161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17503898609113756550.kers'
[2026-05-23 16:36:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17864995802457046161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17503898609113756550.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 245 rows 124 cols 1173 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-23 16:36:09] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17503898609113756550.kers
Total runtime 3 ms.
[2026-05-23 16:36:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1274 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21084 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42670ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42672ms
[2026-05-23 16:36:52] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:36:52] [INFO ] Invariant cache hit.
[2026-05-23 16:36:52] [INFO ] Implicit Places using invariants in 266 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 268 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42966 ms. Remains : 123/126 places, 1225/1226 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(G((G(p2)||p1)))))'
Stuttering acceptance computed with spot in 257 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1043 steps with 2 reset in 8 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-08 finished in 43258 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((X(p0)||p1)))||(X(p1) U p2)))'
Support contains 10 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 12 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 16:36:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:36:53] [INFO ] Invariant cache hit.
[2026-05-23 16:36:53] [INFO ] Implicit Places using invariants in 194 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 124/126 places, 1225/1226 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((X(p0)||p1)))||(X(p1) U p2)))'
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-09
Product exploration explored 100000 steps with 24980 reset in 506 ms.
Product exploration explored 100000 steps with 24957 reset in 605 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Knowledge based reduction with 9 factoid took 54 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (88 resets) in 369 ms. (108 steps per ms) remains 1/3 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 64 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 314 ms.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 8 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:36:54] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9200521937290049257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-223636781401215745.kers'
[2026-05-23 16:36:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9200521937290049257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-223636781401215745.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 123 cols 1073 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 16:36:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-223636781401215745.kers
Total runtime 1 ms.
[2026-05-23 16:36:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1322 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21243 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43057ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 43059ms
[2026-05-23 16:37:37] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:37:37] [INFO ] Invariant cache hit.
[2026-05-23 16:37:38] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-23 16:37:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:37:38] [INFO ] Invariant cache hit.
[2026-05-23 16:37:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:37:38] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 43808 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Knowledge based reduction with 7 factoid took 56 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40001 steps (88 resets) in 308 ms. (129 steps per ms) remains 1/3 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 323 ms.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33184 reset in 511 ms.
Product exploration explored 100000 steps with 33369 reset in 494 ms.
Spot run failed in 46 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/ltsmin9879277361893599579
[2026-05-23 16:37:40] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9879277361893599579
Running compilation step : cd /tmp/ltsmin9879277361893599579;'/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 2351 ms.
Running link step : cd /tmp/ltsmin9879277361893599579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9879277361893599579;'/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/stateBased4203825534172188588.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 16:37:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:37:55] [INFO ] Invariant cache hit.
[2026-05-23 16:37:55] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-23 16:37:55] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:37:55] [INFO ] Invariant cache hit.
[2026-05-23 16:37:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:37:56] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 124/124 places, 1225/1225 transitions.
Built C files in :
/tmp/ltsmin3340515792969612456
[2026-05-23 16:37:56] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3340515792969612456
Running compilation step : cd /tmp/ltsmin3340515792969612456;'/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 2457 ms.
Running link step : cd /tmp/ltsmin3340515792969612456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3340515792969612456;'/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/stateBased6497451446160868333.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 16:38:11] [INFO ] Flatten gal took : 21 ms
[2026-05-23 16:38:11] [INFO ] Flatten gal took : 21 ms
[2026-05-23 16:38:11] [INFO ] Time to serialize gal into /tmp/LTL16863508093308474704.gal : 7 ms
[2026-05-23 16:38:11] [INFO ] Time to serialize properties into /tmp/LTL8527368355576337801.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/LTL16863508093308474704.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11892865187606267907.hoa' '-atoms' '/tmp/LTL8527368355576337801.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/LTL8527368355576337801.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11892865187606267907.hoa
Detected timeout of ITS tools.
[2026-05-23 16:38:26] [INFO ] Flatten gal took : 19 ms
[2026-05-23 16:38:26] [INFO ] Flatten gal took : 19 ms
[2026-05-23 16:38:26] [INFO ] Time to serialize gal into /tmp/LTL8403033971054698290.gal : 6 ms
[2026-05-23 16:38:26] [INFO ] Time to serialize properties into /tmp/LTL68837052230025037.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/LTL8403033971054698290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL68837052230025037.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...273
Read 1 LTL properties
Checking formula 0 : !(((F(G((X("(((CAPACITE<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_44<1)||(ATTENTE_B<1)))"))||("(((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&...382
Formula 0 simplified : !"(((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&((NB_ATTENTE_B_20>=1)&&(COMPTEUR_8>=1)))" & X(GF(!"(((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1...462
Detected timeout of ITS tools.
[2026-05-23 16:38:41] [INFO ] Flatten gal took : 21 ms
[2026-05-23 16:38:41] [INFO ] Applying decomposition
[2026-05-23 16:38:41] [INFO ] Flatten gal took : 19 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/graph17368495279708443538.txt' '-o' '/tmp/graph17368495279708443538.bin' '-w' '/tmp/graph17368495279708443538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17368495279708443538.bin' '-l' '-1' '-v' '-w' '/tmp/graph17368495279708443538.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:38:41] [INFO ] Decomposing Gal with order
[2026-05-23 16:38:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:38:41] [INFO ] Removed a total of 2317 redundant transitions.
[2026-05-23 16:38:41] [INFO ] Flatten gal took : 184 ms
[2026-05-23 16:38:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 370 labels/synchronizations in 11 ms.
[2026-05-23 16:38:41] [INFO ] Time to serialize gal into /tmp/LTL352525616265076005.gal : 1 ms
[2026-05-23 16:38:41] [INFO ] Time to serialize properties into /tmp/LTL16173939506915617937.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/LTL352525616265076005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16173939506915617937.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !(((F(G((X("(((i1.u0.CAPACITE<1)||(u1.CONTROLEUR_2<1))||((i2.u2.NB_ATTENTE_B_44<1)||(i1.u3.ATTENTE_B<1)))"))||("(((i2.u2.NB_ATTENTE_A_...475
Formula 0 simplified : !"(((i2.u2.NB_ATTENTE_A_0>=1)&&(i2.u2.CONTROLEUR_1>=1))&&((i2.u2.NB_ATTENTE_B_20>=1)&&(i2.u4.COMPTEUR_8>=1)))" & X(GF(!"(((i2.u2.NB_...579
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-09 finished in 123728 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((X((X(p0) U ((X(p0)&&G(!p1))||X(G(p0))))) U (G(p3)&&p2))))'
Support contains 10 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2026-05-23 16:38:56] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12787531371013670176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13769328307430429153.kers'
[2026-05-23 16:38:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12787531371013670176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13769328307430429153.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 16:38:56] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13769328307430429153.kers
Total runtime 2 ms.
[2026-05-23 16:38:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1276 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21293 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42920ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 42923ms
[2026-05-23 16:39:39] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2026-05-23 16:39:39] [INFO ] Invariant cache hit.
[2026-05-23 16:39:39] [INFO ] Implicit Places using invariants in 204 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43151 ms. Remains : 125/126 places, 1226/1226 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((X((X(p0) U (X(G(p0))||(X(p0)&&G(!p1))))) U (G(p3)&&p2))))'
Stuttering acceptance computed with spot in 445 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p0)), true, (AND (NOT p3) p0), (AND p1 p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 25 steps with 3 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-10 finished in 43676 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(G(p0)))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 14 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:39:40] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6898635055306906797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3565700662043394572.kers'
[2026-05-23 16:39:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6898635055306906797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3565700662043394572.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 124 cols 1173 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-23 16:39:40] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3565700662043394572.kers
Total runtime 3 ms.
[2026-05-23 16:39:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1274 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21107 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42657ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42659ms
[2026-05-23 16:40:23] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:40:23] [INFO ] Invariant cache hit.
[2026-05-23 16:40:23] [INFO ] Implicit Places using invariants in 238 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42923 ms. Remains : 124/126 places, 1225/1226 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(G(p0)))'
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-11 finished in 43067 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((F(p0)||(G(p1) U (G(p1)&&p2)))))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 12 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 16:40:23] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:40:23] [INFO ] Invariant cache hit.
[2026-05-23 16:40:23] [INFO ] Implicit Places using invariants in 264 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 266 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 1225/1226 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 288 ms. Remains : 123/126 places, 1225/1226 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((F(p0)||(G(p1) U (G(p1)&&p2)))))'
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 493 ms.
Product exploration explored 100000 steps with 50000 reset in 498 ms.
Computed a total of 106 stabilizing places and 201 stable transitions
Computed a total of 106 stabilizing places and 201 stable transitions
Detected a total of 106/123 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 16 factoid took 14 ms. Proved property starting from automaton with 4 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-12 finished in 1503 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((X(X(X(p0)))&&(!p1 U (G((!p1||G(p2)))||(p3&&(!p1||G(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.
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)))'
Spot run failed in 45 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(p0)))'
Spot run failed in 43 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((X(p0)||p1)))||(X(p1) U p2)))'
Spot run failed in 43 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-23 16:40:25] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4477100351631778361
[2026-05-23 16:40:25] [INFO ] Computing symmetric may disable matrix : 1226 transitions.
[2026-05-23 16:40:25] [INFO ] Applying decomposition
[2026-05-23 16:40:25] [INFO ] Computation of Complete disable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:40:25] [INFO ] Flatten gal took : 45 ms
[2026-05-23 16:40:25] [INFO ] Computing symmetric may enable matrix : 1226 transitions.
[2026-05-23 16:40:25] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph10573991388783206022.txt' '-o' '/tmp/graph10573991388783206022.bin' '-w' '/tmp/graph10573991388783206022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10573991388783206022.bin' '-l' '-1' '-v' '-w' '/tmp/graph10573991388783206022.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:40:25] [INFO ] Decomposing Gal with order
[2026-05-23 16:40:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:40:25] [INFO ] Removed a total of 2675 redundant transitions.
[2026-05-23 16:40:25] [INFO ] Flatten gal took : 220 ms
[2026-05-23 16:40:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 390 labels/synchronizations in 9 ms.
[2026-05-23 16:40:25] [INFO ] Time to serialize gal into /tmp/LTLFireability17120026523606615978.gal : 1 ms
[2026-05-23 16:40:25] [INFO ] Time to serialize properties into /tmp/LTLFireability1568980597728300539.ltl : 9 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/LTLFireability17120026523606615978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1568980597728300539.ltl' '-c' '-stutter-deadlock'

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 4 LTL properties
Checking formula 0 : !((F((X(X(X("(((((((((((((u0.NB_ATTENTE_A_32>=1)&&(i1.u1.CONTROLEUR_2>=1))&&((i1.u1.NB_ATTENTE_B_0>=1)&&(i1.u4.COMPTEUR_3>=1)))||(((u0...80120
Formula 0 simplified : G(XXX!"(((((((((((((u0.NB_ATTENTE_A_32>=1)&&(i1.u1.CONTROLEUR_2>=1))&&((i1.u1.NB_ATTENTE_B_0>=1)&&(i1.u4.COMPTEUR_3>=1)))||(((u0.NB_...80093
[2026-05-23 16:40:26] [INFO ] Computing Do-Not-Accords matrix : 1226 transitions.
[2026-05-23 16:40:26] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:40:26] [INFO ] Built C files in 868ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4477100351631778361
Running compilation step : cd /tmp/ltsmin4477100351631778361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' '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 6758 ms.
Running link step : cd /tmp/ltsmin4477100351631778361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin4477100351631778361;'/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((LTLAPp0==true))))&&(!(LTLAPp1==true) U ([]((!(LTLAPp1==true)||[]((LTLAPp2==true))))||((LTLAPp3==true)&&(!(LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4477100351631778361;'/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((LTLAPp0==true))))&&(!(LTLAPp1==true) U ([]((!(LTLAPp1==true)||[]((LTLAPp2==true))))||((LTLAPp3==true)&&(!(LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4477100351631778361;'/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)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4477100351631778361;'/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)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4477100351631778361;'/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)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4477100351631778361;'/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)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4477100351631778361;'/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((LTLAPp6==true))||(LTLAPp7==true))))||(X((LTLAPp7==true)) U (LTLAPp8==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4477100351631778361;'/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((LTLAPp6==true))||(LTLAPp7==true))))||(X((LTLAPp7==true)) U (LTLAPp8==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin4477100351631778361;'/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((LTLAPp0==true))))&&(!(LTLAPp1==true) U ([]((!(LTLAPp1==true)||[]((LTLAPp2==true))))||((LTLAPp3==true)&&(!(LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 318110 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4477100351631778361;'/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)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 17:06:31] [INFO ] Flatten gal took : 30 ms
[2026-05-23 17:06:31] [INFO ] Time to serialize gal into /tmp/LTLFireability5130511604397890845.gal : 7 ms
[2026-05-23 17:06:31] [INFO ] Time to serialize properties into /tmp/LTLFireability13197226484669795651.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5130511604397890845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13197226484669795651.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...298
Read 3 LTL properties
Checking formula 0 : !((F(G("(((((((((((((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_46<1)||(COMPTEUR_6<1)))&&(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1...45631
Formula 0 simplified : GF!"(((((((((((((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_46<1)||(COMPTEUR_6<1)))&&(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1...45625

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V50P50N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946841800252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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