Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BusinessProcesses-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 100K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779612920851

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 08:55:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 08:55:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:55:22] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2026-05-24 08:55:22] [INFO ] Transformed 386 places.
[2026-05-24 08:55:22] [INFO ] Transformed 360 transitions.
[2026-05-24 08:55:22] [INFO ] Found NUPN structural information;
[2026-05-24 08:55:22] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 53 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 49 place count 337 transition count 312
Iterating global reduction 1 with 48 rules applied. Total rules applied 97 place count 337 transition count 312
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 119 place count 315 transition count 290
Iterating global reduction 1 with 22 rules applied. Total rules applied 141 place count 315 transition count 290
Applied a total of 141 rules in 82 ms. Remains 315 /386 variables (removed 71) and now considering 290/360 (removed 70) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10944947526528494852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6649842612651171589.kers'
[2026-05-24 08:55:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10944947526528494852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6649842612651171589.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 315 cols 969 entries
Finished phase 1 with 206 SingleSign rule and 48 generalized
[2026-05-24 08:55:22] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6649842612651171589.kers
Total runtime 2 ms.
[2026-05-24 08:55:22] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-24 08:55:22] [INFO ] Invariant cache hit.
[2026-05-24 08:55:23] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-24 08:55:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/121 constraints. Problems are: Problem set: 4 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/141 constraints. Problems are: Problem set: 4 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 20/161 constraints. Problems are: Problem set: 4 solved, 285 unsolved
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/181 constraints. Problems are: Problem set: 9 solved, 280 unsolved
Problem TDEAD243 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 20/201 constraints. Problems are: Problem set: 11 solved, 278 unsolved
SMT process timed out in 30103ms, After SMT, problems are : Problem set: 11 solved, 278 unsolved
Search for dead transitions found 11 dead transitions in 30116ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 315/386 places, 279/360 transitions.
Applied a total of 0 rules in 5 ms. Remains 315 /315 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30908 ms. Remains : 315/386 places, 279/360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 279/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 315 /315 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14965404445222870428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3501062017476439040.kers'
[2026-05-24 08:55:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14965404445222870428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3501062017476439040.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 315 cols 903 entries
Finished phase 1 with 205 SingleSign rule and 49 generalized
[2026-05-24 08:55:53] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3501062017476439040.kers
Total runtime 1 ms.
[2026-05-24 08:55:53] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-24 08:55:53] [INFO ] Invariant cache hit.
[2026-05-24 08:55:53] [INFO ] Implicit Places using invariants and state equation in 328 ms returned [263]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 486 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 314/315 places, 279/279 transitions.
Applied a total of 0 rules in 11 ms. Remains 314 /314 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 503 ms. Remains : 314/315 places, 279/279 transitions.
Support contains 53 out of 314 places after structural reductions.
[2026-05-24 08:55:53] [INFO ] Flatten gal took : 48 ms
[2026-05-24 08:55:53] [INFO ] Flatten gal took : 26 ms
[2026-05-24 08:55:54] [INFO ] Input system was already deterministic with 279 transitions.
Support contains 52 out of 314 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (435 resets) in 1874 ms. (21 steps per ms) remains 7/37 properties
BEST_FIRST walk for 40004 steps (80 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (79 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (78 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (85 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (78 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (82 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (79 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-251454492771609033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1684957659252004645.kers'
[2026-05-24 08:55:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-251454492771609033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1684957659252004645.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 314 cols 901 entries
Finished phase 1 with 205 SingleSign rule and 49 generalized
[2026-05-24 08:55:54] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1684957659252004645.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 113/131 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 115/246 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 5 (OVERLAPS) 65/311 variables, 17/60 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 7 (OVERLAPS) 277/588 variables, 311/371 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/593 variables, 3/374 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 0/374 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/593 variables, 0/374 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 374 constraints, problems are : Problem set: 3 solved, 4 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 116/126 variables, 18/18 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 115/241 variables, 25/43 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 4/47 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 66/307 variables, 15/62 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 15/77 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/77 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/311 variables, 2/79 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/79 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 11 (OVERLAPS) 277/588 variables, 311/390 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 1/391 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Int declared 588/593 variables, and 393 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1862 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 311/314 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2220ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BusinessProcesses-PT-07-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 197 stabilizing places and 189 stable transitions
Graph (complete) has 708 edges and 314 vertex of which 313 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&X(X(F(p0)))))||(p1&&F(p2)))))'
Support contains 3 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 305 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 305 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 302 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 302 transition count 267
Applied a total of 24 rules in 13 ms. Remains 302 /314 variables (removed 12) and now considering 267/279 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8589850817855238302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10514628560460281534.kers'
[2026-05-24 08:55:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8589850817855238302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10514628560460281534.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 302 cols 877 entries
Finished phase 1 with 193 SingleSign rule and 49 generalized
[2026-05-24 08:55:57] [INFO ] Computed 60 invariants in 4 ms
Computed 60 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10514628560460281534.kers
Total runtime 5 ms.
[2026-05-24 08:55:57] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-24 08:55:57] [INFO ] Invariant cache hit.
[2026-05-24 08:55:58] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-24 08:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/302 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 20/100 constraints. Problems are: Problem set: 11 solved, 255 unsolved
Problem TDEAD214 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 20/120 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 20/140 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 20/160 constraints. Problems are: Problem set: 17 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 20/180 constraints. Problems are: Problem set: 17 solved, 249 unsolved
Problem TDEAD215 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 20/200 constraints. Problems are: Problem set: 19 solved, 247 unsolved
Problem TDEAD234 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 12/212 constraints. Problems are: Problem set: 20 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/569 variables, and 212 constraints, problems are : Problem set: 20 solved, 246 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 152/152 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/302 variables, 43/57 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 3/60 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 152/212 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 8/220 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 3/223 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 12/235 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/235 constraints. Problems are: Problem set: 20 solved, 246 unsolved
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD239 is UNSAT
At refinement iteration 9 (OVERLAPS) 267/569 variables, 302/537 constraints. Problems are: Problem set: 25 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 241/778 constraints. Problems are: Problem set: 25 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 20/798 constraints. Problems are: Problem set: 25 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 798 constraints, problems are : Problem set: 25 solved, 241 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 241/266 constraints, Known Traps: 195/195 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 25 solved, 241 unsolved
Search for dead transitions found 25 dead transitions in 60069ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 302/314 places, 242/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 242
Applied a total of 2 rules in 9 ms. Remains 300 /302 variables (removed 2) and now considering 242/242 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2275837788631819150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14018719835891393985.kers'
[2026-05-24 08:56:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2275837788631819150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14018719835891393985.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 300 cols 723 entries
Finished phase 1 with 195 SingleSign rule and 38 generalized
[2026-05-24 08:56:58] [INFO ] Computed 67 invariants in 2 ms
Computed 67 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14018719835891393985.kers
Total runtime 4 ms.
[2026-05-24 08:56:58] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-24 08:56:58] [INFO ] Invariant cache hit.
[2026-05-24 08:56:58] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 300/314 places, 242/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61060 ms. Remains : 300/314 places, 242/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&X(X(F(p0)))))||(p1&&F(p2)))))'
Stuttering acceptance computed with spot in 474 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-00 finished in 61630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X((p1||X((G(p0) U (p1&&G(p0)))))))) U (p2||G(!p0))))'
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 305 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 305 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 302 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 302 transition count 267
Applied a total of 24 rules in 15 ms. Remains 302 /314 variables (removed 12) and now considering 267/279 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1148127875539620118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4380111866543974853.kers'
[2026-05-24 08:56:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1148127875539620118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4380111866543974853.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 302 cols 877 entries
Finished phase 1 with 193 SingleSign rule and 49 generalized
[2026-05-24 08:56:59] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4380111866543974853.kers
Total runtime 3 ms.
[2026-05-24 08:56:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-24 08:56:59] [INFO ] Invariant cache hit.
[2026-05-24 08:56:59] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-24 08:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/302 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 20/100 constraints. Problems are: Problem set: 11 solved, 255 unsolved
Problem TDEAD214 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 20/120 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 20/140 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 20/160 constraints. Problems are: Problem set: 17 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 20/180 constraints. Problems are: Problem set: 17 solved, 249 unsolved
Problem TDEAD215 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 20/200 constraints. Problems are: Problem set: 19 solved, 247 unsolved
Problem TDEAD234 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 12/212 constraints. Problems are: Problem set: 20 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/569 variables, and 213 constraints, problems are : Problem set: 20 solved, 246 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 153/153 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/302 variables, 43/57 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 3/60 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 153/213 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 1/214 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 13/227 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 12/239 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 5/244 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 20/264 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 14/278 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 4/282 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 10/292 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 9/301 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 2/303 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/302 variables, 1/304 constraints. Problems are: Problem set: 20 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/569 variables, and 304 constraints, problems are : Problem set: 20 solved, 246 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 0/266 constraints, Known Traps: 244/244 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 20 solved, 246 unsolved
Search for dead transitions found 20 dead transitions in 60056ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 302/314 places, 247/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 247
Applied a total of 2 rules in 5 ms. Remains 300 /302 variables (removed 2) and now considering 247/247 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6394699367008284973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1266041581019569460.kers'
[2026-05-24 08:57:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6394699367008284973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1266041581019569460.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 300 cols 753 entries
Finished phase 1 with 195 SingleSign rule and 41 generalized
[2026-05-24 08:57:59] [INFO ] Computed 64 invariants in 1 ms
Computed 64 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1266041581019569460.kers
Total runtime 2 ms.
[2026-05-24 08:57:59] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 08:57:59] [INFO ] Invariant cache hit.
[2026-05-24 08:58:00] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 300/314 places, 247/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61073 ms. Remains : 300/314 places, 247/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X((p1||X((G(p0) U (p1&&G(p0)))))))) U (G(!p0)||p2)))'
Stuttering acceptance computed with spot in 338 ms :[(AND p0 (NOT p2)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0), false, p0]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 8459 steps with 91 reset in 47 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-02 finished in 61504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&(!p1 U (p2||G(!p1))))||G(p0))))'
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 308 transition count 273
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 308 transition count 273
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 305 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 305 transition count 270
Applied a total of 18 rules in 12 ms. Remains 305 /314 variables (removed 9) and now considering 270/279 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2545938851486181033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13856384789807709198.kers'
[2026-05-24 08:58:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2545938851486181033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13856384789807709198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 305 cols 883 entries
Finished phase 1 with 196 SingleSign rule and 49 generalized
[2026-05-24 08:58:00] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13856384789807709198.kers
Total runtime 1 ms.
[2026-05-24 08:58:00] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 08:58:00] [INFO ] Invariant cache hit.
[2026-05-24 08:58:01] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2026-05-24 08:58:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/80 constraints. Problems are: Problem set: 6 solved, 263 unsolved
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/100 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 20/120 constraints. Problems are: Problem set: 18 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 20/140 constraints. Problems are: Problem set: 18 solved, 251 unsolved
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 18/158 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 7/165 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 19/184 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 9/193 constraints. Problems are: Problem set: 20 solved, 249 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/575 variables, and 194 constraints, problems are : Problem set: 20 solved, 249 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 134/134 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 43/57 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 3/60 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 134/194 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/199 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/201 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/203 constraints. Problems are: Problem set: 20 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/203 constraints. Problems are: Problem set: 20 solved, 249 unsolved
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 9 (OVERLAPS) 270/575 variables, 305/508 constraints. Problems are: Problem set: 25 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 244/752 constraints. Problems are: Problem set: 25 solved, 244 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 20/772 constraints. Problems are: Problem set: 25 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/575 variables, and 776 constraints, problems are : Problem set: 25 solved, 244 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 244/269 constraints, Known Traps: 167/167 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 25 solved, 244 unsolved
Search for dead transitions found 25 dead transitions in 60053ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 305/314 places, 245/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 303 transition count 245
Applied a total of 2 rules in 9 ms. Remains 303 /305 variables (removed 2) and now considering 245/245 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10304355856208723379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6479465520333578122.kers'
[2026-05-24 08:59:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10304355856208723379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6479465520333578122.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 303 cols 729 entries
Finished phase 1 with 198 SingleSign rule and 38 generalized
[2026-05-24 08:59:01] [INFO ] Computed 67 invariants in 2 ms
Computed 67 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6479465520333578122.kers
Total runtime 3 ms.
[2026-05-24 08:59:01] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-24 08:59:01] [INFO ] Invariant cache hit.
[2026-05-24 08:59:01] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 303/314 places, 245/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60998 ms. Remains : 303/314 places, 245/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(p0)&&(!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Computed a total of 186 stabilizing places and 155 stable transitions
Graph (complete) has 637 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 186 stabilizing places and 155 stable transitions
Detected a total of 186/303 stabilizing places and 155/245 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 21 factoid took 11 ms. Proved property starting from automaton with 3 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-03 finished in 61693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(p1)) U X(X(X(X(p2))))))'
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 306 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 306 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 303 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 303 transition count 268
Applied a total of 22 rules in 14 ms. Remains 303 /314 variables (removed 11) and now considering 268/279 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15703279140105454999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1048482257454092934.kers'
[2026-05-24 08:59:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15703279140105454999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1048482257454092934.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 303 cols 879 entries
Finished phase 1 with 194 SingleSign rule and 49 generalized
[2026-05-24 08:59:02] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1048482257454092934.kers
Total runtime 2 ms.
[2026-05-24 08:59:02] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-24 08:59:02] [INFO ] Invariant cache hit.
[2026-05-24 08:59:02] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-24 08:59:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 20/100 constraints. Problems are: Problem set: 8 solved, 259 unsolved
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 20/120 constraints. Problems are: Problem set: 14 solved, 253 unsolved
Problem TDEAD212 is UNSAT
Problem TDEAD233 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 20/140 constraints. Problems are: Problem set: 16 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 20/160 constraints. Problems are: Problem set: 16 solved, 251 unsolved
Problem TDEAD215 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 16/176 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 9/185 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 3/188 constraints. Problems are: Problem set: 20 solved, 247 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 3/191 constraints. Problems are: Problem set: 20 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/571 variables, and 191 constraints, problems are : Problem set: 20 solved, 247 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 131/131 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 43/57 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 3/60 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 131/191 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 20/211 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 20/231 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 13/244 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/245 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 14/259 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 20/279 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 12/291 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 4/295 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 4/299 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/303 variables, 0/299 constraints. Problems are: Problem set: 20 solved, 247 unsolved
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 15 (OVERLAPS) 268/571 variables, 303/602 constraints. Problems are: Problem set: 24 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 845 constraints, problems are : Problem set: 24 solved, 243 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 243/267 constraints, Known Traps: 239/239 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 24 solved, 243 unsolved
Search for dead transitions found 24 dead transitions in 60067ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 303/314 places, 244/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 301 transition count 244
Applied a total of 2 rules in 4 ms. Remains 301 /303 variables (removed 2) and now considering 244/244 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10586260816925848123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14673774687005649309.kers'
[2026-05-24 09:00:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10586260816925848123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14673774687005649309.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 301 cols 731 entries
Finished phase 1 with 196 SingleSign rule and 39 generalized
[2026-05-24 09:00:02] [INFO ] Computed 66 invariants in 2 ms
Computed 66 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14673774687005649309.kers
Total runtime 3 ms.
[2026-05-24 09:00:03] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-24 09:00:03] [INFO ] Invariant cache hit.
[2026-05-24 09:00:03] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 301/314 places, 244/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60953 ms. Remains : 301/314 places, 244/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(p1)) U X(X(X(X(p2))))))'
Stuttering acceptance computed with spot in 988 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 87 ms.
Product exploration explored 100000 steps with 20000 reset in 118 ms.
Computed a total of 184 stabilizing places and 154 stable transitions
Graph (complete) has 635 edges and 301 vertex of which 300 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 184 stabilizing places and 154 stable transitions
Detected a total of 184/301 stabilizing places and 154/244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 13 factoid took 133 ms. Reduced automaton from 24 states, 47 edges and 3 AP (stutter sensitive) to 11 states, 20 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (439 resets) in 285 ms. (139 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40002 steps (76 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (85 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2026-05-24 09:00:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 152/230 variables, 31/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 3/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/298 variables, 24/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 242/540 variables, 298/368 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/370 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/545 variables, 3/373 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/545 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 373 constraints, problems are : Problem set: 1 solved, 1 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 194/230 variables, 39/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/298 variables, 24/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 242/540 variables, 298/371 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 1/372 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 1/373 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/545 variables, 3/376 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/545 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 376 constraints, problems are : Problem set: 1 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 884ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 845 steps, including 9 resets, run visited all 1 properties in 5 ms. (steps per millisecond=169 )
Parikh walk visited 1 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 184 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 11 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 449 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 1852 ms.
Stuttering acceptance computed with spot in 424 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 244/244 transitions.
Applied a total of 0 rules in 8 ms. Remains 301 /301 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2026-05-24 09:00:06] [INFO ] Invariant cache hit.
[2026-05-24 09:00:07] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-24 09:00:07] [INFO ] Invariant cache hit.
[2026-05-24 09:00:07] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2026-05-24 09:00:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/301 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 11/137 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 8/176 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/545 variables, and 179 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 113/113 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/301 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 113/179 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 15/214 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Problem TDEAD222 is UNSAT
At refinement iteration 13 (OVERLAPS) 244/545 variables, 301/547 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 242/789 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 20/809 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 809 constraints, problems are : Problem set: 1 solved, 242 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 242/243 constraints, Known Traps: 200/200 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 1 solved, 242 unsolved
Search for dead transitions found 1 dead transitions in 60050ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 301/301 places, 243/244 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60426 ms. Remains : 301/301 places, 243/244 transitions.
Computed a total of 184 stabilizing places and 153 stable transitions
Graph (complete) has 633 edges and 301 vertex of which 300 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 184 stabilizing places and 153 stable transitions
Detected a total of 184/301 stabilizing places and 153/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 11 states, 19 edges and 3 AP (stutter sensitive) to 11 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (450 resets) in 218 ms. (182 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (74 resets) in 62 ms. (634 steps per ms) remains 1/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6096073764244762681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11084430121748913066.kers'
[2026-05-24 09:01:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6096073764244762681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11084430121748913066.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 301 cols 725 entries
Finished phase 1 with 196 SingleSign rule and 38 generalized
[2026-05-24 09:01:07] [INFO ] Computed 67 invariants in 1 ms
Computed 67 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11084430121748913066.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 194/230 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/298 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 241/539 variables, 298/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/544 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/544 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 194/230 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/298 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 241/539 variables, 298/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/544 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/544 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 755ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 619 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=206 )
Parikh walk visited 1 properties in 3 ms.
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 11 states, 19 edges and 3 AP (stutter sensitive) to 11 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 1546 ms.
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 431 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 111 ms.
Product exploration explored 100000 steps with 20000 reset in 110 ms.
Spot run failed in 553 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin960768872315362896
[2026-05-24 09:01:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin960768872315362896
Running compilation step : cd /tmp/ltsmin960768872315362896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 479 ms.
Running link step : cd /tmp/ltsmin960768872315362896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin960768872315362896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4831779642841510412.hoa' '--buchi-type=spotba'
LTSmin run took 53 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-07-LTLFireability-04 finished in 128755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(X(p1)) U ((!p2&&X(X(p1)))||X(X(G(p1)))))))'
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 305 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 305 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 302 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 302 transition count 267
Applied a total of 24 rules in 16 ms. Remains 302 /314 variables (removed 12) and now considering 267/279 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4130633201255937557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4308951199293953788.kers'
[2026-05-24 09:01:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4130633201255937557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4308951199293953788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 302 cols 877 entries
Finished phase 1 with 193 SingleSign rule and 49 generalized
[2026-05-24 09:01:11] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4308951199293953788.kers
Total runtime 2 ms.
[2026-05-24 09:01:11] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-24 09:01:11] [INFO ] Invariant cache hit.
[2026-05-24 09:01:11] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-24 09:01:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/302 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 20/100 constraints. Problems are: Problem set: 11 solved, 255 unsolved
Problem TDEAD214 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 20/120 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 20/140 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 20/160 constraints. Problems are: Problem set: 17 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 20/180 constraints. Problems are: Problem set: 17 solved, 249 unsolved
Problem TDEAD215 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 20/200 constraints. Problems are: Problem set: 19 solved, 247 unsolved
Problem TDEAD234 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 12/212 constraints. Problems are: Problem set: 20 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/569 variables, and 214 constraints, problems are : Problem set: 20 solved, 246 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 154/154 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/302 variables, 43/57 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 3/60 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 154/214 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 1/215 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 20/235 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 4/239 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 20/259 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 9/268 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 20/288 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 1/289 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 6/295 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 13/308 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 1/309 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/302 variables, 1/310 constraints. Problems are: Problem set: 20 solved, 246 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 1/311 constraints. Problems are: Problem set: 20 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/569 variables, and 312 constraints, problems are : Problem set: 20 solved, 246 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 0/266 constraints, Known Traps: 252/252 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 20 solved, 246 unsolved
Search for dead transitions found 20 dead transitions in 60048ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 302/314 places, 247/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 247
Applied a total of 2 rules in 6 ms. Remains 300 /302 variables (removed 2) and now considering 247/247 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14301931421775282996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8440566535729755671.kers'
[2026-05-24 09:02:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14301931421775282996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8440566535729755671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 300 cols 753 entries
Finished phase 1 with 195 SingleSign rule and 41 generalized
[2026-05-24 09:02:11] [INFO ] Computed 64 invariants in 2 ms
Computed 64 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8440566535729755671.kers
Total runtime 2 ms.
[2026-05-24 09:02:11] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-24 09:02:11] [INFO ] Invariant cache hit.
[2026-05-24 09:02:12] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 300/314 places, 247/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60995 ms. Remains : 300/314 places, 247/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(X(p1)) U ((!p2&&X(X(p1)))||X(X(G(p1)))))))'
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 105 ms.
Product exploration explored 100000 steps with 33333 reset in 102 ms.
Computed a total of 183 stabilizing places and 157 stable transitions
Graph (complete) has 642 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 183 stabilizing places and 157 stable transitions
Detected a total of 183/300 stabilizing places and 157/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 20 factoid took 17 ms. Proved property starting from automaton with 8 states, 16 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-05 finished in 61551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p1&&X(F(p2))))))))'
Support contains 2 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 306 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 306 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 304 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 304 transition count 269
Applied a total of 20 rules in 12 ms. Remains 304 /314 variables (removed 10) and now considering 269/279 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6294551516395282927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13041894922411973031.kers'
[2026-05-24 09:02:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6294551516395282927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13041894922411973031.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 304 cols 881 entries
Finished phase 1 with 195 SingleSign rule and 49 generalized
[2026-05-24 09:02:12] [INFO ] Computed 60 invariants in 3 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13041894922411973031.kers
Total runtime 4 ms.
[2026-05-24 09:02:12] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-24 09:02:12] [INFO ] Invariant cache hit.
[2026-05-24 09:02:13] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-24 09:02:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/80 constraints. Problems are: Problem set: 10 solved, 258 unsolved
Problem TDEAD231 is UNSAT
Problem TDEAD243 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/100 constraints. Problems are: Problem set: 12 solved, 256 unsolved
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 20/120 constraints. Problems are: Problem set: 17 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 20/140 constraints. Problems are: Problem set: 17 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 20/160 constraints. Problems are: Problem set: 17 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/180 constraints. Problems are: Problem set: 17 solved, 251 unsolved
Problem TDEAD218 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 20/200 constraints. Problems are: Problem set: 19 solved, 249 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 20/220 constraints. Problems are: Problem set: 19 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/573 variables, and 223 constraints, problems are : Problem set: 19 solved, 249 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 163/163 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 19 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 19 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 43/57 constraints. Problems are: Problem set: 19 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 3/60 constraints. Problems are: Problem set: 19 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 163/223 constraints. Problems are: Problem set: 19 solved, 249 unsolved
Problem TDEAD234 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/243 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 16/259 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/259 constraints. Problems are: Problem set: 20 solved, 248 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 8 (OVERLAPS) 269/573 variables, 304/563 constraints. Problems are: Problem set: 25 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 243/806 constraints. Problems are: Problem set: 25 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 17/823 constraints. Problems are: Problem set: 25 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/573 variables, and 823 constraints, problems are : Problem set: 25 solved, 243 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 243/268 constraints, Known Traps: 216/216 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 25 solved, 243 unsolved
Search for dead transitions found 25 dead transitions in 60052ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 304/314 places, 244/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 244
Applied a total of 2 rules in 6 ms. Remains 302 /304 variables (removed 2) and now considering 244/244 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5817877077644915568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7167830424803769020.kers'
[2026-05-24 09:03:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5817877077644915568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7167830424803769020.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 302 cols 727 entries
Finished phase 1 with 197 SingleSign rule and 38 generalized
[2026-05-24 09:03:13] [INFO ] Computed 67 invariants in 2 ms
Computed 67 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7167830424803769020.kers
Total runtime 3 ms.
[2026-05-24 09:03:13] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-24 09:03:13] [INFO ] Invariant cache hit.
[2026-05-24 09:03:13] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 302/314 places, 244/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61009 ms. Remains : 302/314 places, 244/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p1&&X(F(p2))))))))'
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-06
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-06 finished in 61205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Graph (trivial) has 145 edges and 314 vertex of which 6 / 314 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 702 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 307 transition count 238
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 274 transition count 238
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 68 place count 274 transition count 173
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 207 place count 200 transition count 173
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 215 place count 192 transition count 165
Iterating global reduction 2 with 8 rules applied. Total rules applied 223 place count 192 transition count 165
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 370 place count 117 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 374 place count 115 transition count 95
Applied a total of 374 rules in 45 ms. Remains 115 /314 variables (removed 199) and now considering 95/279 (removed 184) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8986273372418040404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8658043452831639839.kers'
[2026-05-24 09:03:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8986273372418040404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8658043452831639839.kers]
Normalized transition count is 94 out of 95 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 94 rows 114 cols 536 entries
Finished phase 1 with 39 SingleSign rule and 28 generalized
[2026-05-24 09:03:13] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8658043452831639839.kers
Total runtime 3 ms.
[2026-05-24 09:03:14] [INFO ] Implicit Places using invariants in 74 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 74 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/314 places, 95/279 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 105/314 places, 95/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-08
Product exploration explored 100000 steps with 20617 reset in 204 ms.
Product exploration explored 100000 steps with 20277 reset in 214 ms.
Computed a total of 65 stabilizing places and 69 stable transitions
Computed a total of 65 stabilizing places and 69 stable transitions
Detected a total of 65/105 stabilizing places and 69/95 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 50 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 1564 steps (343 resets) in 21 ms. (71 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 169 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 95/95 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-158268609619628981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9624553808412649512.kers'
[2026-05-24 09:03:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-158268609619628981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9624553808412649512.kers]
Normalized transition count is 94 out of 95 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 105 cols 499 entries
Finished phase 1 with 39 SingleSign rule and 28 generalized
[2026-05-24 09:03:14] [INFO ] Computed 38 invariants in 0 ms
Computed 38 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9624553808412649512.kers
Total runtime 1 ms.
[2026-05-24 09:03:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 09:03:14] [INFO ] Invariant cache hit.
[2026-05-24 09:03:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 09:03:14] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [10, 26, 30, 33, 55, 57, 63, 65]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 230 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/105 places, 95/95 transitions.
Graph (complete) has 351 edges and 97 vertex of which 88 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 87 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 9 place count 81 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 81 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 80 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 80 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 78 transition count 67
Applied a total of 21 rules in 19 ms. Remains 78 /97 variables (removed 19) and now considering 67/95 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15055790458296778853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16645160903458108306.kers'
[2026-05-24 09:03:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15055790458296778853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16645160903458108306.kers]
Normalized transition count is 66 out of 67 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 78 cols 298 entries
Finished phase 1 with 37 SingleSign rule and 15 generalized
[2026-05-24 09:03:15] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16645160903458108306.kers
Total runtime 0 ms.
[2026-05-24 09:03:15] [INFO ] Implicit Places using invariants in 48 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/105 places, 67/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 308 ms. Remains : 77/105 places, 67/95 transitions.
Computed a total of 37 stabilizing places and 41 stable transitions
Computed a total of 37 stabilizing places and 41 stable transitions
Detected a total of 37/77 stabilizing places and 41/67 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 36 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 988 steps (231 resets) in 8 ms. (109 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 46 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 147 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20867 reset in 106 ms.
Product exploration explored 100000 steps with 20767 reset in 114 ms.
Built C files in :
/tmp/ltsmin7040992178071108346
[2026-05-24 09:03:15] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2026-05-24 09:03:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:03:15] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2026-05-24 09:03:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:03:15] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2026-05-24 09:03:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 09:03:15] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7040992178071108346
Running compilation step : cd /tmp/ltsmin7040992178071108346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 163 ms.
Running link step : cd /tmp/ltsmin7040992178071108346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7040992178071108346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15736638757775203357.hoa' '--buchi-type=spotba'
LTSmin run took 2885 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-07-LTLFireability-08 finished in 4813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p0) U p1))))'
Support contains 2 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 305 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 305 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 302 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 302 transition count 267
Applied a total of 24 rules in 20 ms. Remains 302 /314 variables (removed 12) and now considering 267/279 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3601812925462864666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4144595594673310153.kers'
[2026-05-24 09:03:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3601812925462864666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4144595594673310153.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 302 cols 877 entries
Finished phase 1 with 193 SingleSign rule and 49 generalized
[2026-05-24 09:03:18] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4144595594673310153.kers
Total runtime 1 ms.
[2026-05-24 09:03:18] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-24 09:03:18] [INFO ] Invariant cache hit.
[2026-05-24 09:03:19] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-24 09:03:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/302 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 20/100 constraints. Problems are: Problem set: 11 solved, 255 unsolved
Problem TDEAD214 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 20/120 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 20/140 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 20/160 constraints. Problems are: Problem set: 17 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 20/180 constraints. Problems are: Problem set: 17 solved, 249 unsolved
Problem TDEAD215 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 20/200 constraints. Problems are: Problem set: 19 solved, 247 unsolved
Problem TDEAD234 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 12/212 constraints. Problems are: Problem set: 20 solved, 246 unsolved
SMT process timed out in 30046ms, After SMT, problems are : Problem set: 20 solved, 246 unsolved
Search for dead transitions found 20 dead transitions in 30047ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 302/314 places, 247/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 247
Applied a total of 2 rules in 8 ms. Remains 300 /302 variables (removed 2) and now considering 247/247 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5078558977298537340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8435477117279260907.kers'
[2026-05-24 09:03:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5078558977298537340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8435477117279260907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 300 cols 753 entries
Finished phase 1 with 195 SingleSign rule and 41 generalized
[2026-05-24 09:03:49] [INFO ] Computed 64 invariants in 3 ms
Computed 64 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8435477117279260907.kers
Total runtime 4 ms.
[2026-05-24 09:03:49] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-24 09:03:49] [INFO ] Invariant cache hit.
[2026-05-24 09:03:49] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 300/314 places, 247/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31048 ms. Remains : 300/314 places, 247/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p0) U p1))))'
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-12 finished in 31253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&F(p1))))'
Support contains 1 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 306 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 306 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 303 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 303 transition count 268
Applied a total of 22 rules in 16 ms. Remains 303 /314 variables (removed 11) and now considering 268/279 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16853906799999458369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1307138947132673168.kers'
[2026-05-24 09:03:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16853906799999458369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1307138947132673168.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 303 cols 879 entries
Finished phase 1 with 194 SingleSign rule and 49 generalized
[2026-05-24 09:03:49] [INFO ] Computed 60 invariants in 4 ms
Computed 60 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1307138947132673168.kers
Total runtime 5 ms.
[2026-05-24 09:03:50] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-24 09:03:50] [INFO ] Invariant cache hit.
[2026-05-24 09:03:50] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-24 09:03:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 20/100 constraints. Problems are: Problem set: 4 solved, 263 unsolved
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 20/120 constraints. Problems are: Problem set: 11 solved, 256 unsolved
Problem TDEAD210 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 20/140 constraints. Problems are: Problem set: 17 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 20/160 constraints. Problems are: Problem set: 17 solved, 250 unsolved
Problem TDEAD228 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 20/180 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 7/187 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 18/205 constraints. Problems are: Problem set: 20 solved, 247 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/571 variables, and 209 constraints, problems are : Problem set: 20 solved, 247 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 149/149 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 43/57 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 3/60 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 149/209 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 11/220 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 11/231 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 6/237 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 8/245 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 16/261 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 11/272 constraints. Problems are: Problem set: 20 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/272 constraints. Problems are: Problem set: 20 solved, 247 unsolved
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 12 (OVERLAPS) 268/571 variables, 303/575 constraints. Problems are: Problem set: 25 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 242/817 constraints. Problems are: Problem set: 25 solved, 242 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 821 constraints, problems are : Problem set: 25 solved, 242 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 242/267 constraints, Known Traps: 216/216 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 25 solved, 242 unsolved
Search for dead transitions found 25 dead transitions in 60053ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 303/314 places, 243/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 301 transition count 243
Applied a total of 2 rules in 8 ms. Remains 301 /303 variables (removed 2) and now considering 243/243 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14127662339978358956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13795454232187943158.kers'
[2026-05-24 09:04:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14127662339978358956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13795454232187943158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 301 cols 725 entries
Finished phase 1 with 196 SingleSign rule and 38 generalized
[2026-05-24 09:04:50] [INFO ] Computed 67 invariants in 3 ms
Computed 67 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13795454232187943158.kers
Total runtime 4 ms.
[2026-05-24 09:04:50] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-24 09:04:50] [INFO ] Invariant cache hit.
[2026-05-24 09:04:50] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 301/314 places, 243/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61017 ms. Remains : 301/314 places, 243/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-13 finished in 61232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Graph (trivial) has 146 edges and 314 vertex of which 6 / 314 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 702 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 307 transition count 237
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 273 transition count 237
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 70 place count 273 transition count 172
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 209 place count 199 transition count 172
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 217 place count 191 transition count 164
Iterating global reduction 2 with 8 rules applied. Total rules applied 225 place count 191 transition count 164
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 368 place count 118 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 372 place count 116 transition count 96
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 378 place count 116 transition count 96
Applied a total of 378 rules in 39 ms. Remains 116 /314 variables (removed 198) and now considering 96/279 (removed 183) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4906746603917740528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1583610734487768778.kers'
[2026-05-24 09:04:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4906746603917740528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1583610734487768778.kers]
Normalized transition count is 95 out of 96 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 95 rows 115 cols 538 entries
Finished phase 1 with 40 SingleSign rule and 28 generalized
[2026-05-24 09:04:51] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1583610734487768778.kers
Total runtime 0 ms.
[2026-05-24 09:04:51] [INFO ] Implicit Places using invariants in 79 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 80 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/314 places, 96/279 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 106/314 places, 96/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-14 finished in 179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(p0||X(F((p0&&F(p1)))))))'
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 279/279 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 306 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 306 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 304 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 304 transition count 269
Applied a total of 20 rules in 17 ms. Remains 304 /314 variables (removed 10) and now considering 269/279 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-180108667406407173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15829431628943883731.kers'
[2026-05-24 09:04:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-180108667406407173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15829431628943883731.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 304 cols 881 entries
Finished phase 1 with 195 SingleSign rule and 49 generalized
[2026-05-24 09:04:51] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15829431628943883731.kers
Total runtime 2 ms.
[2026-05-24 09:04:51] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-24 09:04:51] [INFO ] Invariant cache hit.
[2026-05-24 09:04:51] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-24 09:04:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/80 constraints. Problems are: Problem set: 8 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/100 constraints. Problems are: Problem set: 8 solved, 260 unsolved
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 20/120 constraints. Problems are: Problem set: 11 solved, 257 unsolved
Problem TDEAD213 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 20/140 constraints. Problems are: Problem set: 13 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 20/160 constraints. Problems are: Problem set: 13 solved, 255 unsolved
Problem TDEAD234 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/180 constraints. Problems are: Problem set: 14 solved, 254 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 13/193 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 9/202 constraints. Problems are: Problem set: 20 solved, 248 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/573 variables, and 212 constraints, problems are : Problem set: 20 solved, 248 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 152/152 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 43/57 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 3/60 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 152/212 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 1/213 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 18/231 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 16/247 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 11/258 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 5/263 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 8/271 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 7/278 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 14/292 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 4/296 constraints. Problems are: Problem set: 20 solved, 248 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 2/298 constraints. Problems are: Problem set: 20 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/573 variables, and 307 constraints, problems are : Problem set: 20 solved, 248 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 0/268 constraints, Known Traps: 247/247 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60039ms problems are : Problem set: 20 solved, 248 unsolved
Search for dead transitions found 20 dead transitions in 60039ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 304/314 places, 249/279 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 249
Applied a total of 2 rules in 6 ms. Remains 302 /304 variables (removed 2) and now considering 249/249 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4861488593799633831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10134340354778748198.kers'
[2026-05-24 09:05:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4861488593799633831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10134340354778748198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 302 cols 757 entries
Finished phase 1 with 197 SingleSign rule and 41 generalized
[2026-05-24 09:05:51] [INFO ] Computed 64 invariants in 1 ms
Computed 64 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10134340354778748198.kers
Total runtime 2 ms.
[2026-05-24 09:05:52] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-24 09:05:52] [INFO ] Invariant cache hit.
[2026-05-24 09:05:52] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 302/314 places, 249/279 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61025 ms. Remains : 302/314 places, 249/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(p0||X(F((p0&&F(p1)))))))'
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-15
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-15 finished in 61276 ms.
All properties solved by simple procedures.
Total runtime 630654 ms.

BK_STOP 1779613552673

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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