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.r175-smll-177961111800025.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 gold2025
Input is JoinFreeModules-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-177961111800025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.2K Mar 7 16:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 16:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 11:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 7 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 7 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 11:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 613K 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 JoinFreeModules-PT-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779736766175

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 19:19:28] [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-25 19:19:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:19:29] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2026-05-25 19:19:29] [INFO ] Transformed 1001 places.
[2026-05-25 19:19:29] [INFO ] Transformed 1601 transitions.
[2026-05-25 19:19:29] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 629 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[200, 0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 200, 1, 0, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[200, 0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 200, 1, 0, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1601 rows 1000 cols
[2026-05-25 19:19:29] [INFO ] Computed 200 invariants in 84 ms
Current structural bounds on expressions (after invariants) : Max Seen:[200, 0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 200, 1, 0, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 10040 steps (2 resets) in 190 ms. (52 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 2631 ms. (60 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200, 9, 12, 10, 100, 2, 9, 10, 9, 9, 10, 100, 200, 10, 9, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2026-05-25 19:19:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:33] [INFO ] [Real]Absence check using 200 positive place invariants in 145 ms returned sat
[2026-05-25 19:19:34] [INFO ] [Real]Absence check using state equation in 1119 ms returned sat
[2026-05-25 19:19:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:35] [INFO ] [Nat]Absence check using 200 positive place invariants in 89 ms returned sat
[2026-05-25 19:19:36] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2026-05-25 19:19:36] [INFO ] State equation strengthened by 200 read => feed constraints.
[2026-05-25 19:19:36] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:19:37] [INFO ] [Nat]Added 200 Read/Feed constraints in 1045 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:37] [INFO ] [Real]Absence check using 200 positive place invariants in 58 ms returned sat
[2026-05-25 19:19:38] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2026-05-25 19:19:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 80 ms returned sat
[2026-05-25 19:19:39] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2026-05-25 19:19:39] [INFO ] [Nat]Added 200 Read/Feed constraints in 358 ms returned sat
[2026-05-25 19:19:40] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 158 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:43] [INFO ] [Real]Absence check using 200 positive place invariants in 105 ms returned sat
[2026-05-25 19:19:44] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2026-05-25 19:19:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 99 ms returned sat
[2026-05-25 19:19:46] [INFO ] [Nat]Absence check using state equation in 1514 ms returned sat
[2026-05-25 19:19:47] [INFO ] [Nat]Added 200 Read/Feed constraints in 385 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:47] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:47] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:47] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:47] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:48] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:48] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:48] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:48] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:48] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:49] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:19:49] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 7 ms to minimize.
[2026-05-25 19:19:49] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2192 ms
[2026-05-25 19:19:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2193 ms
[2026-05-25 19:19:49] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 189 ms.
[2026-05-25 19:19:49] [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 2
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:50] [INFO ] [Real]Absence check using 200 positive place invariants in 103 ms returned sat
[2026-05-25 19:19:51] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2026-05-25 19:19:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 65 ms returned sat
[2026-05-25 19:19:52] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2026-05-25 19:19:53] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:19:53] [INFO ] [Nat]Added 200 Read/Feed constraints in 1040 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:53] [INFO ] [Real]Absence check using 200 positive place invariants in 60 ms returned sat
[2026-05-25 19:19:54] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2026-05-25 19:19:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 104 ms returned sat
[2026-05-25 19:19:55] [INFO ] [Nat]Absence check using state equation in 984 ms returned sat
[2026-05-25 19:19:56] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:19:56] [INFO ] [Nat]Added 200 Read/Feed constraints in 1024 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:56] [INFO ] [Real]Absence check using 200 positive place invariants in 59 ms returned sat
[2026-05-25 19:19:57] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2026-05-25 19:19:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:19:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 59 ms returned sat
[2026-05-25 19:19:58] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2026-05-25 19:19:58] [INFO ] [Nat]Added 200 Read/Feed constraints in 58 ms returned sat
[2026-05-25 19:19:59] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 186 ms.
[2026-05-25 19:20:01] [INFO ] Added : 50 causal constraints over 10 iterations in 2676 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:01] [INFO ] [Real]Absence check using 200 positive place invariants in 59 ms returned sat
[2026-05-25 19:20:02] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2026-05-25 19:20:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 64 ms returned sat
[2026-05-25 19:20:03] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2026-05-25 19:20:04] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:04] [INFO ] [Nat]Added 200 Read/Feed constraints in 1022 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:04] [INFO ] [Real]Absence check using 200 positive place invariants in 62 ms returned sat
[2026-05-25 19:20:05] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2026-05-25 19:20:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 58 ms returned sat
[2026-05-25 19:20:06] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2026-05-25 19:20:07] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:07] [INFO ] [Nat]Added 200 Read/Feed constraints in 962 ms returned sat
[2026-05-25 19:20:07] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 114 ms.
[2026-05-25 19:20:10] [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 7
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:11] [INFO ] [Real]Absence check using 200 positive place invariants in 99 ms returned sat
[2026-05-25 19:20:12] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2026-05-25 19:20:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 61 ms returned sat
[2026-05-25 19:20:13] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2026-05-25 19:20:13] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:14] [INFO ] [Nat]Added 200 Read/Feed constraints in 991 ms returned sat
[2026-05-25 19:20:14] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 113 ms.
Maximisation of solution failed !
Minimization took 9 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:17] [INFO ] [Real]Absence check using 200 positive place invariants in 101 ms returned sat
[2026-05-25 19:20:18] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2026-05-25 19:20:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 69 ms returned sat
[2026-05-25 19:20:19] [INFO ] [Nat]Absence check using state equation in 839 ms returned sat
[2026-05-25 19:20:20] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:20] [INFO ] [Nat]Added 200 Read/Feed constraints in 856 ms returned sat
[2026-05-25 19:20:20] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 111 ms.
[2026-05-25 19:20:23] [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 9
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:24] [INFO ] [Real]Absence check using 200 positive place invariants in 103 ms returned sat
[2026-05-25 19:20:24] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2026-05-25 19:20:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 63 ms returned sat
[2026-05-25 19:20:25] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2026-05-25 19:20:26] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:26] [INFO ] [Nat]Added 200 Read/Feed constraints in 1025 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:27] [INFO ] [Real]Absence check using 200 positive place invariants in 59 ms returned sat
[2026-05-25 19:20:27] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2026-05-25 19:20:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 60 ms returned sat
[2026-05-25 19:20:28] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2026-05-25 19:20:29] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:29] [INFO ] [Nat]Added 200 Read/Feed constraints in 960 ms returned sat
[2026-05-25 19:20:29] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 103 ms.
[2026-05-25 19:20:32] [INFO ] Added : 90 causal constraints over 18 iterations in 3003 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:33] [INFO ] [Real]Absence check using 200 positive place invariants in 104 ms returned sat
[2026-05-25 19:20:34] [INFO ] [Real]Absence check using state equation in 925 ms returned sat
[2026-05-25 19:20:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 72 ms returned sat
[2026-05-25 19:20:35] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2026-05-25 19:20:35] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:36] [INFO ] [Nat]Added 200 Read/Feed constraints in 781 ms returned sat
[2026-05-25 19:20:36] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 107 ms.
[2026-05-25 19:20:38] [INFO ] Added : 45 causal constraints over 9 iterations in 2032 ms. Result :sat
Minimization took 505 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:38] [INFO ] [Real]Absence check using 200 positive place invariants in 62 ms returned sat
[2026-05-25 19:20:39] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2026-05-25 19:20:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:39] [INFO ] [Nat]Absence check using 200 positive place invariants in 62 ms returned sat
[2026-05-25 19:20:40] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2026-05-25 19:20:41] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:41] [INFO ] [Nat]Added 200 Read/Feed constraints in 635 ms returned sat
[2026-05-25 19:20:41] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 101 ms.
[2026-05-25 19:20:44] [INFO ] Added : 95 causal constraints over 19 iterations in 3178 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:45] [INFO ] [Real]Absence check using 200 positive place invariants in 103 ms returned sat
[2026-05-25 19:20:45] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2026-05-25 19:20:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 107 ms returned sat
[2026-05-25 19:20:47] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2026-05-25 19:20:47] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:20:48] [INFO ] [Nat]Added 200 Read/Feed constraints in 844 ms returned sat
[2026-05-25 19:20:48] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 106 ms.
[2026-05-25 19:20:50] [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 14
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:51] [INFO ] [Real]Absence check using 200 positive place invariants in 108 ms returned sat
[2026-05-25 19:20:52] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2026-05-25 19:20:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:20:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 64 ms returned sat
[2026-05-25 19:20:53] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2026-05-25 19:20:53] [INFO ] [Nat]Added 200 Read/Feed constraints in 35 ms returned sat
[2026-05-25 19:20:53] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 115 ms.
[2026-05-25 19:20:55] [INFO ] Added : 50 causal constraints over 10 iterations in 2235 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[200, 9, 12, 10, 100, 2, 9, 10, 9, 9, 10, 100, 200, 10, 9, 2] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200, 101, 200, 13, 100, 24, 105, 201, 9, 104, 10, 200, 200, 18, 104, 18] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.5 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions (Output transitions of discarded places.) removed 1472 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 41 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2026-05-25 19:22:55] [INFO ] Computed 16 invariants in 1 ms
[2026-05-25 19:22:55] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5192 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 13617 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18885ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 18896ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18953 ms. Remains : 80/1000 places, 128/1601 transitions.
[2026-05-25 19:23:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[200, 101, 200, 13, 100, 24, 105, 201, 9, 104, 10, 200, 200, 18, 104, 18] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000097 steps (2 resets) in 1802 ms. (554 steps per ms)
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 15000015 steps (30 resets) in 22246 ms. (674 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200, 200, 201, 197, 194, 200, 201, 198, 198, 201, 202, 200, 201, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2026-05-25 19:23:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:38] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:23:38] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:23:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-25 19:23:38] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2026-05-25 19:23:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 19:23:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 131 ms returned sat
[2026-05-25 19:23:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:23:39] [INFO ] Added : 50 causal constraints over 11 iterations in 260 ms. Result :sat
Minimization took 67 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:39] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:39] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:39] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2026-05-25 19:23:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 322 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:23:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2026-05-25 19:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2026-05-25 19:23:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:23:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2026-05-25 19:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2026-05-25 19:23:40] [INFO ] Added : 46 causal constraints over 10 iterations in 190 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:40] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:23:40] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-25 19:23:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:23:40] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:23:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 233 ms returned sat
[2026-05-25 19:23:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:23:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
[2026-05-25 19:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2026-05-25 19:23:41] [INFO ] Added : 66 causal constraints over 14 iterations in 330 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:41] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:41] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:41] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-25 19:23:41] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2026-05-25 19:23:41] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 19:23:42] [INFO ] Added : 68 causal constraints over 15 iterations in 510 ms. Result :sat
Minimization took 119 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:42] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:23:42] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-25 19:23:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:23:42] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-25 19:23:42] [INFO ] [Nat]Added 16 Read/Feed constraints in 139 ms returned sat
[2026-05-25 19:23:42] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:23:42] [INFO ] Added : 54 causal constraints over 12 iterations in 335 ms. Result :sat
Minimization took 87 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:43] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:23:43] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-25 19:23:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-25 19:23:43] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:23:43] [INFO ] [Nat]Added 16 Read/Feed constraints in 56 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:23:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2026-05-25 19:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2026-05-25 19:23:43] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:23:43] [INFO ] Added : 62 causal constraints over 14 iterations in 155 ms. Result :sat
Minimization took 44 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:43] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:23:43] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2026-05-25 19:23:44] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2026-05-25 19:23:44] [INFO ] [Nat]Added 16 Read/Feed constraints in 209 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:23:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
[2026-05-25 19:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-25 19:23:44] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:23:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2026-05-25 19:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2026-05-25 19:23:44] [INFO ] Added : 46 causal constraints over 11 iterations in 352 ms. Result :sat
Minimization took 71 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:44] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:44] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 19:23:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:23:44] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:44] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2026-05-25 19:23:45] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:23:45] [INFO ] Added : 54 causal constraints over 11 iterations in 448 ms. Result :sat
Minimization took 73 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:45] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:45] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:46] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2026-05-25 19:23:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 173 ms returned sat
[2026-05-25 19:23:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-25 19:23:46] [INFO ] Added : 41 causal constraints over 9 iterations in 161 ms. Result :sat
Minimization took 76 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:46] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:23:46] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:23:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:23:46] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2026-05-25 19:23:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-25 19:23:46] [INFO ] Added : 65 causal constraints over 13 iterations in 241 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:47] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:47] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-25 19:23:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:47] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-25 19:23:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 282 ms returned sat
[2026-05-25 19:23:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 17 ms.
[2026-05-25 19:23:47] [INFO ] Added : 54 causal constraints over 13 iterations in 241 ms. Result :sat
Minimization took 50 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:47] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:47] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-25 19:23:48] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 321 ms returned sat
[2026-05-25 19:23:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 19:23:48] [INFO ] Added : 45 causal constraints over 10 iterations in 232 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:48] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:48] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 19:23:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-25 19:23:49] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 19:23:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2026-05-25 19:23:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:23:49] [INFO ] Added : 68 causal constraints over 14 iterations in 397 ms. Result :sat
Minimization took 73 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:49] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:49] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-25 19:23:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:49] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-25 19:23:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2026-05-25 19:23:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:23:50] [INFO ] Added : 47 causal constraints over 10 iterations in 423 ms. Result :sat
Minimization took 87 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:50] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-25 19:23:50] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 19:23:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:23:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-25 19:23:50] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:23:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 57 ms returned sat
[2026-05-25 19:23:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:23:50] [INFO ] Added : 59 causal constraints over 12 iterations in 222 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200, 200, 201, 197, 194, 200, 201, 198, 198, 201, 202, 200, 201, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200, 201, 201, 201, 202, 202, 201, 201, 201, 201, 202, 200, 201, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 7 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2026-05-25 19:24:08] [INFO ] Computed 15 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[200, 201, 201, 201, 202, 202, 201, 201, 201, 201, 202, 200, 201, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000007 steps (2 resets) in 1277 ms. (782 steps per ms)
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 14000014 steps (28 resets) in 19985 ms. (700 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200, 201, 201, 201, 202, 202, 201, 201, 201, 201, 200, 201, 201, 202] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2026-05-25 19:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:30] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 19:24:30] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-25 19:24:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2026-05-25 19:24:30] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-25 19:24:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 19:24:30] [INFO ] [Nat]Added 15 Read/Feed constraints in 231 ms returned sat
[2026-05-25 19:24:30] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:24:30] [INFO ] Added : 53 causal constraints over 11 iterations in 183 ms. Result :sat
Minimization took 64 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:30] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:30] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-25 19:24:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2026-05-25 19:24:30] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-25 19:24:31] [INFO ] [Nat]Added 15 Read/Feed constraints in 159 ms returned sat
[2026-05-25 19:24:31] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:24:31] [INFO ] Added : 59 causal constraints over 13 iterations in 226 ms. Result :sat
Minimization took 66 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:31] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:31] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-25 19:24:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:31] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2026-05-25 19:24:32] [INFO ] [Nat]Added 15 Read/Feed constraints in 100 ms returned sat
[2026-05-25 19:24:32] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:24:32] [INFO ] Added : 27 causal constraints over 6 iterations in 246 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:32] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:32] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 19:24:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:32] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:24:32] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:24:32] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:24:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 4 ms to minimize.
[2026-05-25 19:24:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2026-05-25 19:24:32] [INFO ] Added : 70 causal constraints over 16 iterations in 316 ms. Result :sat
Minimization took 89 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:33] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:33] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-25 19:24:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 19:24:33] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:24:33] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:24:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2026-05-25 19:24:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:33] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:33] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-25 19:24:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:33] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 19:24:33] [INFO ] [Nat]Added 15 Read/Feed constraints in 55 ms returned sat
[2026-05-25 19:24:33] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:24:33] [INFO ] Added : 43 causal constraints over 11 iterations in 197 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:33] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 19:24:34] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-25 19:24:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 19:24:34] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2026-05-25 19:24:34] [INFO ] [Nat]Added 15 Read/Feed constraints in 105 ms returned sat
[2026-05-25 19:24:34] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:24:34] [INFO ] Added : 42 causal constraints over 11 iterations in 145 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:34] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 19:24:34] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-25 19:24:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 19:24:35] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2026-05-25 19:24:35] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:24:35] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:24:35] [INFO ] Added : 48 causal constraints over 12 iterations in 211 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:35] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 19:24:35] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 19:24:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:36] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2026-05-25 19:24:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:24:36] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-25 19:24:36] [INFO ] Added : 42 causal constraints over 10 iterations in 227 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:36] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 19:24:36] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-25 19:24:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-25 19:24:36] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-25 19:24:36] [INFO ] [Nat]Added 15 Read/Feed constraints in 160 ms returned sat
[2026-05-25 19:24:37] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:24:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
[2026-05-25 19:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2026-05-25 19:24:37] [INFO ] Added : 53 causal constraints over 12 iterations in 262 ms. Result :sat
Minimization took 59 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:37] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 19:24:37] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-25 19:24:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 19:24:37] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2026-05-25 19:24:38] [INFO ] [Nat]Added 15 Read/Feed constraints in 842 ms returned sat
[2026-05-25 19:24:38] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:24:47] [INFO ] Added : 0 causal constraints over 0 iterations in 9013 ms. Result :unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:47] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 19:24:47] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2026-05-25 19:24:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 19:24:47] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2026-05-25 19:24:48] [INFO ] [Nat]Added 15 Read/Feed constraints in 93 ms returned sat
[2026-05-25 19:24:48] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:24:48] [INFO ] Added : 50 causal constraints over 10 iterations in 283 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:48] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 19:24:48] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-25 19:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 19:24:48] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2026-05-25 19:24:48] [INFO ] [Nat]Added 15 Read/Feed constraints in 326 ms returned sat
[2026-05-25 19:24:48] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:24:48] [INFO ] Added : 51 causal constraints over 13 iterations in 169 ms. Result :sat
Minimization took 65 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:49] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 19:24:49] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:24:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:24:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 19:24:49] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:24:49] [INFO ] [Nat]Added 15 Read/Feed constraints in 119 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:24:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2026-05-25 19:24:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
Current structural bounds on expressions (after SMT) : Max Seen:[200, 201, 201, 201, 202, 202, 201, 201, 201, 201, 200, 201, 201, 202] Max Struct:[203, 203, 203, 203, 202, 203, 203, 203, 203, 203, 203, 203, 203, 202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200, 201, 201, 202, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 12 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 60 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 8 ms. Remains 60 /75 variables (removed 15) and now considering 96/120 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 60/75 places, 96/120 transitions.
// Phase 1: matrix 96 rows 60 cols
[2026-05-25 19:24:59] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[200, 201, 201, 202, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000052 steps (2 resets) in 1341 ms. (745 steps per ms)
BEST_FIRST walk for 12000012 steps (24 resets) in 14501 ms. (827 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200, 201, 201, 202, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2026-05-25 19:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:15] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:25:15] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-25 19:25:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:25:15] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:25:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 19:25:16] [INFO ] [Nat]Added 12 Read/Feed constraints in 253 ms returned sat
[2026-05-25 19:25:16] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:25:16] [INFO ] Added : 26 causal constraints over 6 iterations in 104 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:16] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:25:16] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:25:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:16] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:25:16] [INFO ] [Nat]Added 12 Read/Feed constraints in 310 ms returned sat
[2026-05-25 19:25:16] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:25:17] [INFO ] Added : 45 causal constraints over 11 iterations in 345 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:17] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:25:17] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-25 19:25:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:17] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2026-05-25 19:25:17] [INFO ] [Nat]Added 12 Read/Feed constraints in 66 ms returned sat
[2026-05-25 19:25:17] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 19:25:17] [INFO ] Added : 26 causal constraints over 6 iterations in 164 ms. Result :sat
Minimization took 45 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:17] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:25:18] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:25:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:25:18] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:25:20] [INFO ] [Nat]Added 12 Read/Feed constraints in 2232 ms returned sat
[2026-05-25 19:25:20] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:25:20] [INFO ] Added : 34 causal constraints over 9 iterations in 85 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:20] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:25:20] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 19:25:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:25:20] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:25:22] [INFO ] [Nat]Added 12 Read/Feed constraints in 1901 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:25:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2026-05-25 19:25:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:22] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:25:22] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 19:25:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:25:22] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:25:22] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:25:22] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:25:22] [INFO ] Added : 41 causal constraints over 9 iterations in 91 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:22] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:25:22] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:25:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-25 19:25:23] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-25 19:25:23] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:25:23] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:25:23] [INFO ] Added : 45 causal constraints over 9 iterations in 127 ms. Result :sat
Minimization took 71 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:23] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:25:23] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:25:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:23] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:25:23] [INFO ] [Nat]Added 12 Read/Feed constraints in 7 ms returned sat
[2026-05-25 19:25:23] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:25:23] [INFO ] Added : 53 causal constraints over 12 iterations in 195 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:23] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:25:23] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:25:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2026-05-25 19:25:23] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:25:23] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:25:23] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:25:24] [INFO ] Added : 37 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 50 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:24] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:24] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:25:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-25 19:25:24] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:25:24] [INFO ] [Nat]Added 12 Read/Feed constraints in 130 ms returned sat
[2026-05-25 19:25:24] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:25:24] [INFO ] Added : 44 causal constraints over 10 iterations in 163 ms. Result :sat
Minimization took 66 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:24] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2026-05-25 19:25:24] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-25 19:25:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:25] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2026-05-25 19:25:25] [INFO ] [Nat]Added 12 Read/Feed constraints in 245 ms returned sat
[2026-05-25 19:25:25] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:25:25] [INFO ] Added : 57 causal constraints over 12 iterations in 408 ms. Result :sat
Minimization took 55 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:25] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:25] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:25:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-25 19:25:26] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:25:26] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:25:26] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:25:26] [INFO ] Added : 49 causal constraints over 10 iterations in 148 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200, 201, 201, 202, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 202, 203, 203, 203, 203, 203, 203, 203]
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200, 201, 201, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 55 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 5 ms. Remains 55 /60 variables (removed 5) and now considering 88/96 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 55/60 places, 88/96 transitions.
// Phase 1: matrix 88 rows 55 cols
[2026-05-25 19:25:32] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[200, 201, 201, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000023 steps (2 resets) in 958 ms. (1042 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 12628 ms. (871 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200, 201, 201, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2026-05-25 19:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-25 19:25:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:25:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:25:46] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-25 19:25:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 19:25:46] [INFO ] [Nat]Added 11 Read/Feed constraints in 353 ms returned sat
[2026-05-25 19:25:47] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 19:25:47] [INFO ] Added : 33 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:25:47] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-25 19:25:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:47] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:25:47] [INFO ] [Nat]Added 11 Read/Feed constraints in 480 ms returned sat
[2026-05-25 19:25:47] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:25:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
[2026-05-25 19:25:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-25 19:25:47] [INFO ] Added : 28 causal constraints over 6 iterations in 149 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:48] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-25 19:25:48] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:25:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:48] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:25:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 306 ms returned sat
[2026-05-25 19:25:48] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:25:48] [INFO ] Added : 23 causal constraints over 6 iterations in 88 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:48] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:48] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-25 19:25:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:48] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-25 19:25:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 123 ms returned sat
[2026-05-25 19:25:48] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:25:49] [INFO ] Added : 44 causal constraints over 10 iterations in 144 ms. Result :sat
Minimization took 39 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:49] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:25:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:49] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2026-05-25 19:25:49] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:25:49] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 19:25:49] [INFO ] Added : 43 causal constraints over 9 iterations in 345 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:49] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:25:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:25:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:50] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:25:50] [INFO ] [Nat]Added 11 Read/Feed constraints in 241 ms returned sat
[2026-05-25 19:25:50] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:25:50] [INFO ] Added : 31 causal constraints over 7 iterations in 109 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:25:50] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 19:25:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:25:50] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:25:50] [INFO ] [Nat]Added 11 Read/Feed constraints in 310 ms returned sat
[2026-05-25 19:25:50] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:25:51] [INFO ] Added : 29 causal constraints over 6 iterations in 99 ms. Result :sat
Minimization took 44 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:51] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:25:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:51] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:25:51] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:25:51] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:25:51] [INFO ] Added : 36 causal constraints over 9 iterations in 130 ms. Result :sat
Minimization took 50 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:51] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 19:25:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:51] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2026-05-25 19:25:51] [INFO ] [Nat]Added 11 Read/Feed constraints in 253 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:25:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
[2026-05-25 19:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 768 ms
[2026-05-25 19:25:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:25:52] [INFO ] Added : 28 causal constraints over 7 iterations in 67 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-25 19:25:52] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-25 19:25:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:25:52] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:25:52] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:25:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:25:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2026-05-25 19:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2026-05-25 19:25:53] [INFO ] Added : 51 causal constraints over 11 iterations in 146 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:53] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:53] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:25:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:25:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-25 19:25:53] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-25 19:25:53] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:25:53] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 19:25:53] [INFO ] Added : 41 causal constraints over 9 iterations in 131 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200, 201, 201, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200, 201, 201, 202, 201, 201, 201, 201, 200, 201, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 55/55 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2026-05-25 19:25:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:25:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 19:25:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:25:59] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 19:25:59] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:25:59] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2026-05-25 19:25:59] [INFO ] Invariant cache hit.
[2026-05-25 19:25:59] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 88/143 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 88/143 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 18934 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21387ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 21388ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21490 ms. Remains : 55/55 places, 88/88 transitions.
RANDOM walk for 40127 steps (8 resets) in 314 ms. (127 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
[2026-05-25 19:26:21] [INFO ] Flatten gal took : 51 ms
[2026-05-25 19:26:21] [INFO ] Flatten gal took : 40 ms
[2026-05-25 19:26:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13427172041571485259.gal : 19 ms
[2026-05-25 19:26:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2471221858405113364.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13427172041571485259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2471221858405113364.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2471221858405113364.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 108478 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 22
Probabilistic random walk after 108478 steps, saw 99670 distinct states, run finished after 3010 ms. (steps per millisecond=36 ) properties seen :0
[2026-05-25 19:26:24] [INFO ] Invariant cache hit.
[2026-05-25 19:26:24] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 44/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MIN3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 11/22 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 88/143 variables, 55/77 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 11/88 constraints. Problems are: Problem set: 12 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/88 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/88 constraints. Problems are: Problem set: 12 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 88 constraints, problems are : Problem set: 12 solved, 10 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 10/20 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/70 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 10/80 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/143 variables, and 90 constraints, problems are : Problem set: 12 solved, 10 unsolved in 3968 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 50/55 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 10/22 constraints, Known Traps: 10/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4791ms problems are : Problem set: 12 solved, 10 unsolved
Fused 10 Parikh solutions to 2 different solutions.
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
Parikh walk visited 3 properties in 11440 ms.
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 35 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Applied a total of 1 rules in 3 ms. Remains 35 /55 variables (removed 20) and now considering 56/88 (removed 32) transitions.
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 35 cols
[2026-05-25 19:26:40] [INFO ] Computed 7 invariants in 1 ms
[2026-05-25 19:26:40] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :1.45683e+07 after 3.62124e+14
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4075 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5190ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 5190ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5193 ms. Remains : 35/55 places, 56/88 transitions.
RANDOM walk for 40065 steps (8 resets) in 40 ms. (977 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 173135 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 7
Probabilistic random walk after 173135 steps, saw 149214 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2026-05-25 19:26:48] [INFO ] Invariant cache hit.
[2026-05-25 19:26:48] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 7 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:49] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:49] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 61 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2247ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 3406 ms.
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 30 /35 variables (removed 5) and now considering 48/56 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/35 places, 48/56 transitions.
RANDOM walk for 40159 steps (8 resets) in 54 ms. (730 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 212562 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 6
Probabilistic random walk after 212562 steps, saw 179379 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 48 rows 30 cols
[2026-05-25 19:26:57] [INFO ] Computed 6 invariants in 4 ms
[2026-05-25 19:26:57] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 6 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:26:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:27:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:27:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:27:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 52 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2665 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2811ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :3.62124e+14 after 8.04197e+22
Parikh walk visited 0 properties in 1786 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2026-05-25 19:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:27:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 19:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:27:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 19:27:02] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:27:02] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2026-05-25 19:27:02] [INFO ] Invariant cache hit.
[2026-05-25 19:27:02] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:27:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 79 constraints, problems are : Problem set: 0 solved, 36 unsolved in 2183 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3078ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 3081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3162 ms. Remains : 30/30 places, 48/48 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:27:05] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:27:05] [INFO ] Applying decomposition
[2026-05-25 19:27:05] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6270760274614906578.txt' '-o' '/tmp/graph6270760274614906578.bin' '-w' '/tmp/graph6270760274614906578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6270760274614906578.bin' '-l' '-1' '-v' '-w' '/tmp/graph6270760274614906578.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:27:05] [INFO ] Decomposing Gal with order
[2026-05-25 19:27:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:27:05] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:27:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:27:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16052970509522016006.gal : 5 ms
[2026-05-25 19:27:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15891915145674551759.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16052970509522016006.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15891915145674551759.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15891915145674551759.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3104 after 10755
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.45683e+07 after 5.1554e+19
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\_mod\_flat,3.80881e+86,12.1137,118892,13,1419,167,339652,53,0,62,399420,0
Total reachable state count : 3.808814559926716759115684888194081889523e+86

Verifying 6 reachability properties.
Invariant property MIN0 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
MIN0,0,12.1264,118892,1,0,167,339652,55,0,64,399420,0
Invariant property MIN2 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
MIN2,0,12.1353,118892,1,0,167,339652,57,0,65,399420,0
Invariant property MIN4 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
MIN4,0,12.1354,118892,1,0,167,339652,58,0,65,399420,0
Invariant property MIN7 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
MIN7,0,12.1356,118892,1,0,167,339652,59,0,65,399420,0
Invariant property MIN8 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
MIN8,0,12.1357,118892,1,0,167,339652,60,0,65,399420,0
Invariant property MIN9 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
MIN9,0,12.1359,118892,1,0,167,339652,61,0,65,399420,0
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 202 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 200 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 7 queries.) : Max Seen:[201, 201, 201, 201] Max Struct:[203, 203, 203, 203]
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 88 rows 55 cols
[2026-05-25 19:27:17] [INFO ] Computed 11 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10010 steps (2 resets) in 9 ms. (1001 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[129] Max Struct:[203]
[2026-05-25 19:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:27:17] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:27:17] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 19:27:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:27:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:27:18] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-25 19:27:18] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 19:27:18] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:27:18] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 19:27:18] [INFO ] Added : 45 causal constraints over 10 iterations in 162 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[129] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.3 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Applied a total of 1 rules in 4 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:27:19] [INFO ] Computed 1 invariants in 0 ms
[2026-05-25 19:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 231ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 5/55 places, 8/88 transitions.
[2026-05-25 19:27:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000007 steps (2 resets) in 166 ms. (5988 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 192 ms. (5181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2026-05-25 19:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:27:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:27:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:27:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:27:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:27:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 19:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:27:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:27:19] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 19:27:19] [INFO ] Added : 5 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:27:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 19:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:27:19] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:27:19] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:27:19] [INFO ] Invariant cache hit.
[2026-05-25 19:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 209ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 5/5 places, 8/8 transitions.
[2026-05-25 19:27:20] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:27:20] [INFO ] Flatten gal took : 0 ms
[2026-05-25 19:27:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8266478078447390757.gal : 1 ms
RANDOM walk for 40038 steps (8 resets) in 12 ms. (3079 steps per ms) remains 2/2 properties
[2026-05-25 19:27:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6295677214322972108.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8266478078447390757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6295677214322972108.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6295677214322972108.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 789400 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 2
Probabilistic random walk after 789400 steps, saw 308288 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2026-05-25 19:27:23] [INFO ] Invariant cache hit.
[2026-05-25 19:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:27:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:27:23] [INFO ] Invariant cache hit.
[2026-05-25 19:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 199ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40146 steps (8 resets) in 14 ms. (2676 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3701512 steps, run timeout after 3019 ms. (steps per millisecond=1226 ) properties seen :0 out of 1
Probabilistic random walk after 3701512 steps, saw 1272074 distinct states, run finished after 3020 ms. (steps per millisecond=1225 ) properties seen :0
[2026-05-25 19:27:26] [INFO ] Invariant cache hit.
[2026-05-25 19:27:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:27:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:27:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-25 19:27:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:27:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:27:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:27:26] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:27:26] [INFO ] Invariant cache hit.
[2026-05-25 19:27:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 181ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 181ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:27:26] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:27:26] [INFO ] Applying decomposition
[2026-05-25 19:27:26] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4116503939578021708.txt' '-o' '/tmp/graph4116503939578021708.bin' '-w' '/tmp/graph4116503939578021708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4116503939578021708.bin' '-l' '-1' '-v' '-w' '/tmp/graph4116503939578021708.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:27:26] [INFO ] Decomposing Gal with order
[2026-05-25 19:27:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:27:26] [INFO ] Flatten gal took : 48 ms
[2026-05-25 19:27:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 19:27:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7544697616146970226.gal : 1 ms
[2026-05-25 19:27:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8219276886510005570.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7544697616146970226.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8219276886510005570.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8219276886510005570.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :72182 after 72214
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.49663e+06 after 4.1191e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.54288e+07 after 4.71623e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.29263e+07 after 7.29365e+07
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\_mod\_flat,7.42986e+07,48.247,443184,623,627,499340,383238,42,855100,42,1.11188e+06,0
Total reachable state count : 74298645

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,3,48.2687,443184,5,7,499340,383238,44,855100,45,1.11188e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01 in 57402 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 88 rows 55 cols
[2026-05-25 19:28:15] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[113] Max Struct:[203]
[2026-05-25 19:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:28:15] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:28:15] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2026-05-25 19:28:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:28:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:28:15] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-25 19:28:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 19:28:16] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 19:28:16] [INFO ] [Nat]Added 11 Read/Feed constraints in 596 ms returned sat
[2026-05-25 19:28:16] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-25 19:28:16] [INFO ] Added : 33 causal constraints over 7 iterations in 182 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:28:17] [INFO ] Computed 1 invariants in 0 ms
[2026-05-25 19:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 240ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 5/55 places, 8/88 transitions.
[2026-05-25 19:28:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000011 steps (2 resets) in 171 ms. (5814 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 325 ms. (3067 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2026-05-25 19:28:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:28:17] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 19:28:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:28:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:28:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 19:28:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:28:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 19:28:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 19:28:17] [INFO ] Added : 5 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:28:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 19:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:28:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:28:18] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:28:18] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:28:18] [INFO ] Invariant cache hit.
[2026-05-25 19:28:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 288ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40083 steps (8 resets) in 18 ms. (2109 steps per ms) remains 2/2 properties
[2026-05-25 19:28:18] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:28:18] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:28:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1584667839323159843.gal : 2 ms
[2026-05-25 19:28:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5597634053330879719.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1584667839323159843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5597634053330879719.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5597634053330879719.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40002 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 961305 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :0 out of 2
Probabilistic random walk after 961305 steps, saw 371497 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
[2026-05-25 19:28:21] [INFO ] Invariant cache hit.
[2026-05-25 19:28:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:28:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:28:21] [INFO ] Invariant cache hit.
[2026-05-25 19:28:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 280ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40171 steps (8 resets) in 17 ms. (2231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3356859 steps, run timeout after 3001 ms. (steps per millisecond=1118 ) properties seen :0 out of 1
Probabilistic random walk after 3356859 steps, saw 1153704 distinct states, run finished after 3001 ms. (steps per millisecond=1118 ) properties seen :0
[2026-05-25 19:28:24] [INFO ] Invariant cache hit.
[2026-05-25 19:28:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:28:25] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-25 19:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:28:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:28:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:28:25] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:28:25] [INFO ] Invariant cache hit.
[2026-05-25 19:28:25] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:28:25] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:28:25] [INFO ] Applying decomposition
[2026-05-25 19:28:25] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13259332724675948654.txt' '-o' '/tmp/graph13259332724675948654.bin' '-w' '/tmp/graph13259332724675948654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13259332724675948654.bin' '-l' '-1' '-v' '-w' '/tmp/graph13259332724675948654.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:28:25] [INFO ] Decomposing Gal with order
[2026-05-25 19:28:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:28:25] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:28:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:28:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17871838579445830076.gal : 1 ms
[2026-05-25 19:28:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11253575481079151220.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17871838579445830076.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11253575481079151220.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11253575481079151220.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :15007 after 38132
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :38132 after 39862
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :39862 after 39872
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :39872 after 67115
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :67115 after 71358
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :71358 after 111194
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :111194 after 176025
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :246141 after 359887
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :885194 after 1.12798e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08 in 60178 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 88 rows 55 cols
[2026-05-25 19:29:15] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10065 steps (2 resets) in 10 ms. (915 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[162] Max Struct:[203]
[2026-05-25 19:29:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:29:15] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-25 19:29:15] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-25 19:29:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:29:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:29:15] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2026-05-25 19:29:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 19:29:15] [INFO ] [Nat]Added 11 Read/Feed constraints in 126 ms returned sat
[2026-05-25 19:29:15] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 19:29:15] [INFO ] Added : 35 causal constraints over 7 iterations in 74 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[162] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:29:16] [INFO ] Computed 1 invariants in 1 ms
[2026-05-25 19:29:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 256ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 5/55 places, 8/88 transitions.
[2026-05-25 19:29:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000010 steps (2 resets) in 159 ms. (6250 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 191 ms. (5208 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2026-05-25 19:29:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:29:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:29:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 19:29:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:29:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:29:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 19:29:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:29:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:29:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 19:29:17] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:29:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:29:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 19:29:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:29:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:29:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:29:17] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:29:17] [INFO ] Invariant cache hit.
[2026-05-25 19:29:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 244ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 5/5 places, 8/8 transitions.
[2026-05-25 19:29:17] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:29:17] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:29:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality491003765475948603.gal : 1 ms
[2026-05-25 19:29:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8227689862662117918.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality491003765475948603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8227689862662117918.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40129 steps (8 resets) in 15 ms. (2508 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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality8227689862662117918.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
Interrupted probabilistic random walk after 882856 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 2
Probabilistic random walk after 882856 steps, saw 342416 distinct states, run finished after 3003 ms. (steps per millisecond=293 ) properties seen :0
[2026-05-25 19:29:20] [INFO ] Invariant cache hit.
[2026-05-25 19:29:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:29:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-25 19:29:20] [INFO ] Invariant cache hit.
[2026-05-25 19:29:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40048 steps (8 resets) in 12 ms. (3080 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3625138 steps, run timeout after 3001 ms. (steps per millisecond=1207 ) properties seen :0 out of 1
Probabilistic random walk after 3625138 steps, saw 1246132 distinct states, run finished after 3001 ms. (steps per millisecond=1207 ) properties seen :0
[2026-05-25 19:29:23] [INFO ] Invariant cache hit.
[2026-05-25 19:29:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-25 19:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:29:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-25 19:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 19:29:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:29:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 19:29:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 19:29:23] [INFO ] Invariant cache hit.
[2026-05-25 19:29:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 170ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:29:24] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:29:24] [INFO ] Applying decomposition
[2026-05-25 19:29:24] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14311983414607060474.txt' '-o' '/tmp/graph14311983414607060474.bin' '-w' '/tmp/graph14311983414607060474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14311983414607060474.bin' '-l' '-1' '-v' '-w' '/tmp/graph14311983414607060474.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:29:24] [INFO ] Decomposing Gal with order
[2026-05-25 19:29:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:29:24] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:29:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:29:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14410822726503572351.gal : 1 ms
[2026-05-25 19:29:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8273619561598757066.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14410822726503572351.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8273619561598757066.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8273619561598757066.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :15007 after 37737
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37737 after 39296
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :39296 after 39316
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :39316 after 66392
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :66392 after 70967
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :70967 after 111194
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :111194 after 176021
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :246141 after 359300
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :681215 after 885194
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-09 in 58793 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 88 rows 55 cols
[2026-05-25 19:30:14] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10025 steps (2 resets) in 8 ms. (1113 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[152] Max Struct:[203]
[2026-05-25 19:30:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:30:14] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-25 19:30:14] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-25 19:30:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 19:30:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-25 19:30:14] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2026-05-25 19:30:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 19:30:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 40 ms returned sat
[2026-05-25 19:30:14] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 19:30:14] [INFO ] Added : 30 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[152] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2026-05-25 19:30:15] [INFO ] Computed 1 invariants in 1 ms
[2026-05-25 19:30:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 5/55 places, 8/88 transitions.
[2026-05-25 19:30:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000050 steps (2 resets) in 166 ms. (5988 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 192 ms. (5181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[202] Max Struct:[203]
[2026-05-25 19:30:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:30:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:30:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 19:30:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 19:30:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 19:30:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 19:30:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:30:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 19:30:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
[2026-05-25 19:30:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
Current structural bounds on expressions (after SMT) : Max Seen:[202] Max Struct:[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2026-05-25 19:30:15] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:30:15] [INFO ] Flatten gal took : 0 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-25 19:30:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13322812241961747588.gal : 0 ms
[2026-05-25 19:30:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality842341995811952088.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13322812241961747588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality842341995811952088.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality842341995811952088.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,8,0.0035,3996,2,15,5,61,6,0,45,39,0
Total reachable state count : 8

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14 in 1748 ms.
[2026-05-25 19:30:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:30:16] [INFO ] Applying decomposition
[2026-05-25 19:30:16] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12979367073528294761.txt' '-o' '/tmp/graph12979367073528294761.bin' '-w' '/tmp/graph12979367073528294761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12979367073528294761.bin' '-l' '-1' '-v' '-w' '/tmp/graph12979367073528294761.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:30:16] [INFO ] Decomposing Gal with order
[2026-05-25 19:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:30:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 19:30:16] [INFO ] Time to serialize gal into /tmp/UpperBounds11498614774511682740.gal : 1 ms
[2026-05-25 19:30:16] [INFO ] Time to serialize properties into /tmp/UpperBounds16210676764481289494.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11498614774511682740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16210676764481289494.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds16210676764481289494.prop.
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\_mod\_flat,3.80881e+86,13.4206,118092,13,1419,37,339629,51,0,65,399420,0
Total reachable state count : 3.808814559926716759115684888194081889523e+86

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-01 :0 <= u5.p599 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-01,0,13.4477,118092,1,0,66,339629,117,12,280,399420,123
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-08 :0 <= u4.p544 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-08,0,13.4482,118092,1,0,75,339629,137,12,280,399420,139
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-09 :0 <= u9.p899 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-09,0,13.4484,118092,1,0,78,339629,163,12,280,399420,152
Total runtime 660888 ms.

BK_STOP 1779737429634

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="JoinFreeModules-PT-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is JoinFreeModules-PT-0200, 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 r175-smll-177961111800025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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