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.r066-tall-177946967800531.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 CopsAndRobbers-PT-KFL036N009K002X003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967800531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 13:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 6 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 15 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 6 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779536854151

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-KFL036N009K002X003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 11:47:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 11:47:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 11:47:35] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2026-05-23 11:47:35] [INFO ] Transformed 186 places.
[2026-05-23 11:47:35] [INFO ] Transformed 1623 transitions.
[2026-05-23 11:47:35] [INFO ] Parsed PT model containing 186 places and 1623 transitions and 9582 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 1623/1623 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 164 transition count 1623
Applied a total of 22 rules in 58 ms. Remains 164 /186 variables (removed 22) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15754881206244751401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13593217645793534116.kers'
[2026-05-23 11:47:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15754881206244751401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13593217645793534116.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1623 rows 128 cols 6298 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-23 11:47:35] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13593217645793534116.kers
Total runtime 6 ms.
[2026-05-23 11:47:35] [INFO ] State equation strengthened by 92 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1787 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20271 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/164 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1787 variables, and 347 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/164 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1518/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42761ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42800ms
[2026-05-23 11:48:18] [INFO ] Invariant cache hit.
[2026-05-23 11:48:18] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-23 11:48:18] [INFO ] Invariant cache hit.
[2026-05-23 11:48:19] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:48:20] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 164/186 places, 1623/1623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44833 ms. Remains : 164/186 places, 1623/1623 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Applied a total of 0 rules in 15 ms. Remains 164 /164 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 11:48:20] [INFO ] Invariant cache hit.
[2026-05-23 11:48:20] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-23 11:48:20] [INFO ] Invariant cache hit.
[2026-05-23 11:48:21] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:48:22] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1913 ms. Remains : 164/164 places, 1623/1623 transitions.
Support contains 54 out of 164 places after structural reductions.
[2026-05-23 11:48:22] [INFO ] Flatten gal took : 144 ms
[2026-05-23 11:48:22] [INFO ] Flatten gal took : 90 ms
[2026-05-23 11:48:23] [INFO ] Input system was already deterministic with 1623 transitions.
RANDOM walk for 40000 steps (529 resets) in 2330 ms. (17 steps per ms) remains 6/38 properties
BEST_FIRST walk for 40004 steps (36 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (35 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (45 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
[2026-05-23 11:48:23] [INFO ] Invariant cache hit.
[2026-05-23 11:48:23] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/48 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 3 (OVERLAPS) 32/80 variables, 32/38 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/38 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1555/1635 variables, 80/118 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1635 variables, 26/144 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1635 variables, 0/144 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 140/1775 variables, 72/216 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1775 variables, 66/282 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1775 variables, 0/282 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/1787 variables, 12/294 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1787 variables, 0/294 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1787 variables, 0/294 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1787/1787 variables, and 294 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 164/164 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/94 variables, 4/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 835/929 variables, 64/70 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 0/70 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/931 variables, 1/71 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/931 variables, 0/71 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 783/1714 variables, 21/92 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1714 variables, 92/184 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1714 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 73/1787 variables, 73/257 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1787 variables, 37/294 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1787 variables, 2/296 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1787 variables, 0/296 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1787 variables, 0/296 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1787/1787 variables, and 296 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 164/164 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3439ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Graph (complete) has 3576 edges and 164 vertex of which 152 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.6 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 152 transition count 1622
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 151 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 150 transition count 1621
Applied a total of 5 rules in 191 ms. Remains 150 /164 variables (removed 14) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8623135628948357501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10090522016863205792.kers'
[2026-05-23 11:48:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8623135628948357501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10090522016863205792.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1621 rows 114 cols 6270 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 11:48:27] [INFO ] Computed 38 invariants in 8 ms
Computed 38 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10090522016863205792.kers
Total runtime 10 ms.
[2026-05-23 11:48:27] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1769/1771 variables, and 278 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
SMT process timed out in 42147ms, After SMT, problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 42151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42347 ms. Remains : 150/164 places, 1621/1623 transitions.
RANDOM walk for 40000 steps (593 resets) in 1215 ms. (32 steps per ms) remains 0/2 properties
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 3864 edges and 164 vertex of which 150 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.7 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))))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 151 transition count 1623
Applied a total of 13 rules in 10 ms. Remains 151 /164 variables (removed 13) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18312932271335247831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14690327993676060771.kers'
[2026-05-23 11:49:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18312932271335247831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14690327993676060771.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1623 rows 115 cols 6272 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 11:49:10] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14690327993676060771.kers
Total runtime 6 ms.
[2026-05-23 11:49:10] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1774 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1774 variables, and 386 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1557/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42310ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42314ms
[2026-05-23 11:49:53] [INFO ] Invariant cache hit.
[2026-05-23 11:49:53] [INFO ] Implicit Places using invariants in 206 ms returned []
[2026-05-23 11:49:53] [INFO ] Invariant cache hit.
[2026-05-23 11:49:53] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:49:55] [INFO ] Implicit Places using invariants and state equation in 2415 ms returned []
Implicit Place search using SMT with State Equation took 2622 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 151/164 places, 1623/1623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44952 ms. Remains : 151/164 places, 1623/1623 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))))'
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-00
Product exploration explored 100000 steps with 1651 reset in 1265 ms.
Product exploration explored 100000 steps with 1631 reset in 1166 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 3825 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (545 resets) in 626 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (38 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384989 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 384989 steps, saw 107839 distinct states, run finished after 3006 ms. (steps per millisecond=128 ) properties seen :0
[2026-05-23 11:50:01] [INFO ] Invariant cache hit.
[2026-05-23 11:50:01] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 840/888 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/890 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/890 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 812/1702 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1702 variables, 92/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1702 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 72/1774 variables, 72/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1774 variables, 37/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1774 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1774 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1774/1774 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 151/151 constraints, ReadFeed: 92/92 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 840/888 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/890 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/890 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 812/1702 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1702 variables, 92/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1702 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/1774 variables, 72/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1774 variables, 37/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1774 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1774 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1774 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1774/1774 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 151/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 961ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 1623/1623 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 151 transition count 1622
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 149 transition count 1621
Applied a total of 4 rules in 121 ms. Remains 149 /151 variables (removed 2) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6587577477632215220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-624897494879202567.kers'
[2026-05-23 11:50:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6587577477632215220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-624897494879202567.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 1 ms.
// Phase 1: matrix 1621 rows 113 cols 6268 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-23 11:50:02] [INFO ] Computed 38 invariants in 8 ms
Computed 38 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-624897494879202567.kers
Total runtime 11 ms.
[2026-05-23 11:50:02] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1769/1770 variables, and 278 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/149 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1770 variables, and 383 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/149 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1555/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42293ms problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 42297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42423 ms. Remains : 149/151 places, 1621/1623 transitions.
RANDOM walk for 36996 steps (593 resets) in 719 ms. (51 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 47168 ms.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 1623/1623 transitions.
Applied a total of 0 rules in 12 ms. Remains 151 /151 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4767064720378266666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6969349096510345011.kers'
[2026-05-23 11:50:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4767064720378266666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6969349096510345011.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1623 rows 115 cols 6272 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 11:50:45] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6969349096510345011.kers
Total runtime 6 ms.
[2026-05-23 11:50:45] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1774 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1774 variables, and 386 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1557/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42244ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42249ms
[2026-05-23 11:51:27] [INFO ] Invariant cache hit.
[2026-05-23 11:51:28] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-23 11:51:28] [INFO ] Invariant cache hit.
[2026-05-23 11:51:28] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:51:30] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 2597 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 44864 ms. Remains : 151/151 places, 1623/1623 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 3825 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 37632 steps (490 resets) in 445 ms. (84 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 412 ms.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1599 reset in 1126 ms.
Product exploration explored 100000 steps with 1622 reset in 1110 ms.
Spot run failed in 79 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/ltsmin4918086466213659606
[2026-05-23 11:51:33] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4918086466213659606
Running compilation step : cd /tmp/ltsmin4918086466213659606;'/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/ltsmin4918086466213659606;'/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/ltsmin4918086466213659606;'/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 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 1623/1623 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 11:51:36] [INFO ] Invariant cache hit.
[2026-05-23 11:51:36] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-23 11:51:36] [INFO ] Invariant cache hit.
[2026-05-23 11:51:37] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:51:39] [INFO ] Implicit Places using invariants and state equation in 2447 ms returned []
Implicit Place search using SMT with State Equation took 2640 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2646 ms. Remains : 151/151 places, 1623/1623 transitions.
Built C files in :
/tmp/ltsmin215372520502844746
[2026-05-23 11:51:39] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin215372520502844746
Running compilation step : cd /tmp/ltsmin215372520502844746;'/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/ltsmin215372520502844746;'/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/ltsmin215372520502844746;'/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 11:51:42] [INFO ] Flatten gal took : 55 ms
[2026-05-23 11:51:42] [INFO ] Flatten gal took : 52 ms
[2026-05-23 11:51:42] [INFO ] Time to serialize gal into /tmp/LTL10223686840936561623.gal : 21 ms
[2026-05-23 11:51:42] [INFO ] Time to serialize properties into /tmp/LTL4683177297805702465.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10223686840936561623.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18194234528815678664.hoa' '-atoms' '/tmp/LTL4683177297805702465.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/LTL4683177297805702465.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18194234528815678664.hoa
Detected timeout of ITS tools.
[2026-05-23 11:51:57] [INFO ] Flatten gal took : 84 ms
[2026-05-23 11:51:57] [INFO ] Flatten gal took : 40 ms
[2026-05-23 11:51:57] [INFO ] Time to serialize gal into /tmp/LTL8074357441446072683.gal : 13 ms
[2026-05-23 11:51:57] [INFO ] Time to serialize properties into /tmp/LTL1457803868378635435.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/LTL8074357441446072683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1457803868378635435.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 : !((X(X(G("(pl_end_n11<3)")))))
Formula 0 simplified : XXF!"(pl_end_n11<3)"
Detected timeout of ITS tools.
[2026-05-23 11:52:12] [INFO ] Flatten gal took : 46 ms
[2026-05-23 11:52:12] [INFO ] Applying decomposition
[2026-05-23 11:52:13] [INFO ] Flatten gal took : 38 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/graph3085646517951298793.txt' '-o' '/tmp/graph3085646517951298793.bin' '-w' '/tmp/graph3085646517951298793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3085646517951298793.bin' '-l' '-1' '-v' '-w' '/tmp/graph3085646517951298793.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:52:13] [INFO ] Decomposing Gal with order
[2026-05-23 11:52:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:52:13] [INFO ] Removed a total of 3022 redundant transitions.
[2026-05-23 11:52:14] [INFO ] Flatten gal took : 798 ms
[2026-05-23 11:52:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 828 labels/synchronizations in 79 ms.
[2026-05-23 11:52:14] [INFO ] Time to serialize gal into /tmp/LTL546062775847015316.gal : 13 ms
[2026-05-23 11:52:14] [INFO ] Time to serialize properties into /tmp/LTL6687416236908805444.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/LTL546062775847015316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6687416236908805444.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...253
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i5.u13.pl_end_n11<3)")))))
Formula 0 simplified : XXF!"(i5.u13.pl_end_n11<3)"
Detected timeout of ITS tools.
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-00 finished in 198597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X(G(p1)) U (p0&&X(G(p1))))))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Graph (complete) has 3864 edges and 164 vertex of which 151 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.12 ms
Discarding 13 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 151 transition count 1622
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 150 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 149 transition count 1621
Applied a total of 5 rules in 148 ms. Remains 149 /164 variables (removed 15) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13523182046388552126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12475882360301286077.kers'
[2026-05-23 11:52:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13523182046388552126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12475882360301286077.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 3 ms.
// Phase 1: matrix 1621 rows 113 cols 6268 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-23 11:52:29] [INFO ] Computed 38 invariants in 8 ms
Computed 38 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-12475882360301286077.kers
Total runtime 10 ms.
[2026-05-23 11:52:29] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1769/1770 variables, and 278 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/149 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1770 variables, and 383 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/149 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1555/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42191ms problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 42195ms
[2026-05-23 11:53:11] [INFO ] Invariant cache hit.
[2026-05-23 11:53:11] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-23 11:53:11] [INFO ] Invariant cache hit.
[2026-05-23 11:53:12] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:53:13] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
[2026-05-23 11:53:13] [INFO ] Redundant transitions in 89 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/164 places, 1621/1623 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44430 ms. Remains : 149/164 places, 1621/1623 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X(G(p1)) U (p0&&X(G(p1))))))))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-01
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-01 finished in 44506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&X(X(F(p2)))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 151 transition count 1623
Applied a total of 13 rules in 6 ms. Remains 151 /164 variables (removed 13) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12272301158448588008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12207446145449837979.kers'
[2026-05-23 11:53:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12272301158448588008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12207446145449837979.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 1 ms.
// Phase 1: matrix 1623 rows 115 cols 6272 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 11:53:13] [INFO ] Computed 38 invariants in 7 ms
Computed 38 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12207446145449837979.kers
Total runtime 10 ms.
[2026-05-23 11:53:13] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1774 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1774 variables, and 386 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20083 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1557/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42326ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42330ms
[2026-05-23 11:53:56] [INFO ] Invariant cache hit.
[2026-05-23 11:53:56] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-23 11:53:56] [INFO ] Invariant cache hit.
[2026-05-23 11:53:56] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:53:58] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 151/164 places, 1623/1623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44386 ms. Remains : 151/164 places, 1623/1623 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&X(X(F(p2)))))'
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-02
Stuttering criterion allowed to conclude after 196 steps with 1 reset in 5 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-02 finished in 44667 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((p0||X(F((p0&&X(F(p0))))))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 150 transition count 1623
Applied a total of 14 rules in 8 ms. Remains 150 /164 variables (removed 14) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15775118091420450791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8198756289200156305.kers'
[2026-05-23 11:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15775118091420450791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8198756289200156305.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1623 rows 114 cols 6270 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 11:53:58] [INFO ] Computed 38 invariants in 9 ms
Computed 38 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8198756289200156305.kers
Total runtime 14 ms.
[2026-05-23 11:53:58] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1773 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1773 variables, and 389 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42343ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42346ms
[2026-05-23 11:54:40] [INFO ] Invariant cache hit.
[2026-05-23 11:54:40] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-23 11:54:40] [INFO ] Invariant cache hit.
[2026-05-23 11:54:41] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:54:43] [INFO ] Implicit Places using invariants and state equation in 2226 ms returned []
Implicit Place search using SMT with State Equation took 2425 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 150/164 places, 1623/1623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44786 ms. Remains : 150/164 places, 1623/1623 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((p0||X(F((p0&&X(F(p0))))))))'
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 443 ms.
Product exploration explored 100000 steps with 50000 reset in 503 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 18 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 34 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-03 finished in 45995 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))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Graph (complete) has 3864 edges and 164 vertex of which 152 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.9 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 152 transition count 1622
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 151 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 150 transition count 1621
Applied a total of 5 rules in 96 ms. Remains 150 /164 variables (removed 14) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7730459149167991080.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10350026276989124942.kers'
[2026-05-23 11:54:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7730459149167991080.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10350026276989124942.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1621 rows 114 cols 6270 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 11:54:44] [INFO ] Computed 38 invariants in 11 ms
Computed 38 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10350026276989124942.kers
Total runtime 12 ms.
[2026-05-23 11:54:44] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1769/1771 variables, and 278 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1771 variables, and 380 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1552/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42294ms problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 42297ms
[2026-05-23 11:55:26] [INFO ] Invariant cache hit.
[2026-05-23 11:55:27] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-23 11:55:27] [INFO ] Invariant cache hit.
[2026-05-23 11:55:27] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:55:29] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned []
Implicit Place search using SMT with State Equation took 2944 ms to find 0 implicit places.
[2026-05-23 11:55:29] [INFO ] Redundant transitions in 91 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/164 places, 1621/1623 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45443 ms. Remains : 150/164 places, 1621/1623 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))'
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 87 steps with 2 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-05 finished in 45550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(G(p1)))) U X((p2&&X(!p0)))))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 150 transition count 1623
Applied a total of 14 rules in 5 ms. Remains 150 /164 variables (removed 14) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5706547961481480484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2888876708276964107.kers'
[2026-05-23 11:55:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5706547961481480484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2888876708276964107.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1623 rows 114 cols 6270 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 11:55:30] [INFO ] Computed 38 invariants in 9 ms
Computed 38 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-2888876708276964107.kers
Total runtime 14 ms.
[2026-05-23 11:55:30] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1773 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1773 variables, and 389 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42206ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42209ms
[2026-05-23 11:56:12] [INFO ] Invariant cache hit.
[2026-05-23 11:56:12] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-23 11:56:12] [INFO ] Invariant cache hit.
[2026-05-23 11:56:12] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:56:14] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 150/164 places, 1623/1623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44568 ms. Remains : 150/164 places, 1623/1623 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(G(p1)))) U X((p2&&X(!p0)))))'
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) p0), (AND (NOT p0) (NOT p2)), (OR (NOT p2) p0), (NOT p1), (NOT p0), p0]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-06
Stuttering criterion allowed to conclude after 223 steps with 0 reset in 4 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-06 finished in 44896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Graph (complete) has 3864 edges and 164 vertex of which 150 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.8 ms
Discarding 14 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 150 transition count 1622
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 149 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 148 transition count 1621
Applied a total of 5 rules in 145 ms. Remains 148 /164 variables (removed 16) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17674558173530018807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3948561611772899987.kers'
[2026-05-23 11:56:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17674558173530018807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3948561611772899987.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1621 rows 112 cols 6266 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-23 11:56:15] [INFO ] Computed 38 invariants in 10 ms
Computed 38 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-3948561611772899987.kers
Total runtime 13 ms.
[2026-05-23 11:56:15] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1769/1769 variables, and 278 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1769 variables, and 386 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42158ms problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 42162ms
[2026-05-23 11:56:57] [INFO ] Invariant cache hit.
[2026-05-23 11:56:57] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-23 11:56:57] [INFO ] Invariant cache hit.
[2026-05-23 11:56:57] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:56:59] [INFO ] Implicit Places using invariants and state equation in 2443 ms returned []
Implicit Place search using SMT with State Equation took 2640 ms to find 0 implicit places.
[2026-05-23 11:56:59] [INFO ] Redundant transitions in 33 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/164 places, 1621/1623 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44993 ms. Remains : 148/164 places, 1621/1623 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 37 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-08
Stuttering criterion allowed to conclude after 3928 steps with 66 reset in 77 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-08 finished in 45142 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||X(X(F(p1)))))) U (p2 U G(p3))))'
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 152 transition count 1623
Applied a total of 12 rules in 8 ms. Remains 152 /164 variables (removed 12) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12494478246417945963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5276405243353615683.kers'
[2026-05-23 11:57:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12494478246417945963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5276405243353615683.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1623 rows 116 cols 6274 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 11:57:00] [INFO ] Computed 38 invariants in 8 ms
Computed 38 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-5276405243353615683.kers
Total runtime 13 ms.
[2026-05-23 11:57:00] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1775 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1775 variables, and 383 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1554/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42220ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42223ms
[2026-05-23 11:57:42] [INFO ] Invariant cache hit.
[2026-05-23 11:57:42] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-23 11:57:42] [INFO ] Invariant cache hit.
[2026-05-23 11:57:42] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:57:44] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 1623/1623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44331 ms. Remains : 152/164 places, 1623/1623 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||X(X(F(p1)))))) U (p2 U G(p3))))'
Stuttering acceptance computed with spot in 422 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-11
Product exploration explored 100000 steps with 20068 reset in 543 ms.
Product exploration explored 100000 steps with 20059 reset in 612 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 3828 edges and 152 vertex of which 150 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 590 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40002 steps (488 resets) in 606 ms. (65 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40003 steps (41 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
[2026-05-23 11:57:46] [INFO ] Invariant cache hit.
[2026-05-23 11:57:46] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 837/1741 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1741 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1741 variables, 69/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1741 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 34/1775 variables, 17/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1775 variables, 17/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1775 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1775 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1775/1775 variables, and 282 constraints, problems are : Problem set: 0 solved, 4 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 152/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 837/1741 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1741 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1741 variables, 69/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1741 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1741 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 34/1775 variables, 17/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1775 variables, 17/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1775 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1775 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1775/1775 variables, and 286 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2295 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 152/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2853ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 2767 ms.
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 1623/1623 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 152 transition count 1622
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 150 transition count 1621
Applied a total of 4 rules in 83 ms. Remains 150 /152 variables (removed 2) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15800313379453795947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1732441703590421117.kers'
[2026-05-23 11:57:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15800313379453795947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1732441703590421117.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1621 rows 114 cols 6270 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 11:57:52] [INFO ] Computed 38 invariants in 10 ms
Computed 38 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-1732441703590421117.kers
Total runtime 14 ms.
[2026-05-23 11:57:52] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1769/1771 variables, and 278 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1771 variables, and 380 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20071 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1552/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42320ms problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 42323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42410 ms. Remains : 150/152 places, 1621/1623 transitions.
RANDOM walk for 40000 steps (642 resets) in 714 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (30 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 416152 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 416152 steps, saw 125783 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2026-05-23 11:58:38] [INFO ] Invariant cache hit.
[2026-05-23 11:58:38] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 833/1737 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1737 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 69/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/1771 variables, 17/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1771 variables, 17/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1771 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1771 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1771/1771 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 833/1737 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1737 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 69/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1737 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/1771 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1771 variables, 17/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1771 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1771 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1771/1771 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 422 ms.
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1621/1621 transitions.
Applied a total of 0 rules in 57 ms. Remains 150 /150 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 150/150 places, 1621/1621 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1621/1621 transitions.
Applied a total of 0 rules in 57 ms. Remains 150 /150 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2026-05-23 11:58:40] [INFO ] Invariant cache hit.
[2026-05-23 11:58:40] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-23 11:58:40] [INFO ] Invariant cache hit.
[2026-05-23 11:58:40] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:58:41] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
[2026-05-23 11:58:41] [INFO ] Redundant transitions in 32 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1643 ms. Remains : 150/150 places, 1621/1621 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 150 transition count 1556
Applied a total of 65 rules in 78 ms. Remains 150 /150 variables (removed 0) and now considering 1556/1621 (removed 65) 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-14537800799891901094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11687788119090226266.kers'
[2026-05-23 11:58:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14537800799891901094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11687788119090226266.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1556 rows 114 cols 6205 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 11:58:41] [INFO ] Computed 38 invariants in 5 ms
Computed 38 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11687788119090226266.kers
Total runtime 9 ms.
[2026-05-23 11:58:41] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 11:58:41] [INFO ] [Nat]Absence check using 38 positive place invariants in 5 ms returned sat
[2026-05-23 11:58:42] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 11:58:42] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 11:58:42] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 730 ms.
Knowledge based reduction with 6 factoid took 879 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 434 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Knowledge-based reduction took 57691 ms.
Stuttering acceptance computed with spot in 408 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 7 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 1623/1623 transitions.
Applied a total of 0 rules in 10 ms. Remains 152 /152 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1447644092449180633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16135799694877566394.kers'
[2026-05-23 11:58:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1447644092449180633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16135799694877566394.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1623 rows 116 cols 6274 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 11:58:44] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16135799694877566394.kers
Total runtime 7 ms.
[2026-05-23 11:58:44] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1775 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1775 variables, and 383 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1554/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42179ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42182ms
[2026-05-23 11:59:26] [INFO ] Invariant cache hit.
[2026-05-23 11:59:26] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-23 11:59:26] [INFO ] Invariant cache hit.
[2026-05-23 11:59:26] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 11:59:28] [INFO ] Implicit Places using invariants and state equation in 1835 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 44241 ms. Remains : 152/152 places, 1623/1623 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 3828 edges and 152 vertex of which 150 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 493 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40001 steps (500 resets) in 998 ms. (40 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40004 steps (43 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (37 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (30 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (26 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
[2026-05-23 11:59:29] [INFO ] Invariant cache hit.
[2026-05-23 11:59:29] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 837/1741 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1741 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1741 variables, 69/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1741 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 34/1775 variables, 17/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1775 variables, 17/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1775 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1775 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1775/1775 variables, and 282 constraints, problems are : Problem set: 0 solved, 4 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 152/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 837/1741 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1741 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1741 variables, 69/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1741 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1741 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 34/1775 variables, 17/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1775 variables, 17/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1775 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1775 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1775/1775 variables, and 286 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2359 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 152/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2984ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 2796 ms.
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 1623/1623 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 152 transition count 1622
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 150 transition count 1621
Applied a total of 4 rules in 110 ms. Remains 150 /152 variables (removed 2) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-435781530936090545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1332923627637249479.kers'
[2026-05-23 11:59:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-435781530936090545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1332923627637249479.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1621 rows 114 cols 6270 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 11:59:35] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1332923627637249479.kers
Total runtime 9 ms.
[2026-05-23 11:59:35] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1769/1771 variables, and 278 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1771 variables, and 380 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20101 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1552/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42078ms problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 42080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42193 ms. Remains : 150/152 places, 1621/1623 transitions.
RANDOM walk for 40000 steps (538 resets) in 1545 ms. (25 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (37 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (30 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 374206 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :2 out of 3
Probabilistic random walk after 374206 steps, saw 115447 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :2
[2026-05-23 12:00:20] [INFO ] Invariant cache hit.
[2026-05-23 12:00:20] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 833/1737 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1737 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 69/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/1771 variables, 17/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1771 variables, 17/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1771 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1771 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1771/1771 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 833/1737 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1737 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 69/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1737 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/1771 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1771 variables, 17/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1771 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1771 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1771/1771 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1263ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 438 ms.
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1621/1621 transitions.
Applied a total of 0 rules in 59 ms. Remains 150 /150 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 150/150 places, 1621/1621 transitions.
RANDOM walk for 40000 steps (567 resets) in 1504 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (30 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 428674 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 428674 steps, saw 128696 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2026-05-23 12:00:26] [INFO ] Invariant cache hit.
[2026-05-23 12:00:26] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 833/1737 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1737 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 69/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/1771 variables, 17/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1771 variables, 17/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1771 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1771 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1771/1771 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 827/904 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 833/1737 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1737 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 69/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1737 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/1771 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1771 variables, 17/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1771 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1771 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1771/1771 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/150 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 438 ms.
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1621/1621 transitions.
Applied a total of 0 rules in 57 ms. Remains 150 /150 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 150/150 places, 1621/1621 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1621/1621 transitions.
Applied a total of 0 rules in 57 ms. Remains 150 /150 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2026-05-23 12:00:28] [INFO ] Invariant cache hit.
[2026-05-23 12:00:28] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-23 12:00:28] [INFO ] Invariant cache hit.
[2026-05-23 12:00:28] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:00:29] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
[2026-05-23 12:00:29] [INFO ] Redundant transitions in 28 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1674 ms. Remains : 150/150 places, 1621/1621 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 150 transition count 1556
Applied a total of 65 rules in 55 ms. Remains 150 /150 variables (removed 0) and now considering 1556/1621 (removed 65) 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-15706886112349035339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-877119495096348671.kers'
[2026-05-23 12:00:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15706886112349035339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-877119495096348671.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 10 ms.
// Phase 1: matrix 1556 rows 114 cols 6205 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 12:00:29] [INFO ] Computed 38 invariants in 15 ms
Computed 38 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-877119495096348671.kers
Total runtime 27 ms.
[2026-05-23 12:00:29] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 12:00:29] [INFO ] [Nat]Absence check using 38 positive place invariants in 7 ms returned sat
[2026-05-23 12:00:30] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 12:00:30] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 12:00:30] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 877 ms.
Knowledge based reduction with 6 factoid took 730 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Knowledge-based reduction took 63291 ms.
Stuttering acceptance computed with spot in 349 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 343 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 20018 reset in 455 ms.
Product exploration explored 100000 steps with 20014 reset in 474 ms.
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14027407691590789318
[2026-05-23 12:00:33] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14027407691590789318
Running compilation step : cd /tmp/ltsmin14027407691590789318;'/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/ltsmin14027407691590789318;'/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/ltsmin14027407691590789318;'/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 7 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 1623/1623 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-120964085179267064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1095675817788656027.kers'
[2026-05-23 12:00:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-120964085179267064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1095675817788656027.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1623 rows 116 cols 6274 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 12:00:36] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1095675817788656027.kers
Total runtime 6 ms.
[2026-05-23 12:00:36] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1775 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1775 variables, and 383 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/152 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1554/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42071ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42074ms
[2026-05-23 12:01:18] [INFO ] Invariant cache hit.
[2026-05-23 12:01:18] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-23 12:01:18] [INFO ] Invariant cache hit.
[2026-05-23 12:01:18] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:01:20] [INFO ] Implicit Places using invariants and state equation in 1855 ms returned []
Implicit Place search using SMT with State Equation took 2063 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 44144 ms. Remains : 152/152 places, 1623/1623 transitions.
Built C files in :
/tmp/ltsmin11936997557378758111
[2026-05-23 12:01:20] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11936997557378758111
Running compilation step : cd /tmp/ltsmin11936997557378758111;'/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/ltsmin11936997557378758111;'/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/ltsmin11936997557378758111;'/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 12:01:23] [INFO ] Flatten gal took : 31 ms
[2026-05-23 12:01:23] [INFO ] Flatten gal took : 31 ms
[2026-05-23 12:01:23] [INFO ] Time to serialize gal into /tmp/LTL1780657906409403494.gal : 9 ms
[2026-05-23 12:01:23] [INFO ] Time to serialize properties into /tmp/LTL7683836804797019712.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1780657906409403494.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5463599423181531555.hoa' '-atoms' '/tmp/LTL7683836804797019712.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7683836804797019712.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5463599423181531555.hoa
Detected timeout of ITS tools.
[2026-05-23 12:01:38] [INFO ] Flatten gal took : 27 ms
[2026-05-23 12:01:38] [INFO ] Flatten gal took : 34 ms
[2026-05-23 12:01:38] [INFO ] Time to serialize gal into /tmp/LTL9394091017926582420.gal : 9 ms
[2026-05-23 12:01:38] [INFO ] Time to serialize properties into /tmp/LTL12264149957299738622.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/LTL9394091017926582420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12264149957299738622.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(pl_cops_n22>=3)")||(X(X(F("(pl_end_n1<=pl_robber_absent_n5)")))))))U(("(pl_incoming_cops_n31<=pl_end_n15)")U(G("(pl_incomin...185
Formula 0 simplified : XF(!"(pl_cops_n22>=3)" & XXG!"(pl_end_n1<=pl_robber_absent_n5)") R (!"(pl_incoming_cops_n31<=pl_end_n15)" R F!"(pl_incoming_cops_n11...171
Detected timeout of ITS tools.
[2026-05-23 12:01:53] [INFO ] Flatten gal took : 30 ms
[2026-05-23 12:01:53] [INFO ] Applying decomposition
[2026-05-23 12:01:53] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16232283012067921598.txt' '-o' '/tmp/graph16232283012067921598.bin' '-w' '/tmp/graph16232283012067921598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16232283012067921598.bin' '-l' '-1' '-v' '-w' '/tmp/graph16232283012067921598.weights' '-q' '0' '-e' '0.001'
[2026-05-23 12:01:54] [INFO ] Decomposing Gal with order
[2026-05-23 12:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 12:01:54] [INFO ] Removed a total of 905 redundant transitions.
[2026-05-23 12:01:54] [INFO ] Flatten gal took : 416 ms
[2026-05-23 12:01:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 940 labels/synchronizations in 36 ms.
[2026-05-23 12:01:54] [INFO ] Time to serialize gal into /tmp/LTL2427424406906229204.gal : 9 ms
[2026-05-23 12:01:54] [INFO ] Time to serialize properties into /tmp/LTL9705711963146200302.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/LTL2427424406906229204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9705711963146200302.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 : !(((X(G(("(gi0.gu0.pl_cops_n22>=3)")||(X(X(F("(gu2.pl_end_n1<=gu2.pl_robber_absent_n5)")))))))U(("(gu4.pl_incoming_cops_n31<=gu4.pl_en...217
Formula 0 simplified : XF(!"(gi0.gu0.pl_cops_n22>=3)" & XXG!"(gu2.pl_end_n1<=gu2.pl_robber_absent_n5)") R (!"(gu4.pl_incoming_cops_n31<=gu4.pl_end_n15)" R ...203
Detected timeout of ITS tools.
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-11 finished in 309831 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((F(p0)&&(F(p1)||(!p2 U (p3||G(!p2)))))))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Graph (complete) has 3864 edges and 164 vertex of which 150 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 150 transition count 1622
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 149 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 148 transition count 1621
Applied a total of 5 rules in 78 ms. Remains 148 /164 variables (removed 16) and now considering 1621/1623 (removed 2) transitions.
Running 1558 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9799741061839163100.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2806883790982334850.kers'
[2026-05-23 12:02:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9799741061839163100.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2806883790982334850.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 1 ms.
// Phase 1: matrix 1621 rows 112 cols 6266 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-23 12:02:09] [INFO ] Computed 38 invariants in 5 ms
Computed 38 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2806883790982334850.kers
Total runtime 9 ms.
[2026-05-23 12:02:09] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1769/1769 variables, and 278 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (OVERLAPS) 1621/1769 variables, 148/186 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 92/278 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1769 variables, and 386 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1558/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42099ms problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 42101ms
[2026-05-23 12:02:52] [INFO ] Invariant cache hit.
[2026-05-23 12:02:52] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-23 12:02:52] [INFO ] Invariant cache hit.
[2026-05-23 12:02:52] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:02:54] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
[2026-05-23 12:02:54] [INFO ] Redundant transitions in 28 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/164 places, 1621/1623 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44446 ms. Remains : 148/164 places, 1621/1623 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((F(p0)&&(F(p1)||(!p2 U (p3||G(!p2)))))))'
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-12
Product exploration explored 100000 steps with 2819 reset in 1832 ms.
Product exploration explored 100000 steps with 2877 reset in 1843 ms.
Computed a total of 0 stabilizing places and 72 stable transitions
Computed a total of 0 stabilizing places and 72 stable transitions
Knowledge based reduction with 12 factoid took 130 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter insensitive) to 16 states, 44 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40001 steps (620 resets) in 1395 ms. (28 steps per ms) remains 7/20 properties
BEST_FIRST walk for 40004 steps (280 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (279 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (280 resets) in 308 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (280 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (15 resets) in 366 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (32 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (280 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
[2026-05-23 12:02:59] [INFO ] Invariant cache hit.
[2026-05-23 12:02:59] [INFO ] State equation strengthened by 92 read => feed constraints.
Problem apf12 is UNSAT
Problem apf14 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/42 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/76 variables, 34/37 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/37 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 845/921 variables, 76/113 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 5/118 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/118 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 832/1753 variables, 64/182 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1753 variables, 1/183 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1753 variables, 79/262 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1753 variables, 0/262 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/1769 variables, 8/270 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1769 variables, 8/278 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1769 variables, 0/278 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1769 variables, 0/278 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1769/1769 variables, and 278 constraints, problems are : Problem set: 6 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/75 variables, 34/37 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 824/899 variables, 75/112 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 3/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 836/1735 variables, 56/171 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 1/172 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 72/244 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 1/245 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1735/1769 variables, and 245 constraints, problems are : Problem set: 6 solved, 1 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 131/148 constraints, ReadFeed: 75/92 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1861ms problems are : Problem set: 6 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1621/1621 transitions.
Applied a total of 0 rules in 61 ms. Remains 148 /148 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 148/148 places, 1621/1621 transitions.
RANDOM walk for 40000 steps (594 resets) in 1051 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (279 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 432418 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 432418 steps, saw 129548 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2026-05-23 12:03:04] [INFO ] Invariant cache hit.
[2026-05-23 12:03:04] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/75 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 824/899 variables, 75/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 836/1735 variables, 56/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 72/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/1769 variables, 17/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1769 variables, 17/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1769 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1769 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1769/1769 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 92/92 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/75 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 824/899 variables, 75/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 836/1735 variables, 56/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 72/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1769 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6501 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 75/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6879ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 576 ms.
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1621/1621 transitions.
Applied a total of 0 rules in 57 ms. Remains 148 /148 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 148/148 places, 1621/1621 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1621/1621 transitions.
Applied a total of 0 rules in 61 ms. Remains 148 /148 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2026-05-23 12:03:12] [INFO ] Invariant cache hit.
[2026-05-23 12:03:12] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-23 12:03:12] [INFO ] Invariant cache hit.
[2026-05-23 12:03:12] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:03:14] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
[2026-05-23 12:03:14] [INFO ] Redundant transitions in 36 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2415 ms. Remains : 148/148 places, 1621/1621 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 148 transition count 1552
Applied a total of 69 rules in 61 ms. Remains 148 /148 variables (removed 0) and now considering 1552/1621 (removed 69) 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-9763903703637767341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10335058186635132369.kers'
[2026-05-23 12:03:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9763903703637767341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10335058186635132369.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1552 rows 112 cols 6197 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-23 12:03:14] [INFO ] Computed 38 invariants in 5 ms
Computed 38 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10335058186635132369.kers
Total runtime 7 ms.
[2026-05-23 12:03:14] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 12:03:14] [INFO ] [Nat]Absence check using 38 positive place invariants in 5 ms returned sat
[2026-05-23 12:03:23] [INFO ] After 9175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 12:03:26] [INFO ] After 12237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 12:03:33] [INFO ] After 18432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 18544 ms.
Found 6 invariant AP formulas.
Knowledge based reduction with 18 factoid took 407 ms. Reduced automaton from 16 states, 44 edges and 4 AP (stutter insensitive) to 10 states, 26 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 437 ms :[p2, p2, (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false]
Knowledge-based reduction took 35631 ms.
Stuttering acceptance computed with spot in 385 ms :[p2, p2, (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false]
Support contains 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 1621/1621 transitions.
Applied a total of 0 rules in 59 ms. Remains 148 /148 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Skipped dead transition search.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16058276905776074396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13312544764605430737.kers'
[2026-05-23 12:03:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16058276905776074396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13312544764605430737.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1621 rows 112 cols 6266 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-23 12:03:34] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13312544764605430737.kers
Total runtime 6 ms.
[2026-05-23 12:03:34] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-23 12:03:34] [INFO ] Invariant cache hit.
[2026-05-23 12:03:34] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:03:36] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
[2026-05-23 12:03:36] [INFO ] Redundant transitions in 33 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2256 ms. Remains : 148/148 places, 1621/1621 transitions.
Computed a total of 0 stabilizing places and 72 stable transitions
Computed a total of 0 stabilizing places and 72 stable transitions
Knowledge based reduction with 20 factoid took 226 ms. Reduced automaton from 10 states, 26 edges and 4 AP (stutter insensitive) to 10 states, 26 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (596 resets) in 858 ms. (46 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40003 steps (39 resets) in 86 ms. (459 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (276 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2026-05-23 12:03:37] [INFO ] Invariant cache hit.
[2026-05-23 12:03:37] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/75 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 824/899 variables, 75/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 836/1735 variables, 56/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 72/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/1769 variables, 17/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1769 variables, 17/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1769 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1769 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1769/1769 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 92/92 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/75 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 824/899 variables, 75/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 836/1735 variables, 56/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 72/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1735/1769 variables, and 245 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 131/148 constraints, ReadFeed: 75/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1708ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1621/1621 transitions.
Applied a total of 0 rules in 63 ms. Remains 148 /148 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 148/148 places, 1621/1621 transitions.
RANDOM walk for 40001 steps (630 resets) in 723 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (280 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 445021 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 445021 steps, saw 133157 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2026-05-23 12:03:42] [INFO ] Invariant cache hit.
[2026-05-23 12:03:42] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/75 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 824/899 variables, 75/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 836/1735 variables, 56/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 72/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/1769 variables, 17/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1769 variables, 17/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1769 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1769 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1769/1769 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 92/92 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/75 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 824/899 variables, 75/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 836/1735 variables, 56/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 72/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1769/1769 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6486 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 148/148 constraints, ReadFeed: 75/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6870ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 589 ms.
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1621/1621 transitions.
Applied a total of 0 rules in 61 ms. Remains 148 /148 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 148/148 places, 1621/1621 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1621/1621 transitions.
Applied a total of 0 rules in 63 ms. Remains 148 /148 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2026-05-23 12:03:49] [INFO ] Invariant cache hit.
[2026-05-23 12:03:49] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-23 12:03:49] [INFO ] Invariant cache hit.
[2026-05-23 12:03:50] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:03:51] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 2206 ms to find 0 implicit places.
[2026-05-23 12:03:51] [INFO ] Redundant transitions in 36 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2316 ms. Remains : 148/148 places, 1621/1621 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 148 transition count 1552
Applied a total of 69 rules in 54 ms. Remains 148 /148 variables (removed 0) and now considering 1552/1621 (removed 69) 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-7548511381463388065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14051589471963115520.kers'
[2026-05-23 12:03:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7548511381463388065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14051589471963115520.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1552 rows 112 cols 6197 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-23 12:03:51] [INFO ] Computed 38 invariants in 11 ms
Computed 38 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-14051589471963115520.kers
Total runtime 15 ms.
[2026-05-23 12:03:51] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 12:03:52] [INFO ] [Nat]Absence check using 38 positive place invariants in 5 ms returned sat
[2026-05-23 12:04:01] [INFO ] After 9159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 12:04:04] [INFO ] After 12183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 12:04:10] [INFO ] After 18330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 18454 ms.
Knowledge based reduction with 20 factoid took 310 ms. Reduced automaton from 10 states, 26 edges and 4 AP (stutter insensitive) to 10 states, 26 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 343 ms :[p2, p2, (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false]
Knowledge-based reduction took 34448 ms.
Stuttering acceptance computed with spot in 335 ms :[p2, p2, (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 331 ms :[p2, p2, (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 2954 reset in 1826 ms.
Product exploration explored 100000 steps with 2770 reset in 1856 ms.
Built C files in :
/tmp/ltsmin2033738665023758187
[2026-05-23 12:04:15] [INFO ] Too many transitions (1621) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:04:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2033738665023758187
Running compilation step : cd /tmp/ltsmin2033738665023758187;'/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/ltsmin2033738665023758187;'/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/ltsmin2033738665023758187;'/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 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 1621/1621 transitions.
Applied a total of 0 rules in 59 ms. Remains 148 /148 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Skipped dead transition search.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6114204162535329424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14626692125386147090.kers'
[2026-05-23 12:04:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6114204162535329424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14626692125386147090.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1621 rows 112 cols 6266 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-23 12:04:18] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-14626692125386147090.kers
Total runtime 14 ms.
[2026-05-23 12:04:18] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-23 12:04:18] [INFO ] Invariant cache hit.
[2026-05-23 12:04:18] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:04:20] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
[2026-05-23 12:04:20] [INFO ] Redundant transitions in 28 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2136 ms. Remains : 148/148 places, 1621/1621 transitions.
Built C files in :
/tmp/ltsmin14898748512023809942
[2026-05-23 12:04:20] [INFO ] Too many transitions (1621) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:04:20] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14898748512023809942
Running compilation step : cd /tmp/ltsmin14898748512023809942;'/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/ltsmin14898748512023809942;'/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/ltsmin14898748512023809942;'/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 12:04:23] [INFO ] Flatten gal took : 95 ms
[2026-05-23 12:04:23] [INFO ] Flatten gal took : 69 ms
[2026-05-23 12:04:23] [INFO ] Time to serialize gal into /tmp/LTL82465643330081137.gal : 8 ms
[2026-05-23 12:04:23] [INFO ] Time to serialize properties into /tmp/LTL10776263687660286570.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL82465643330081137.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13291450584306672148.hoa' '-atoms' '/tmp/LTL10776263687660286570.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10776263687660286570.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13291450584306672148.hoa
Detected timeout of ITS tools.
[2026-05-23 12:04:38] [INFO ] Flatten gal took : 36 ms
[2026-05-23 12:04:39] [INFO ] Flatten gal took : 72 ms
[2026-05-23 12:04:39] [INFO ] Time to serialize gal into /tmp/LTL5788910223406635199.gal : 26 ms
[2026-05-23 12:04:39] [INFO ] Time to serialize properties into /tmp/LTL3905178737042420246.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/LTL5788910223406635199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3905178737042420246.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((F("(pl_robber_here_n26<1)"))&&((F("(pl_cops_n5>pl_robber_absent_n15)"))||((!("((pl_cops_n5<=pl_robber_absent_n15)&&(pl_incoming_...361
Formula 0 simplified : G(G!"(pl_robber_here_n26<1)" | (G!"(pl_cops_n5>pl_robber_absent_n15)" & ("((pl_cops_n5<=pl_robber_absent_n15)&&(pl_incoming_cops_n21...273
Detected timeout of ITS tools.
[2026-05-23 12:04:54] [INFO ] Flatten gal took : 41 ms
[2026-05-23 12:04:54] [INFO ] Applying decomposition
[2026-05-23 12:04:54] [INFO ] Flatten gal took : 34 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/graph10330917350663022243.txt' '-o' '/tmp/graph10330917350663022243.bin' '-w' '/tmp/graph10330917350663022243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10330917350663022243.bin' '-l' '-1' '-v' '-w' '/tmp/graph10330917350663022243.weights' '-q' '0' '-e' '0.001'
[2026-05-23 12:04:54] [INFO ] Decomposing Gal with order
[2026-05-23 12:04:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 12:04:54] [INFO ] Removed a total of 122 redundant transitions.
[2026-05-23 12:04:54] [INFO ] Flatten gal took : 133 ms
[2026-05-23 12:04:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 1 ms.
[2026-05-23 12:04:54] [INFO ] Time to serialize gal into /tmp/LTL9648267099911071004.gal : 18 ms
[2026-05-23 12:04:54] [INFO ] Time to serialize properties into /tmp/LTL10123727523463037151.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/LTL9648267099911071004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10123727523463037151.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((F("(gu0.pl_robber_here_n26<1)"))&&((F("(gu1.pl_cops_n5>gu1.pl_robber_absent_n15)"))||((!("((gu1.pl_cops_n5<=gu1.pl_robber_absent...417
Formula 0 simplified : G(G!"(gu0.pl_robber_here_n26<1)" | (G!"(gu1.pl_cops_n5>gu1.pl_robber_absent_n15)" & ("((gu1.pl_cops_n5<=gu1.pl_robber_absent_n15)&&(...317
Detected timeout of ITS tools.
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-12 finished in 179754 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) U p1)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 151 transition count 1623
Applied a total of 13 rules in 6 ms. Remains 151 /164 variables (removed 13) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4175061463903618728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6920229844688036014.kers'
[2026-05-23 12:05:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4175061463903618728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6920229844688036014.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 1623 rows 115 cols 6272 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 12:05:09] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6920229844688036014.kers
Total runtime 5 ms.
[2026-05-23 12:05:09] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1774 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1774 variables, and 386 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/151 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1557/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42116ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42120ms
[2026-05-23 12:05:51] [INFO ] Invariant cache hit.
[2026-05-23 12:05:51] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-23 12:05:51] [INFO ] Invariant cache hit.
[2026-05-23 12:05:52] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:05:53] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 151/164 places, 1623/1623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44179 ms. Remains : 151/164 places, 1623/1623 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) U p1)))'
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 374 ms.
Product exploration explored 100000 steps with 50000 reset in 399 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 3825 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 25 ms. Proved property starting from automaton with 4 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 42 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-13 finished in 45160 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)) U X(((p2&&G(p1)) U p3))))'
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 1623/1623 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 154 transition count 1623
Applied a total of 10 rules in 7 ms. Remains 154 /164 variables (removed 10) and now considering 1623/1623 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10393095833120159547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7702542396065025470.kers'
[2026-05-23 12:05:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10393095833120159547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7702542396065025470.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 1623 rows 118 cols 6278 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-23 12:05:54] [INFO ] Computed 38 invariants in 9 ms
Computed 38 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7702542396065025470.kers
Total runtime 13 ms.
[2026-05-23 12:05:54] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1773/1777 variables, and 280 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/154 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1560/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (OVERLAPS) 1623/1773 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1773 variables, 92/280 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1773/1777 variables, and 377 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 150/154 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1548/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42027ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 42030ms
[2026-05-23 12:06:36] [INFO ] Invariant cache hit.
[2026-05-23 12:06:36] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-23 12:06:37] [INFO ] Invariant cache hit.
[2026-05-23 12:06:37] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-23 12:06:39] [INFO ] Implicit Places using invariants and state equation in 2314 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 154/164 places, 1623/1623 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44545 ms. Remains : 154/164 places, 1623/1623 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)) U X(((p2&&G(p1)) U p3))))'
Stuttering acceptance computed with spot in 514 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p3)]
Running random walk in product with property : CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-15
Stuttering criterion allowed to conclude after 2455 steps with 504 reset in 14 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-15 finished in 45138 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))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||X(X(F(p1)))))) U (p2 U G(p3))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(F(p1)||(!p2 U (p3||G(!p2)))))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 12:06:40] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4000065955740935658
[2026-05-23 12:06:40] [INFO ] Too many transitions (1623) to apply POR reductions. Disabling POR matrices.
[2026-05-23 12:06:40] [INFO ] Applying decomposition
[2026-05-23 12:06:40] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4000065955740935658
Running compilation step : cd /tmp/ltsmin4000065955740935658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-23 12:06:40] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3764767399648853218.txt' '-o' '/tmp/graph3764767399648853218.bin' '-w' '/tmp/graph3764767399648853218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3764767399648853218.bin' '-l' '-1' '-v' '-w' '/tmp/graph3764767399648853218.weights' '-q' '0' '-e' '0.001'
[2026-05-23 12:06:40] [INFO ] Decomposing Gal with order
[2026-05-23 12:06:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 12:06:40] [INFO ] Removed a total of 1053 redundant transitions.
[2026-05-23 12:06:40] [INFO ] Flatten gal took : 480 ms
[2026-05-23 12:06:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 967 labels/synchronizations in 21 ms.
[2026-05-23 12:06:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality6382229850640615291.gal : 9 ms
[2026-05-23 12:06:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality9420627017980406464.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/LTLCardinality6382229850640615291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9420627017980406464.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((X(X(G("(gi0.gu1.pl_end_n11<3)")))))
Formula 0 simplified : XXF!"(gi0.gu1.pl_end_n11<3)"
Compilation finished in 3278 ms.
Running link step : cd /tmp/ltsmin4000065955740935658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin4000065955740935658;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 71966 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4000065955740935658;'/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([](((LTLAPp1==true)||X(X(<>((LTLAPp2==true))))))) U ((LTLAPp3==true) U []((LTLAPp4==true))))' '--buchi-type=spotba'
LTSmin run took 676 ms.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4000065955740935658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp5==true))&&(<>((LTLAPp6==true))||(!(LTLAPp7==true) U ((LTLAPp8==true)||[](!(LTLAPp7==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gu1.t112, gi0.gu1.t114, gi0.gu1.t116, gi0.gu1.t118, gi0.gu1.t120, gi0.gu1.t122, gi0.gu1.t...10264
Computing Next relation with stutter on 49284 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
27466 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,275.115,4332584,1,0,1667,1.23269e+07,1703,496,30346,1.64873e+07,1836
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !(((X(G(("(gi0.gu0.pl_cops_n22>=3)")||(X(X(F("(gu2.pl_end_n1<=gu2.pl_robber_absent_n5)")))))))U(("(gu5.pl_incoming_cops_n31<=gu5.pl_en...217
Formula 1 simplified : XF(!"(gi0.gu0.pl_cops_n22>=3)" & XXG!"(gu2.pl_end_n1<=gu2.pl_robber_absent_n5)") R (!"(gu5.pl_incoming_cops_n31<=gu5.pl_end_n15)" R ...203
Computing Next relation with stutter on 49284 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin4000065955740935658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp5==true))&&(<>((LTLAPp6==true))||(!(LTLAPp7==true) U ((LTLAPp8==true)||[](!(LTLAPp7==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin4000065955740935658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp5==true))&&(<>((LTLAPp6==true))||(!(LTLAPp7==true) U ((LTLAPp8==true)||[](!(LTLAPp7==true)))))))' '--buchi-type=spotba'
12 unique states visited
2 strongly connected components in search stack
14 transitions explored
12 items max in DFS search stack
103129 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1306.41,10746332,1,0,1754,2.94279e+07,26,577,7629,4.1575e+07,130
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
Checking formula 2 : !((F((F("(gi0.gu1.pl_robber_here_n26<1)"))&&((F("(gu3.pl_cops_n5>gu3.pl_robber_absent_n15)"))||((!("((gu3.pl_cops_n5<=gu3.pl_robber_ab...433
Formula 2 simplified : G(G!"(gi0.gu1.pl_robber_here_n26<1)" | (G!"(gu3.pl_cops_n5>gu3.pl_robber_absent_n15)" & ("((gu3.pl_cops_n5<=gu3.pl_robber_absent_n15...329
Computing Next relation with stutter on 49284 deadlock states
5 unique states visited
3 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
9744 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1403.86,10746332,1,0,1754,2.94279e+07,58,577,10051,4.1575e+07,576
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CopsAndRobbers-PT-KFL036N009K002X003-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2632227 ms.

BK_STOP 1779539487551

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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