Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914300733.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 Peterson-PT-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300733
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 159K Mar 8 07:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 625K Mar 8 07:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 196K Mar 8 07:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 900K Mar 8 07:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 96K Mar 16 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 280K Mar 16 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 38K Mar 16 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 137K Mar 16 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 338K Mar 8 07:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Mar 8 07:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 124K Mar 8 07:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 550K Mar 8 07:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.3K Mar 16 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Mar 16 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 877K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779824009194

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 19:33:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 19:33:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 19:33:30] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2026-05-26 19:33:30] [INFO ] Transformed 1330 places.
[2026-05-26 19:33:30] [INFO ] Transformed 2030 transitions.
[2026-05-26 19:33:30] [INFO ] Found NUPN structural information;
[2026-05-26 19:33:30] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 13
FORMULA Peterson-PT-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[42, 7, 294, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-6-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[42, 7, 294, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2023721390215836262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14587048296979646716.kers'
[2026-05-26 19:33:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2023721390215836262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14587048296979646716.kers]
Normalized transition count is 1820 out of 2030 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 1820 rows 1316 cols 4144 entries
Finished phase 1 with 1296 SingleSign rule and 7 generalized
[2026-05-26 19:33:30] [INFO ] Computed 27 invariants in 10 ms
Computed 27 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-14587048296979646716.kers
Total runtime 13 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[42, 7, 294, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 114 ms. (86 steps per ms)
FORMULA Peterson-PT-6-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-6-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-6-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 128 ms. (387 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 1, 7, 0, 0] Max Struct:[42, 7, 294, 1, 1]
[2026-05-26 19:33:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4853763436402842048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9661789950016830531.kers'
[2026-05-26 19:33:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4853763436402842048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9661789950016830531.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 1820 rows 1316 cols 4144 entries
Finished phase 1 with 1296 SingleSign rule and 7 generalized
[2026-05-26 19:33:30] [INFO ] Computed 27 invariants in 9 ms
Computed 27 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9661789950016830531.kers
Total runtime 10 ms.
[2026-05-26 19:33:31] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2026-05-26 19:33:31] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned unsat
[2026-05-26 19:33:31] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2026-05-26 19:33:31] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2026-05-26 19:33:32] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2026-05-26 19:33:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:33:32] [INFO ] [Real]Added 330 Read/Feed constraints in 74 ms returned sat
[2026-05-26 19:33:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:33:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2026-05-26 19:33:32] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 16 ms returned sat
[2026-05-26 19:33:33] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2026-05-26 19:33:33] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-26 19:33:34] [INFO ] [Nat]Added 330 Read/Feed constraints in 765 ms returned sat
[2026-05-26 19:33:37] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3422 ms
[2026-05-26 19:33:37] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2026-05-26 19:33:37] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned unsat
[2026-05-26 19:33:38] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2026-05-26 19:33:38] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 17 ms returned sat
[2026-05-26 19:33:38] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2026-05-26 19:33:38] [INFO ] [Real]Added 330 Read/Feed constraints in 43 ms returned sat
[2026-05-26 19:33:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:33:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2026-05-26 19:33:38] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 17 ms returned sat
[2026-05-26 19:33:39] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2026-05-26 19:33:39] [INFO ] [Nat]Added 330 Read/Feed constraints in 54 ms returned sat
[2026-05-26 19:33:39] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 89 ms.
[2026-05-26 19:33:40] [INFO ] Added : 27 causal constraints over 6 iterations in 872 ms. Result :sat
Minimization took 650 ms.
[2026-05-26 19:33:41] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2026-05-26 19:33:41] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned sat
[2026-05-26 19:33:41] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2026-05-26 19:33:41] [INFO ] [Real]Added 330 Read/Feed constraints in 35 ms returned sat
[2026-05-26 19:33:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:33:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2026-05-26 19:33:41] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 17 ms returned sat
[2026-05-26 19:33:42] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2026-05-26 19:33:42] [INFO ] [Nat]Added 330 Read/Feed constraints in 38 ms returned sat
[2026-05-26 19:33:42] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 85 ms.
[2026-05-26 19:33:46] [INFO ] Added : 192 causal constraints over 39 iterations in 4229 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[7, 1, 7, 0, 0] Max Struct:[7, 7, 7, 1, 1]
FORMULA Peterson-PT-6-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[7, 1, 1]
Support contains 9 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1330 transition count 1444
Reduce places removed 586 places and 0 transitions.
Iterating post reduction 1 with 586 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 287 Pre rules applied. Total rules applied 1172 place count 744 transition count 1157
Deduced a syphon composed of 287 places in 1 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 2 with 574 rules applied. Total rules applied 1746 place count 457 transition count 1157
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1828 place count 416 transition count 1116
Applied a total of 1828 rules in 182 ms. Remains 416 /1330 variables (removed 914) and now considering 1116/2030 (removed 914) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 416/1330 places, 1116/2030 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-929417247381308763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6929873756967544593.kers'
[2026-05-26 19:33:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-929417247381308763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6929873756967544593.kers]
Normalized transition count is 906 out of 1116 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 906 rows 402 cols 2316 entries
Finished phase 1 with 382 SingleSign rule and 7 generalized
[2026-05-26 19:33:47] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6929873756967544593.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[7, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1889 ms. (529 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1599 ms. (1875 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[7, 1, 1]
[2026-05-26 19:33:50] [INFO ] Flow matrix only has 906 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-322357854780460568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1777882783181142607.kers'
[2026-05-26 19:33:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-322357854780460568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1777882783181142607.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 906 rows 402 cols 2316 entries
Finished phase 1 with 382 SingleSign rule and 7 generalized
[2026-05-26 19:33:50] [INFO ] Computed 27 invariants in 7 ms
Computed 27 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1777882783181142607.kers
Total runtime 9 ms.
[2026-05-26 19:33:50] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-26 19:33:50] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:33:50] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2026-05-26 19:33:50] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:33:50] [INFO ] [Real]Added 330 Read/Feed constraints in 35 ms returned sat
[2026-05-26 19:33:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:33:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-26 19:33:51] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:33:51] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2026-05-26 19:33:51] [INFO ] [Nat]Added 330 Read/Feed constraints in 106 ms returned sat
[2026-05-26 19:34:35] [INFO ] Trap strengthening (SAT) tested/added 126/126 trap constraints in 44648 ms
[2026-05-26 19:34:36] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-26 19:34:36] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:34:36] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2026-05-26 19:34:36] [INFO ] [Real]Added 330 Read/Feed constraints in 29 ms returned sat
[2026-05-26 19:34:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:34:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-26 19:34:36] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:34:36] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2026-05-26 19:34:36] [INFO ] [Nat]Added 330 Read/Feed constraints in 26 ms returned sat
[2026-05-26 19:34:36] [INFO ] Computed and/alt/rep : 815/2838/815 causal constraints (skipped 84 transitions) in 64 ms.
[2026-05-26 19:34:36] [INFO ] Added : 7 causal constraints over 2 iterations in 204 ms. Result :sat
Minimization took 178 ms.
[2026-05-26 19:34:37] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-26 19:34:37] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:34:37] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2026-05-26 19:34:37] [INFO ] [Real]Added 330 Read/Feed constraints in 27 ms returned sat
[2026-05-26 19:34:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:34:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-26 19:34:37] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:34:37] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2026-05-26 19:34:37] [INFO ] [Nat]Added 330 Read/Feed constraints in 25 ms returned sat
[2026-05-26 19:34:37] [INFO ] Computed and/alt/rep : 815/2838/815 causal constraints (skipped 84 transitions) in 50 ms.
[2026-05-26 19:34:37] [INFO ] Added : 11 causal constraints over 3 iterations in 241 ms. Result :sat
Minimization took 187 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[7, 1, 1]
FORMULA Peterson-PT-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-6-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 416 transition count 1115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 415 transition count 1115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 415 transition count 1114
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 414 transition count 1114
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 2 with 2 rules applied. Total rules applied 6 place count 413 transition count 1113
Applied a total of 6 rules in 52 ms. Remains 413 /416 variables (removed 3) and now considering 1113/1116 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 413/416 places, 1113/1116 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15745433242618405050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17528832734982489145.kers'
[2026-05-26 19:34:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15745433242618405050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17528832734982489145.kers]
Normalized transition count is 903 out of 1113 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:34:38] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17528832734982489145.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 1778 ms. (562 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 590 ms. (1692 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-26 19:34:40] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-707128049847116972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9050599243599461538.kers'
[2026-05-26 19:34:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-707128049847116972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9050599243599461538.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:34:40] [INFO ] Computed 27 invariants in 9 ms
Computed 27 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9050599243599461538.kers
Total runtime 10 ms.
[2026-05-26 19:34:40] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-26 19:34:40] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:34:40] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2026-05-26 19:34:40] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:34:40] [INFO ] [Real]Added 330 Read/Feed constraints in 36 ms returned sat
[2026-05-26 19:34:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:34:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-26 19:34:40] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:34:41] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2026-05-26 19:34:41] [INFO ] [Nat]Added 330 Read/Feed constraints in 99 ms returned sat
[2026-05-26 19:35:25] [INFO ] Trap strengthening (SAT) tested/added 130/130 trap constraints in 44664 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 19 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 413/413 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 18 ms. Remains 413 /413 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:35:25] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:35:25] [INFO ] Invariant cache hit.
[2026-05-26 19:35:26] [INFO ] Implicit Places using invariants in 483 ms returned [387, 388, 390, 398, 399, 400, 401]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 487 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 406/413 places, 1113/1113 transitions.
Applied a total of 0 rules in 19 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 527 ms. Remains : 406/413 places, 1113/1113 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11698258011791973505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3058581375084753165.kers'
[2026-05-26 19:35:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11698258011791973505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3058581375084753165.kers]
Normalized transition count is 903 out of 1113 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:35:26] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3058581375084753165.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 1705 ms. (586 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 560 ms. (1782 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2026-05-26 19:35:28] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6176401833098499392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18344276127735419891.kers'
[2026-05-26 19:35:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6176401833098499392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18344276127735419891.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:35:28] [INFO ] Computed 20 invariants in 5 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18344276127735419891.kers
Total runtime 6 ms.
[2026-05-26 19:35:28] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-26 19:35:28] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:35:29] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2026-05-26 19:35:29] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:35:29] [INFO ] [Real]Added 330 Read/Feed constraints in 38 ms returned sat
[2026-05-26 19:35:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:35:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-26 19:35:29] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:35:29] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-26 19:35:29] [INFO ] [Nat]Added 330 Read/Feed constraints in 96 ms returned sat
[2026-05-26 19:35:51] [INFO ] Trap strengthening (SAT) tested/added 76/76 trap constraints in 22525 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 16 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 16 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:35:52] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:35:52] [INFO ] Invariant cache hit.
[2026-05-26 19:35:52] [INFO ] Implicit Places using invariants in 452 ms returned []
[2026-05-26 19:35:52] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:35:52] [INFO ] Invariant cache hit.
[2026-05-26 19:35:52] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:35:54] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 2844 ms to find 0 implicit places.
[2026-05-26 19:35:54] [INFO ] Redundant transitions in 71 ms returned []
Running 1106 sub problems to find dead transitions.
[2026-05-26 19:35:54] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:35:54] [INFO ] Invariant cache hit.
[2026-05-26 19:35:55] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 406/406 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 13/419 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 7/426 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/466 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/486 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1309 variables, and 486 constraints, problems are : Problem set: 0 solved, 1106 unsolved in 30040 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/406 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1106/1106 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 406/406 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 13/419 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 7/426 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 60/486 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/526 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 20/566 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1309 variables, and 566 constraints, problems are : Problem set: 0 solved, 1106 unsolved in 30029 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/406 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1106 constraints, Known Traps: 140/140 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63315 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 517 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2026-05-26 19:36:55] [INFO ] Flatten gal took : 107 ms
[2026-05-26 19:36:55] [INFO ] Flatten gal took : 64 ms
[2026-05-26 19:36:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13895916142614569235.gal : 36 ms
[2026-05-26 19:36:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5768714330881539985.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13895916142614569235.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5768714330881539985.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5768714330881539985.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 140
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :140 after 315
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :315 after 560
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :560 after 2226
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2226 after 3903
Interrupted probabilistic random walk after 743392 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 2
Probabilistic random walk after 743392 steps, saw 100878 distinct states, run finished after 3004 ms. (steps per millisecond=247 ) properties seen :0
[2026-05-26 19:36:58] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:36:58] [INFO ] Invariant cache hit.
[2026-05-26 19:36:58] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3903 after 10237
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 839 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10237 after 55583
Problem MAX0 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SMT process timed out in 5865ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 18 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 946688 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 1
Probabilistic random walk after 946688 steps, saw 125464 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
[2026-05-26 19:37:07] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:37:07] [INFO ] Invariant cache hit.
[2026-05-26 19:37:07] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 1/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :55583 after 157051
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :157051 after 296750
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
[2026-05-26 19:37:46] [INFO ] Flatten gal took : 45 ms
[2026-05-26 19:37:46] [INFO ] Applying decomposition
[2026-05-26 19:37:46] [INFO ] Flatten gal took : 37 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/graph15661909346958747880.txt' '-o' '/tmp/graph15661909346958747880.bin' '-w' '/tmp/graph15661909346958747880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15661909346958747880.bin' '-l' '-1' '-v' '-w' '/tmp/graph15661909346958747880.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:37:46] [INFO ] Decomposing Gal with order
[2026-05-26 19:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:37:46] [INFO ] Removed a total of 1636 redundant transitions.
[2026-05-26 19:37:46] [INFO ] Flatten gal took : 166 ms
[2026-05-26 19:37:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2026-05-26 19:37:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2561425034642498658.gal : 15 ms
[2026-05-26 19:37:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3531452191218537090.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2561425034642498658.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3531452191218537090.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3531452191218537090.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :28 after 66
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :66 after 167
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :167 after 361
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :361 after 1596
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1596 after 3514
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3514 after 12250
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :12250 after 46061
SMT process timed out in 45388ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 38 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 14 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:37:53] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:37:53] [INFO ] Invariant cache hit.
[2026-05-26 19:37:53] [INFO ] Implicit Places using invariants in 408 ms returned []
[2026-05-26 19:37:53] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:37:53] [INFO ] Invariant cache hit.
[2026-05-26 19:37:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:37:55] [INFO ] Implicit Places using invariants and state equation in 2301 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
[2026-05-26 19:37:55] [INFO ] Redundant transitions in 46 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2776 ms. Remains : 406/406 places, 1113/1113 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 840 edges and 406 vertex of which 294 / 406 are part of one of the 42 SCC in 3 ms
Free SCC test removed 252 places
Drop transitions (Empty/Sink Transition effects.) removed 504 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 756 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 1 place count 154 transition count 315
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 112 transition count 315
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 98 transition count 308
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 113 place count 98 transition count 308
Applied a total of 113 rules in 19 ms. Remains 98 /406 variables (removed 308) and now considering 308/1113 (removed 805) 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-3321494952380194326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8533392816280175814.kers'
[2026-05-26 19:37:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3321494952380194326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8533392816280175814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 98 cols 1120 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-26 19:37:55] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8533392816280175814.kers
Total runtime 3 ms.
[2026-05-26 19:37:55] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 19:37:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2026-05-26 19:37:55] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 19:37:55] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 19:37:55] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-26 19:37:55] [INFO ] Flatten gal took : 18 ms
[2026-05-26 19:37:55] [INFO ] Flatten gal took : 17 ms
[2026-05-26 19:37:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9740123170723404862.gal : 3 ms
[2026-05-26 19:37:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14336917802935144927.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9740123170723404862.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14336917802935144927.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14336917802935144927.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :40 after 1632
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1632 after 248976
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :248976 after 1.99831e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :46061 after 125488
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.49884e+07,0.799262,25696,2,15401,10,102166,6,0,704,45556,0
Total reachable state count : 64988445

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,60992,0.800842,25748,2,1329,10,102166,7,0,713,45556,0
Over-approximation ignoring read arcs solved 0 properties in 1019 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[6]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10971636557718995368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11464380138624454549.kers'
[2026-05-26 19:37:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10971636557718995368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11464380138624454549.kers]
Normalized transition count is 903 out of 1113 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:37:56] [INFO ] Computed 20 invariants in 8 ms
Computed 20 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11464380138624454549.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1749 ms. (571 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 563 ms. (1773 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-26 19:37:59] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1611375552226618869.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18187366474964148.kers'
[2026-05-26 19:37:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1611375552226618869.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18187366474964148.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:37:59] [INFO ] Computed 20 invariants in 7 ms
Computed 20 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-18187366474964148.kers
Total runtime 9 ms.
[2026-05-26 19:37:59] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-26 19:37:59] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:37:59] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2026-05-26 19:37:59] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:37:59] [INFO ] [Real]Added 330 Read/Feed constraints in 37 ms returned sat
[2026-05-26 19:37:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:37:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-26 19:37:59] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:37:59] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2026-05-26 19:37:59] [INFO ] [Nat]Added 330 Read/Feed constraints in 95 ms returned sat
[2026-05-26 19:38:22] [INFO ] Trap strengthening (SAT) tested/added 76/76 trap constraints in 22537 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 14 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 14 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:38:22] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:38:22] [INFO ] Invariant cache hit.
[2026-05-26 19:38:22] [INFO ] Implicit Places using invariants in 445 ms returned []
[2026-05-26 19:38:22] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:38:22] [INFO ] Invariant cache hit.
[2026-05-26 19:38:23] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:38:25] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2026-05-26 19:38:25] [INFO ] Redundant transitions in 20 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2744 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
[2026-05-26 19:38:25] [INFO ] Flatten gal took : 67 ms
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
[2026-05-26 19:38:25] [INFO ] Flatten gal took : 53 ms
[2026-05-26 19:38:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4538564931972298954.gal : 11 ms
[2026-05-26 19:38:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5227219689843719170.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4538564931972298954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5227219689843719170.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5227219689843719170.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 140
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :140 after 315
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :315 after 560
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :560 after 2226
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2226 after 3903
Interrupted probabilistic random walk after 770096 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 2
Probabilistic random walk after 770096 steps, saw 103993 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
[2026-05-26 19:38:28] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:38:28] [INFO ] Invariant cache hit.
[2026-05-26 19:38:28] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :3903 after 10237
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 867 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10237 after 55583
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5943ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 13 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 789128 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 2
Probabilistic random walk after 789128 steps, saw 105843 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2026-05-26 19:38:37] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:38:37] [INFO ] Invariant cache hit.
[2026-05-26 19:38:37] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 847 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :55583 after 157051
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MAX0 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1224 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1264 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :157051 after 296750
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1304 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Detected timeout of ITS tools.
[2026-05-26 19:39:15] [INFO ] Flatten gal took : 32 ms
[2026-05-26 19:39:15] [INFO ] Applying decomposition
[2026-05-26 19:39:15] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12585490450011203133.txt' '-o' '/tmp/graph12585490450011203133.bin' '-w' '/tmp/graph12585490450011203133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12585490450011203133.bin' '-l' '-1' '-v' '-w' '/tmp/graph12585490450011203133.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:39:15] [INFO ] Decomposing Gal with order
[2026-05-26 19:39:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:39:15] [INFO ] Removed a total of 1621 redundant transitions.
[2026-05-26 19:39:15] [INFO ] Flatten gal took : 75 ms
[2026-05-26 19:39:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2026-05-26 19:39:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality767615219867077978.gal : 14 ms
[2026-05-26 19:39:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5832632979480808470.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality767615219867077978.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5832632979480808470.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality5832632979480808470.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 67
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :67 after 171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :171 after 406
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :406 after 1688
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1688 after 3833
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3833 after 12994
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :12994 after 58701
At refinement iteration 22 (INCLUDED_ONLY) 0/1309 variables, 20/1324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1328 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45014 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 164/164 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45870ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 22 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :58701 after 149319
Interrupted probabilistic random walk after 947568 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :0 out of 1
Probabilistic random walk after 947568 steps, saw 125551 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
[2026-05-26 19:39:26] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:39:26] [INFO ] Invariant cache hit.
[2026-05-26 19:39:26] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 1/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :149319 after 385217
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :385217 after 2.13544e+06
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
At refinement iteration 22 (INCLUDED_ONLY) 0/1309 variables, 20/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72152 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 179/179 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 22 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 13 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:40:38] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:40:38] [INFO ] Invariant cache hit.
[2026-05-26 19:40:39] [INFO ] Implicit Places using invariants in 432 ms returned []
[2026-05-26 19:40:39] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:40:39] [INFO ] Invariant cache hit.
[2026-05-26 19:40:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:40:41] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
[2026-05-26 19:40:41] [INFO ] Redundant transitions in 16 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2706 ms. Remains : 406/406 places, 1113/1113 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[5]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8228323945715275047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-295742336305093771.kers'
[2026-05-26 19:40:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8228323945715275047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-295742336305093771.kers]
Normalized transition count is 903 out of 1113 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:40:41] [INFO ] Computed 20 invariants in 8 ms
Computed 20 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-295742336305093771.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5]
RANDOM walk for 1000000 steps (2 resets) in 1689 ms. (591 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 558 ms. (1788 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[5]
[2026-05-26 19:40:43] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15753662444138615658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14438348444565538286.kers'
[2026-05-26 19:40:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15753662444138615658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14438348444565538286.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:40:43] [INFO ] Computed 20 invariants in 9 ms
Computed 20 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14438348444565538286.kers
Total runtime 11 ms.
[2026-05-26 19:40:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-26 19:40:44] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-26 19:40:44] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2026-05-26 19:40:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:40:44] [INFO ] [Real]Added 330 Read/Feed constraints in 35 ms returned sat
[2026-05-26 19:40:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:40:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-26 19:40:44] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:40:44] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2026-05-26 19:40:44] [INFO ] [Nat]Added 330 Read/Feed constraints in 94 ms returned sat
[2026-05-26 19:41:07] [INFO ] Trap strengthening (SAT) tested/added 76/76 trap constraints in 22484 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[5]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:41:07] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:41:07] [INFO ] Invariant cache hit.
[2026-05-26 19:41:07] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-26 19:41:07] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:41:07] [INFO ] Invariant cache hit.
[2026-05-26 19:41:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:41:09] [INFO ] Implicit Places using invariants and state equation in 2317 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
[2026-05-26 19:41:09] [INFO ] Redundant transitions in 16 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2781 ms. Remains : 406/406 places, 1113/1113 transitions.
[2026-05-26 19:41:09] [INFO ] Flatten gal took : 34 ms
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2026-05-26 19:41:09] [INFO ] Flatten gal took : 37 ms
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
[2026-05-26 19:41:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11926448268908590336.gal : 9 ms
[2026-05-26 19:41:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1638531621912724000.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11926448268908590336.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1638531621912724000.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1638531621912724000.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 140
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :140 after 315
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :315 after 560
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :560 after 2226
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2226 after 3903
Interrupted probabilistic random walk after 771768 steps, run timeout after 3003 ms. (steps per millisecond=256 ) properties seen :0 out of 2
Probabilistic random walk after 771768 steps, saw 104140 distinct states, run finished after 3003 ms. (steps per millisecond=256 ) properties seen :0
[2026-05-26 19:41:12] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:41:12] [INFO ] Invariant cache hit.
[2026-05-26 19:41:13] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3903 after 10237
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 589 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10237 after 55583
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5666ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 123 ms.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 13 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 796288 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 2
Probabilistic random walk after 796288 steps, saw 106753 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
[2026-05-26 19:41:21] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:41:21] [INFO ] Invariant cache hit.
[2026-05-26 19:41:21] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 601 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :55583 after 157051
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MAX0 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1264 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :157051 after 296750
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1304 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Detected timeout of ITS tools.
[2026-05-26 19:42:00] [INFO ] Flatten gal took : 18 ms
[2026-05-26 19:42:00] [INFO ] Applying decomposition
[2026-05-26 19:42:00] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9052034673152320537.txt' '-o' '/tmp/graph9052034673152320537.bin' '-w' '/tmp/graph9052034673152320537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9052034673152320537.bin' '-l' '-1' '-v' '-w' '/tmp/graph9052034673152320537.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:42:00] [INFO ] Decomposing Gal with order
[2026-05-26 19:42:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:42:00] [INFO ] Removed a total of 1621 redundant transitions.
[2026-05-26 19:42:00] [INFO ] Flatten gal took : 48 ms
[2026-05-26 19:42:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2026-05-26 19:42:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1401814134579298870.gal : 6 ms
[2026-05-26 19:42:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17319550264888643872.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1401814134579298870.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17319550264888643872.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17319550264888643872.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :28 after 67
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :67 after 170
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :170 after 426
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :426 after 1713
At refinement iteration 22 (INCLUDED_ONLY) 0/1309 variables, 20/1324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1713 after 3795
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3795 after 12215
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :12215 after 55660
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1337 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45007 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 173/173 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45615ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 15 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :55660 after 143271
Interrupted probabilistic random walk after 943408 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :0 out of 1
Probabilistic random walk after 943408 steps, saw 125338 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
[2026-05-26 19:42:10] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:42:10] [INFO ] Invariant cache hit.
[2026-05-26 19:42:10] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 1/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :143271 after 383066
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :383066 after 2.03841e+06
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
At refinement iteration 22 (INCLUDED_ONLY) 0/1309 variables, 20/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72137 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 179/179 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 20 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:43:23] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:43:23] [INFO ] Invariant cache hit.
[2026-05-26 19:43:23] [INFO ] Implicit Places using invariants in 428 ms returned []
[2026-05-26 19:43:23] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:43:23] [INFO ] Invariant cache hit.
[2026-05-26 19:43:23] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:43:25] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned []
Implicit Place search using SMT with State Equation took 2684 ms to find 0 implicit places.
[2026-05-26 19:43:25] [INFO ] Redundant transitions in 16 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2716 ms. Remains : 406/406 places, 1113/1113 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[4]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7955500395780552451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11682821011174602694.kers'
[2026-05-26 19:43:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7955500395780552451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11682821011174602694.kers]
Normalized transition count is 903 out of 1113 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:43:25] [INFO ] Computed 20 invariants in 4 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11682821011174602694.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1685 ms. (593 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 561 ms. (1779 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2026-05-26 19:43:28] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14861208920390857673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13287922733548430021.kers'
[2026-05-26 19:43:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14861208920390857673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13287922733548430021.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:43:28] [INFO ] Computed 20 invariants in 8 ms
Computed 20 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13287922733548430021.kers
Total runtime 10 ms.
[2026-05-26 19:43:28] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-26 19:43:28] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:43:28] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-26 19:43:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:43:28] [INFO ] [Real]Added 330 Read/Feed constraints in 34 ms returned sat
[2026-05-26 19:43:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:43:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2026-05-26 19:43:28] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:43:28] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-26 19:43:28] [INFO ] [Nat]Added 330 Read/Feed constraints in 95 ms returned sat
[2026-05-26 19:43:51] [INFO ] Trap strengthening (SAT) tested/added 76/76 trap constraints in 22481 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 14 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 13 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:43:51] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:43:51] [INFO ] Invariant cache hit.
[2026-05-26 19:43:51] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-26 19:43:51] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:43:51] [INFO ] Invariant cache hit.
[2026-05-26 19:43:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:43:53] [INFO ] Implicit Places using invariants and state equation in 2286 ms returned []
Implicit Place search using SMT with State Equation took 2725 ms to find 0 implicit places.
[2026-05-26 19:43:54] [INFO ] Redundant transitions in 17 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2765 ms. Remains : 406/406 places, 1113/1113 transitions.
[2026-05-26 19:43:54] [INFO ] Flatten gal took : 19 ms
[2026-05-26 19:43:54] [INFO ] Flatten gal took : 18 ms
[2026-05-26 19:43:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12910061777715753279.gal : 4 ms
[2026-05-26 19:43:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14539273101045338874.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12910061777715753279.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14539273101045338874.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14539273101045338874.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 140
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :140 after 315
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :315 after 560
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :560 after 2226
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2226 after 3903
Interrupted probabilistic random walk after 779768 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 2
Probabilistic random walk after 779768 steps, saw 104869 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2026-05-26 19:43:57] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:43:57] [INFO ] Invariant cache hit.
[2026-05-26 19:43:57] [INFO ] State equation strengthened by 330 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3903 after 10237
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 639 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10237 after 55583
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5007 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5653ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 24 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 792144 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 2
Probabilistic random walk after 792144 steps, saw 106156 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2026-05-26 19:44:05] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:44:05] [INFO ] Invariant cache hit.
[2026-05-26 19:44:05] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 664 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :55583 after 157051
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :157051 after 296750
Problem MAX0 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1264 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1304 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Detected timeout of ITS tools.
[2026-05-26 19:44:44] [INFO ] Flatten gal took : 24 ms
[2026-05-26 19:44:44] [INFO ] Applying decomposition
[2026-05-26 19:44:44] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15357455368568062683.txt' '-o' '/tmp/graph15357455368568062683.bin' '-w' '/tmp/graph15357455368568062683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15357455368568062683.bin' '-l' '-1' '-v' '-w' '/tmp/graph15357455368568062683.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:44:44] [INFO ] Decomposing Gal with order
[2026-05-26 19:44:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:44:44] [INFO ] Removed a total of 1617 redundant transitions.
[2026-05-26 19:44:44] [INFO ] Flatten gal took : 65 ms
[2026-05-26 19:44:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 29 ms.
[2026-05-26 19:44:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8889642842603924371.gal : 6 ms
[2026-05-26 19:44:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6896929119206327607.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8889642842603924371.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6896929119206327607.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6896929119206327607.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 74
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :74 after 184
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :184 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1516
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1516 after 5958
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5958 after 17174
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :17174 after 78878
At refinement iteration 22 (INCLUDED_ONLY) 0/1309 variables, 20/1324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1329 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45013 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 165/165 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45684ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 17 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :78878 after 264423
Interrupted probabilistic random walk after 941752 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 941752 steps, saw 125153 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2026-05-26 19:44:54] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:44:54] [INFO ] Invariant cache hit.
[2026-05-26 19:44:54] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 1/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :264423 after 507792
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
At refinement iteration 22 (INCLUDED_ONLY) 0/1309 variables, 20/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71291 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 179/179 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71623ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:46:06] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:46:06] [INFO ] Invariant cache hit.
[2026-05-26 19:46:06] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-26 19:46:06] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:46:06] [INFO ] Invariant cache hit.
[2026-05-26 19:46:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:46:09] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned []
Implicit Place search using SMT with State Equation took 2645 ms to find 0 implicit places.
[2026-05-26 19:46:09] [INFO ] Redundant transitions in 15 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2677 ms. Remains : 406/406 places, 1113/1113 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[1] Max Struct:[3]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10893367147992096687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6184500407622266204.kers'
[2026-05-26 19:46:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10893367147992096687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6184500407622266204.kers]
Normalized transition count is 903 out of 1113 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:46:09] [INFO ] Computed 20 invariants in 8 ms
Computed 20 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6184500407622266204.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 1724 ms. (579 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 557 ms. (1792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2026-05-26 19:46:11] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-879493041014484284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2453234764531239020.kers'
[2026-05-26 19:46:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-879493041014484284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2453234764531239020.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:46:11] [INFO ] Computed 20 invariants in 7 ms
Computed 20 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2453234764531239020.kers
Total runtime 10 ms.
[2026-05-26 19:46:11] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-26 19:46:11] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:46:11] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2026-05-26 19:46:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:46:11] [INFO ] [Real]Added 330 Read/Feed constraints in 38 ms returned sat
[2026-05-26 19:46:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:46:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-26 19:46:11] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:46:11] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2026-05-26 19:46:12] [INFO ] [Nat]Added 330 Read/Feed constraints in 99 ms returned sat
[2026-05-26 19:46:34] [INFO ] Trap strengthening (SAT) tested/added 76/76 trap constraints in 22128 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:46:34] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:46:34] [INFO ] Invariant cache hit.
[2026-05-26 19:46:34] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-05-26 19:46:34] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:46:34] [INFO ] Invariant cache hit.
[2026-05-26 19:46:34] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:46:36] [INFO ] Implicit Places using invariants and state equation in 2250 ms returned []
Implicit Place search using SMT with State Equation took 2671 ms to find 0 implicit places.
[2026-05-26 19:46:36] [INFO ] Redundant transitions in 17 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2710 ms. Remains : 406/406 places, 1113/1113 transitions.
[2026-05-26 19:46:36] [INFO ] Flatten gal took : 21 ms
[2026-05-26 19:46:36] [INFO ] Flatten gal took : 16 ms
[2026-05-26 19:46:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5552200597966232084.gal : 4 ms
[2026-05-26 19:46:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12169504271204537570.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5552200597966232084.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12169504271204537570.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12169504271204537570.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 140
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :140 after 315
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :315 after 560
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :560 after 2226
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2226 after 3903
Interrupted probabilistic random walk after 786712 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 2
Probabilistic random walk after 786712 steps, saw 105502 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2026-05-26 19:46:40] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:46:40] [INFO ] Invariant cache hit.
[2026-05-26 19:46:40] [INFO ] State equation strengthened by 330 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3903 after 10237
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 640 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10237 after 55583
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5655ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 25 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 801608 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 2
Probabilistic random walk after 801608 steps, saw 107399 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
[2026-05-26 19:46:48] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:46:48] [INFO ] Invariant cache hit.
[2026-05-26 19:46:48] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 638 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :55583 after 157051
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :157051 after 296750
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-26 19:47:27] [INFO ] Flatten gal took : 14 ms
[2026-05-26 19:47:27] [INFO ] Applying decomposition
[2026-05-26 19:47:27] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10682418249270869722.txt' '-o' '/tmp/graph10682418249270869722.bin' '-w' '/tmp/graph10682418249270869722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10682418249270869722.bin' '-l' '-1' '-v' '-w' '/tmp/graph10682418249270869722.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:47:27] [INFO ] Decomposing Gal with order
[2026-05-26 19:47:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:47:27] [INFO ] Removed a total of 1626 redundant transitions.
[2026-05-26 19:47:27] [INFO ] Flatten gal took : 41 ms
[2026-05-26 19:47:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2026-05-26 19:47:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16635566712708855710.gal : 5 ms
[2026-05-26 19:47:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1659525341064001260.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16635566712708855710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1659525341064001260.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1659525341064001260.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 28
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :28 after 66
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :66 after 170
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :170 after 435
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :435 after 1729
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1729 after 3876
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3876 after 12428
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :12428 after 57423
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45012 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 149/149 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45655ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 17 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 16 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:47:34] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:47:34] [INFO ] Invariant cache hit.
[2026-05-26 19:47:34] [INFO ] Implicit Places using invariants in 423 ms returned []
[2026-05-26 19:47:34] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:47:34] [INFO ] Invariant cache hit.
[2026-05-26 19:47:35] [INFO ] State equation strengthened by 330 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :57423 after 150107
[2026-05-26 19:47:37] [INFO ] Implicit Places using invariants and state equation in 2241 ms returned []
Implicit Place search using SMT with State Equation took 2666 ms to find 0 implicit places.
[2026-05-26 19:47:37] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2704 ms. Remains : 406/406 places, 1113/1113 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 840 edges and 406 vertex of which 294 / 406 are part of one of the 42 SCC in 11 ms
Free SCC test removed 252 places
Drop transitions (Empty/Sink Transition effects.) removed 504 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 756 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 1 place count 154 transition count 315
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 112 transition count 315
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 98 transition count 308
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 113 place count 98 transition count 308
Applied a total of 113 rules in 28 ms. Remains 98 /406 variables (removed 308) and now considering 308/1113 (removed 805) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14105629728952999640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17115625698314160517.kers'
[2026-05-26 19:47:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14105629728952999640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17115625698314160517.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 98 cols 1120 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-26 19:47:37] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17115625698314160517.kers
Total runtime 2 ms.
[2026-05-26 19:47:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2026-05-26 19:47:37] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 19:47:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2026-05-26 19:47:37] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 19:47:37] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 19:47:37] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-26 19:47:37] [INFO ] Flatten gal took : 5 ms
[2026-05-26 19:47:37] [INFO ] Flatten gal took : 9 ms
[2026-05-26 19:47:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4837067633641003734.gal : 1 ms
[2026-05-26 19:47:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8494316500303764527.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4837067633641003734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8494316500303764527.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8494316500303764527.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 1632
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1632 after 248976
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :248976 after 1.99831e+07
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.99831e+07 after 6.49884e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.49884e+07 after 6.50609e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6.50609e+07 after 6.5183e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.5183e+07 after 6.52699e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.52699e+07 after 6.53203e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.53203e+07 after 6.67591e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.67591e+07 after 7.26418e+07
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.50194e+08,1.82902,38404,2,14460,18,153958,6,0,704,72968,0
Total reachable state count : 250193524

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,21540,1.83053,38404,2,706,18,153958,7,0,715,72968,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,80576,1.83171,38404,2,1372,18,153958,8,0,723,72968,0
Over-approximation ignoring read arcs solved 0 properties in 2152 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting property specific reduction for Peterson-PT-6-UpperBounds-01
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-963620530925942460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11018474731076325300.kers'
[2026-05-26 19:47:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-963620530925942460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11018474731076325300.kers]
Normalized transition count is 903 out of 1113 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:47:39] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11018474731076325300.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (2 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2026-05-26 19:47:39] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3212552937524253271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9284746963446047230.kers'
[2026-05-26 19:47:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3212552937524253271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9284746963446047230.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:47:39] [INFO ] Computed 20 invariants in 6 ms
Computed 20 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9284746963446047230.kers
Total runtime 8 ms.
[2026-05-26 19:47:39] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-26 19:47:39] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:47:39] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-26 19:47:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:47:39] [INFO ] [Real]Added 330 Read/Feed constraints in 33 ms returned sat
[2026-05-26 19:47:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:47:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-26 19:47:39] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:47:39] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2026-05-26 19:47:40] [INFO ] [Nat]Added 330 Read/Feed constraints in 92 ms returned sat
[2026-05-26 19:47:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:820)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 14 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 406/406 places, 1113/1113 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3079487335539821967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11861943336278254866.kers'
[2026-05-26 19:47:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3079487335539821967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11861943336278254866.kers]
Normalized transition count is 903 out of 1113 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:47:44] [INFO ] Computed 20 invariants in 9 ms
Computed 20 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11861943336278254866.kers
Total runtime 11 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 1728 ms. (578 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 564 ms. (1769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2026-05-26 19:47:47] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16783162699871197412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12809418722402095748.kers'
[2026-05-26 19:47:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16783162699871197412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12809418722402095748.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 903 rows 399 cols 2310 entries
Finished phase 1 with 379 SingleSign rule and 7 generalized
[2026-05-26 19:47:47] [INFO ] Computed 20 invariants in 6 ms
Computed 20 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12809418722402095748.kers
Total runtime 7 ms.
[2026-05-26 19:47:47] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-26 19:47:47] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-26 19:47:47] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2026-05-26 19:47:47] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:47:47] [INFO ] [Real]Added 330 Read/Feed constraints in 33 ms returned sat
[2026-05-26 19:47:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 19:47:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-26 19:47:47] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 19:47:47] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2026-05-26 19:47:47] [INFO ] [Nat]Added 330 Read/Feed constraints in 96 ms returned sat
[2026-05-26 19:48:10] [INFO ] Trap strengthening (SAT) tested/added 76/76 trap constraints in 22258 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 11 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 11 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:48:10] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:48:10] [INFO ] Invariant cache hit.
[2026-05-26 19:48:10] [INFO ] Implicit Places using invariants in 419 ms returned []
[2026-05-26 19:48:10] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:48:10] [INFO ] Invariant cache hit.
[2026-05-26 19:48:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2026-05-26 19:48:12] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
[2026-05-26 19:48:12] [INFO ] Redundant transitions in 17 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2710 ms. Remains : 406/406 places, 1113/1113 transitions.
[2026-05-26 19:48:12] [INFO ] Flatten gal took : 19 ms
[2026-05-26 19:48:12] [INFO ] Flatten gal took : 15 ms
[2026-05-26 19:48:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6132812651283316900.gal : 4 ms
[2026-05-26 19:48:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7323964731755609943.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6132812651283316900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7323964731755609943.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7323964731755609943.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 99
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :99 after 140
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :140 after 315
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :315 after 560
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :560 after 2226
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2226 after 3903
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3903 after 10237
Interrupted probabilistic random walk after 792064 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 2
Probabilistic random walk after 792064 steps, saw 106155 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2026-05-26 19:48:15] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:48:15] [INFO ] Invariant cache hit.
[2026-05-26 19:48:15] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 620 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10237 after 55583
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5006 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5632ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 19 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 801440 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 2
Probabilistic random walk after 801440 steps, saw 107394 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
[2026-05-26 19:48:24] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:48:24] [INFO ] Invariant cache hit.
[2026-05-26 19:48:24] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1309 variables, 42/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 42/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 6/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1309 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 1162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 625 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 350/357 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/364 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 903/1267 variables, 364/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1267 variables, 330/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1267 variables, 2/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 42/1309 variables, 42/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 42/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 6/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :55583 after 157051
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/1184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1309 variables, 20/1224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1309 variables, 20/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1309 variables, 20/1264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :157051 after 296750
At refinement iteration 20 (INCLUDED_ONLY) 0/1309 variables, 20/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
[2026-05-26 19:49:03] [INFO ] Flatten gal took : 18 ms
[2026-05-26 19:49:03] [INFO ] Applying decomposition
[2026-05-26 19:49:03] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3649798904108258769.txt' '-o' '/tmp/graph3649798904108258769.bin' '-w' '/tmp/graph3649798904108258769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3649798904108258769.bin' '-l' '-1' '-v' '-w' '/tmp/graph3649798904108258769.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:49:03] [INFO ] Decomposing Gal with order
[2026-05-26 19:49:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:49:03] [INFO ] Removed a total of 1631 redundant transitions.
[2026-05-26 19:49:03] [INFO ] Flatten gal took : 46 ms
[2026-05-26 19:49:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 41 ms.
[2026-05-26 19:49:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6361421528777003470.gal : 5 ms
[2026-05-26 19:49:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13487241988857422158.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6361421528777003470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13487241988857422158.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13487241988857422158.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :22 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 36
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :36 after 239
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :239 after 536
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :536 after 2564
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2564 after 6034
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6034 after 14114
At refinement iteration 21 (INCLUDED_ONLY) 0/1309 variables, 20/1304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14114 after 95742
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 1307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45006 ms.
Refiners :[Domain max(s): 406/406 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 143/143 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45638ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 22 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 11 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2026-05-26 19:49:10] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:49:10] [INFO ] Invariant cache hit.
[2026-05-26 19:49:10] [INFO ] Implicit Places using invariants in 402 ms returned []
[2026-05-26 19:49:10] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2026-05-26 19:49:10] [INFO ] Invariant cache hit.
[2026-05-26 19:49:11] [INFO ] State equation strengthened by 330 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :95742 after 189678
[2026-05-26 19:49:13] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
[2026-05-26 19:49:13] [INFO ] Redundant transitions in 17 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2667 ms. Remains : 406/406 places, 1113/1113 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 840 edges and 406 vertex of which 294 / 406 are part of one of the 42 SCC in 1 ms
Free SCC test removed 252 places
Drop transitions (Empty/Sink Transition effects.) removed 504 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 756 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 1 place count 154 transition count 315
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 112 transition count 315
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 98 transition count 308
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 113 place count 98 transition count 308
Applied a total of 113 rules in 10 ms. Remains 98 /406 variables (removed 308) and now considering 308/1113 (removed 805) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9807835860974854611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14293069722935076823.kers'
[2026-05-26 19:49:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9807835860974854611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14293069722935076823.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 98 cols 1120 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-26 19:49:13] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14293069722935076823.kers
Total runtime 2 ms.
[2026-05-26 19:49:13] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2026-05-26 19:49:13] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 19:49:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2026-05-26 19:49:13] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 19:49:13] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 19:49:13] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-26 19:49:13] [INFO ] Flatten gal took : 7 ms
[2026-05-26 19:49:13] [INFO ] Flatten gal took : 5 ms
[2026-05-26 19:49:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16354721894519941610.gal : 1 ms
[2026-05-26 19:49:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4701653047791013105.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16354721894519941610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4701653047791013105.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4701653047791013105.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 1632
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1632 after 248976
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :248976 after 1.99831e+07
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.99831e+07 after 6.49884e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.49884e+07 after 6.50609e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6.50609e+07 after 6.5183e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.5183e+07 after 6.52699e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.52699e+07 after 6.53203e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.53203e+07 after 6.67591e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.67591e+07 after 7.26418e+07
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.50194e+08,1.75733,38608,2,14460,18,153958,6,0,704,72968,0
Total reachable state count : 250193524

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,21540,1.75872,38608,2,706,18,153958,7,0,715,72968,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,80576,1.75981,38608,2,1372,18,153958,8,0,723,72968,0
Over-approximation ignoring read arcs solved 0 properties in 2052 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for Peterson-PT-6-UpperBounds-01 in 95790 ms.
[2026-05-26 19:49:15] [INFO ] Flatten gal took : 15 ms
[2026-05-26 19:49:15] [INFO ] Applying decomposition
[2026-05-26 19:49:15] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15147903447201575.txt' '-o' '/tmp/graph15147903447201575.bin' '-w' '/tmp/graph15147903447201575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15147903447201575.bin' '-l' '-1' '-v' '-w' '/tmp/graph15147903447201575.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:49:15] [INFO ] Decomposing Gal with order
[2026-05-26 19:49:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:49:15] [INFO ] Removed a total of 1575 redundant transitions.
[2026-05-26 19:49:15] [INFO ] Flatten gal took : 41 ms
[2026-05-26 19:49:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 412 labels/synchronizations in 15 ms.
[2026-05-26 19:49:15] [INFO ] Time to serialize gal into /tmp/UpperBounds10954544748789331899.gal : 6 ms
[2026-05-26 19:49:15] [INFO ] Time to serialize properties into /tmp/UpperBounds6223017870258013715.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10954544748789331899.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6223017870258013715.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds6223017870258013715.prop.
Detected timeout of ITS tools.
[2026-05-26 20:14:45] [INFO ] Applying decomposition
[2026-05-26 20:14:45] [INFO ] Flatten gal took : 148 ms
[2026-05-26 20:14:45] [INFO ] Decomposing Gal with order
[2026-05-26 20:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 20:14:46] [INFO ] Removed a total of 1354 redundant transitions.
[2026-05-26 20:14:46] [INFO ] Flatten gal took : 515 ms
[2026-05-26 20:14:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 72 ms.
[2026-05-26 20:14:46] [INFO ] Time to serialize gal into /tmp/UpperBounds15987643163503194533.gal : 19 ms
[2026-05-26 20:14:46] [INFO ] Time to serialize properties into /tmp/UpperBounds14587678706200003143.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15987643163503194533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14587678706200003143.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds14587678706200003143.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="Peterson-PT-6"
export BK_EXAMINATION="UpperBounds"
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 Peterson-PT-6, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914300733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;