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.r098-tall-177955695700714.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 DLCshifumi-PT-4a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700714
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.6K Mar 6 17:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 6 17:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 17:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 6 17:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 6 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:30 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 1.9M 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 DLCshifumi-PT-4a-CTLFireability-2024-00
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-01
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-02
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-03
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-04
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-05
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-06
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-07
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-08
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-09
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-10
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-11
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-12
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-13
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-14
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779654819893

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-4a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 20:33:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 20:33:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:33:41] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2026-05-24 20:33:41] [INFO ] Transformed 1178 places.
[2026-05-24 20:33:41] [INFO ] Transformed 7504 transitions.
[2026-05-24 20:33:41] [INFO ] Found NUPN structural information;
[2026-05-24 20:33:41] [INFO ] Parsed PT model containing 1178 places and 7504 transitions and 28610 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 924 transitions
Reduce redundant transitions removed 924 transitions.
Support contains 185 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 6580/6580 transitions.
Discarding 129 places :
Symmetric choice reduction at 0 with 129 rule applications. Total rules 129 place count 1049 transition count 5935
Iterating global reduction 0 with 129 rules applied. Total rules applied 258 place count 1049 transition count 5935
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 322 place count 1049 transition count 5871
Drop transitions (Redundant composition of simpler transitions.) removed 2160 transitions
Redundant transition composition rules discarded 2160 transitions
Iterating global reduction 1 with 2160 rules applied. Total rules applied 2482 place count 1049 transition count 3711
Applied a total of 2482 rules in 517 ms. Remains 1049 /1178 variables (removed 129) and now considering 3711/6580 (removed 2869) transitions.
[2026-05-24 20:33:42] [INFO ] Flow matrix only has 623 transitions (discarded 3088 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7333703865466335941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-52376232825320108.kers'
[2026-05-24 20:33:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7333703865466335941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-52376232825320108.kers]
Normalized transition count is 622 out of 623 initially.
Culling duplicate invariants (modulo rational): removing 612 columns.
Culled 612 columns in 0 ms.
// Phase 1: matrix 622 rows 437 cols 1322 entries
Finished phase 1 with 358 SingleSign rule and 0 generalized
[2026-05-24 20:33:42] [INFO ] Computed 691 invariants in 2 ms
Computed 691 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-52376232825320108.kers
Total runtime 3 ms.
[2026-05-24 20:33:46] [INFO ] Implicit Places using invariants in 4263 ms returned [437, 439, 441, 443, 444, 445, 446, 447, 448, 449, 451, 452, 453, 454, 455, 456, 457, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 513, 515, 516, 517, 518, 519, 520, 521, 522, 524, 525, 528, 529, 530, 531, 532, 533, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 560, 561, 562, 563, 565, 566, 567, 568, 569, 571, 572, 573, 576, 578, 579, 580, 581, 582, 583, 584, 586, 588, 589, 590, 591, 593, 594, 595, 596, 598, 599, 600, 602, 603, 607, 608, 609, 610, 611, 612, 613, 615, 616, 617, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 631, 632, 633, 634, 635, 636, 638, 639, 640, 641, 642, 644, 645, 646, 647, 649, 651, 652, 653, 654, 659, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 673, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 710, 711, 712, 713, 714, 715, 716, 718, 719, 720, 721, 722, 723, 724, 725, 727, 728, 729, 730, 731, 732, 734, 735, 736, 737, 738, 739, 740, 741, 742, 744, 745, 746, 747, 748, 750, 751, 752, 753, 754, 755, 756, 757, 759, 761, 762, 763, 764, 765, 766, 768, 769, 771, 772, 775, 776, 777, 778, 779, 780, 781, 784, 786, 787, 788, 789, 790, 791, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 817, 818, 819, 821, 823, 825, 827, 828, 829, 830, 831, 832, 833, 835, 838, 840, 841, 842, 843, 844, 845, 846, 847, 849, 850, 851, 852, 856, 857, 859, 860, 861, 862, 863, 865, 866, 868, 870, 872, 874, 875, 876, 877, 878, 879, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 894, 895, 896, 897, 898, 899, 901, 902, 903, 904, 905, 906, 907, 909, 911, 912, 913, 914, 916, 917, 918, 919, 920, 921, 922, 923, 925, 926, 927, 928, 929, 930, 931, 933, 934, 935, 936, 938, 939, 940, 941, 942, 943, 945, 946, 947, 948, 949, 951, 952, 953, 954, 955, 956, 957, 959, 960, 961, 962, 963, 964, 965, 966, 968, 969, 971, 972, 973, 974, 975, 976, 977, 978, 979, 980, 982, 983, 984, 985, 987, 988, 989, 990, 992, 993, 994, 995, 996, 997, 1000, 1001, 1003, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1013, 1014, 1016, 1017, 1018, 1019, 1020, 1021, 1023, 1024, 1025, 1026, 1027, 1029, 1031, 1032, 1033, 1035, 1036, 1037, 1038, 1039, 1041, 1042, 1044, 1045, 1046, 1047, 1048]
Discarding 506 places :
Ensure Unique test removed 2290 transitions
Reduce isomorphic transitions removed 2290 transitions.
Implicit Place search using SMT only with invariants took 4314 ms to find 506 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 543/1178 places, 1421/6580 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 604 transitions
Redundant transition composition rules discarded 604 transitions
Iterating global reduction 0 with 604 rules applied. Total rules applied 604 place count 543 transition count 817
Applied a total of 604 rules in 29 ms. Remains 543 /543 variables (removed 0) and now considering 817/1421 (removed 604) transitions.
[2026-05-24 20:33:46] [INFO ] Flow matrix only has 623 transitions (discarded 194 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11969987817509553216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11418724622596333853.kers'
[2026-05-24 20:33:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11969987817509553216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11418724622596333853.kers]
Normalized transition count is 622 out of 623 initially.
Culling duplicate invariants (modulo rational): removing 106 columns.
Culled 106 columns in 0 ms.
// Phase 1: matrix 622 rows 437 cols 1322 entries
Finished phase 1 with 358 SingleSign rule and 0 generalized
[2026-05-24 20:33:46] [INFO ] Computed 185 invariants in 2 ms
Computed 185 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11418724622596333853.kers
Total runtime 3 ms.
[2026-05-24 20:33:46] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-24 20:33:46] [INFO ] Flow matrix only has 623 transitions (discarded 194 similar events)
[2026-05-24 20:33:46] [INFO ] Invariant cache hit.
[2026-05-24 20:33:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:33:46] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 543/1178 places, 817/6580 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5268 ms. Remains : 543/1178 places, 817/6580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Applied a total of 0 rules in 6 ms. Remains 543 /543 variables (removed 0) and now considering 817/817 (removed 0) transitions.
[2026-05-24 20:33:46] [INFO ] Flow matrix only has 623 transitions (discarded 194 similar events)
[2026-05-24 20:33:46] [INFO ] Invariant cache hit.
[2026-05-24 20:33:46] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-24 20:33:46] [INFO ] Flow matrix only has 623 transitions (discarded 194 similar events)
[2026-05-24 20:33:46] [INFO ] Invariant cache hit.
[2026-05-24 20:33:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:33:47] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2026-05-24 20:33:47] [INFO ] Flow matrix only has 623 transitions (discarded 194 similar events)
[2026-05-24 20:33:47] [INFO ] Invariant cache hit.
[2026-05-24 20:33:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 3 (OVERLAPS) 106/543 variables, 106/185 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1166 variables, and 185 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 0/543 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 3 (OVERLAPS) 106/543 variables, 106/185 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 5 (OVERLAPS) 622/1165 variables, 543/728 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1165 variables, 816/1544 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1165/1166 variables, and 1544 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 543/543 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Finished structural reductions in LTL mode , in 1 iterations and 60647 ms. Remains : 543/543 places, 817/817 transitions.
Support contains 185 out of 543 places after structural reductions.
[2026-05-24 20:34:47] [INFO ] Flatten gal took : 81 ms
[2026-05-24 20:34:47] [INFO ] Flatten gal took : 38 ms
[2026-05-24 20:34:47] [INFO ] Input system was already deterministic with 817 transitions.
Support contains 177 out of 543 places (down from 185) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2581 ms. (15 steps per ms) remains 2/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
[2026-05-24 20:34:48] [INFO ] Flow matrix only has 623 transitions (discarded 194 similar events)
[2026-05-24 20:34:48] [INFO ] Invariant cache hit.
[2026-05-24 20:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/32 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 511/543 variables, 176/185 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 622/1165 variables, 543/728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1165 variables, 0/728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1166 variables, 1/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1166 variables, 0/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/1166 variables, 0/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1166/1166 variables, and 729 constraints, problems are : Problem set: 1 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 543/543 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 513/543 variables, 178/185 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 622/1165 variables, 543/728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1165 variables, 1/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1165 variables, 0/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1166 variables, 1/730 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1166 variables, 0/730 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1166 variables, 0/730 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1166/1166 variables, and 730 constraints, problems are : Problem set: 1 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 543/543 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 745ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 107 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-24 20:34:49] [INFO ] Flatten gal took : 28 ms
[2026-05-24 20:34:49] [INFO ] Flatten gal took : 37 ms
[2026-05-24 20:34:49] [INFO ] Input system was already deterministic with 817 transitions.
Support contains 172 out of 543 places (down from 176) after GAL structural reductions.
Computed a total of 107 stabilizing places and 1 stable transitions
Graph (complete) has 1001 edges and 543 vertex of which 437 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Graph (trivial) has 807 edges and 543 vertex of which 430 / 543 are part of one of the 78 SCC in 3 ms
Free SCC test removed 352 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 275 edges and 191 vertex of which 87 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.0 ms
Discarding 104 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 89
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 85 transition count 88
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 83 place count 9 transition count 12
Iterating global reduction 2 with 76 rules applied. Total rules applied 159 place count 9 transition count 12
Applied a total of 159 rules in 16 ms. Remains 9 /543 variables (removed 534) and now considering 12/817 (removed 805) transitions.
[2026-05-24 20:34:49] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13937569251045091009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2768144938936924425.kers'
[2026-05-24 20:34:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13937569251045091009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2768144938936924425.kers]
Normalized transition count is 7 out of 8 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 15 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 20:34:49] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2768144938936924425.kers
Total runtime 0 ms.
[2026-05-24 20:34:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 20:34:49] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
[2026-05-24 20:34:49] [INFO ] Invariant cache hit.
[2026-05-24 20:34:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:34:49] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-24 20:34:49] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-24 20:34:49] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
[2026-05-24 20:34:49] [INFO ] Invariant cache hit.
[2026-05-24 20:34:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 7/16 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 15 constraints, problems are : Problem set: 0 solved, 11 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 7/16 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 26 constraints, problems are : Problem set: 0 solved, 11 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 229ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/543 places, 12/817 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 293 ms. Remains : 9/543 places, 12/817 transitions.
[2026-05-24 20:34:50] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:34:50] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:34:50] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-24 20:34:50] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:34:50] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:34:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15712555456969404782.gal : 1 ms
[2026-05-24 20:34:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6716904403754608450.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15712555456969404782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6716904403754608450.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7,0.009322,3688,2,18,5,62,6,0,37,39,0


Converting to forward existential form...Done !
original formula: EF(EG((EF(((p559==0)||(p1163==0))) * ((p168==0)||(p912==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U ((p559==0)||(p1163==0))) * ((p168==0)||(p912==0))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.011117,4000,1,0,9,145,21,3,181,121,13
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 449 transition count 817
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 118 place count 425 transition count 769
Iterating global reduction 1 with 24 rules applied. Total rules applied 142 place count 425 transition count 769
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 152 place count 425 transition count 759
Applied a total of 152 rules in 21 ms. Remains 425 /543 variables (removed 118) and now considering 759/817 (removed 58) transitions.
[2026-05-24 20:34:50] [INFO ] Flow matrix only has 589 transitions (discarded 170 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11289461231519094645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8710309266936157552.kers'
[2026-05-24 20:34:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11289461231519094645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8710309266936157552.kers]
Normalized transition count is 588 out of 589 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 588 rows 413 cols 1254 entries
Finished phase 1 with 334 SingleSign rule and 0 generalized
[2026-05-24 20:34:50] [INFO ] Computed 91 invariants in 1 ms
Computed 91 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8710309266936157552.kers
Total runtime 2 ms.
[2026-05-24 20:34:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-24 20:34:50] [INFO ] Flow matrix only has 589 transitions (discarded 170 similar events)
[2026-05-24 20:34:50] [INFO ] Invariant cache hit.
[2026-05-24 20:34:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:34:50] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 758 sub problems to find dead transitions.
[2026-05-24 20:34:50] [INFO ] Flow matrix only has 589 transitions (discarded 170 similar events)
[2026-05-24 20:34:50] [INFO ] Invariant cache hit.
[2026-05-24 20:34:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 3 (OVERLAPS) 12/425 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1014 variables, and 91 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/425 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 3 (OVERLAPS) 12/425 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 5 (OVERLAPS) 588/1013 variables, 425/516 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1013 variables, 758/1274 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1013/1014 variables, and 1274 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 425/425 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 425/543 places, 759/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60426 ms. Remains : 425/543 places, 759/817 transitions.
[2026-05-24 20:35:50] [INFO ] Flatten gal took : 20 ms
[2026-05-24 20:35:50] [INFO ] Flatten gal took : 15 ms
[2026-05-24 20:35:50] [INFO ] Input system was already deterministic with 759 transitions.
[2026-05-24 20:35:50] [INFO ] Flatten gal took : 14 ms
[2026-05-24 20:35:50] [INFO ] Flatten gal took : 14 ms
[2026-05-24 20:35:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17429850096162762887.gal : 10 ms
[2026-05-24 20:35:50] [INFO ] Time to serialize properties into /tmp/CTLFireability723557202979464801.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17429850096162762887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability723557202979464801.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05829e+56,0.175818,7468,2,1183,5,4503,6,0,2254,3065,0


Converting to forward existential form...Done !
original formula: E(E(EX((AF(((p554==1)&&(p872==1))) * EG(((p539==1)&&(p819==1))))) U (E(((((p542==1)&&(p801==1))&&((p554==1)&&(p914==1)))||(!((p554==1)&&(...399
=> equivalent forward existential formula: ([(FwdU(Init,E(EX((!(EG(!(((p554==1)&&(p872==1))))) * EG(((p539==1)&&(p819==1))))) U (E(((((p542==1)&&(p801==1))...854
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 747/0/12
Hit Full ! (commute/partial/dont) 754/0/5
(forward)formula 0,1,3.58408,123504,1,0,515,468642,61,343,10011,830743,528
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 441 transition count 817
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 127 place count 416 transition count 767
Iterating global reduction 1 with 25 rules applied. Total rules applied 152 place count 416 transition count 767
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 162 place count 416 transition count 757
Applied a total of 162 rules in 15 ms. Remains 416 /543 variables (removed 127) and now considering 757/817 (removed 60) transitions.
[2026-05-24 20:35:54] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9084623139063207392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3660821585205594299.kers'
[2026-05-24 20:35:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9084623139063207392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3660821585205594299.kers]
Normalized transition count is 587 out of 588 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 587 rows 412 cols 1252 entries
Finished phase 1 with 333 SingleSign rule and 0 generalized
[2026-05-24 20:35:54] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3660821585205594299.kers
Total runtime 3 ms.
[2026-05-24 20:35:54] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 20:35:54] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
[2026-05-24 20:35:54] [INFO ] Invariant cache hit.
[2026-05-24 20:35:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:35:54] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 756 sub problems to find dead transitions.
[2026-05-24 20:35:54] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
[2026-05-24 20:35:54] [INFO ] Invariant cache hit.
[2026-05-24 20:35:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 3 (OVERLAPS) 4/416 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1004 variables, and 83 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 0/416 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 3 (OVERLAPS) 4/416 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (OVERLAPS) 587/1003 variables, 416/499 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 756/1255 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1004 variables, and 1255 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 416/416 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 416/543 places, 757/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60384 ms. Remains : 416/543 places, 757/817 transitions.
[2026-05-24 20:36:54] [INFO ] Flatten gal took : 16 ms
[2026-05-24 20:36:54] [INFO ] Flatten gal took : 26 ms
[2026-05-24 20:36:54] [INFO ] Input system was already deterministic with 757 transitions.
[2026-05-24 20:36:54] [INFO ] Flatten gal took : 15 ms
[2026-05-24 20:36:54] [INFO ] Flatten gal took : 10 ms
[2026-05-24 20:36:54] [INFO ] Time to serialize gal into /tmp/CTLFireability980846131343670717.gal : 3 ms
[2026-05-24 20:36:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7414692848797656727.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability980846131343670717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7414692848797656727.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.10769e+56,0.203379,7440,2,1164,5,4439,6,0,2241,3022,0


Converting to forward existential form...Done !
original formula: EX(EF((((AF(EG(((p558==1)&&(p1159==1)))) * !(E(((p317==1)&&(p656==1)) U (p144==1)))) * (AF(((p494==1)&&(p706==1))) * (p565==1))) * (p1157...162
=> equivalent forward existential formula: [((((FwdU(EY(Init),TRUE) * (p1157==1)) * (!(EG(!(EG(((p558==1)&&(p1159==1)))))) * !(E(((p317==1)&&(p656==1)) U (...226
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 753/4/4
Using saturation style SCC detection
(forward)formula 0,0,1.29678,36612,1,0,18,169817,42,7,11165,11139,19
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Graph (trivial) has 769 edges and 543 vertex of which 405 / 543 are part of one of the 77 SCC in 4 ms
Free SCC test removed 328 places
Ensure Unique test removed 671 transitions
Reduce isomorphic transitions removed 671 transitions.
Graph (complete) has 330 edges and 215 vertex of which 118 are kept as prefixes of interest. Removing 97 places using SCC suffix rule.2 ms
Discarding 97 places :
Also discarding 0 output 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 3 place count 118 transition count 145
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 117 transition count 140
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 16 place count 112 transition count 138
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 89 place count 39 transition count 63
Iterating global reduction 3 with 73 rules applied. Total rules applied 162 place count 39 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 39 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 39 transition count 61
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 38 transition count 60
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 38 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 38 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 38 transition count 58
Applied a total of 169 rules in 25 ms. Remains 38 /543 variables (removed 505) and now considering 58/817 (removed 759) transitions.
[2026-05-24 20:36:56] [INFO ] Flow matrix only has 38 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15054338053784064093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10117753064050386607.kers'
[2026-05-24 20:36:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15054338053784064093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10117753064050386607.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 37 rows 28 cols 80 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-24 20:36:56] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10117753064050386607.kers
Total runtime 2 ms.
[2026-05-24 20:36:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 20:36:56] [INFO ] Flow matrix only has 38 transitions (discarded 20 similar events)
[2026-05-24 20:36:56] [INFO ] Invariant cache hit.
[2026-05-24 20:36:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:36:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2026-05-24 20:36:56] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2026-05-24 20:36:56] [INFO ] Flow matrix only has 38 transitions (discarded 20 similar events)
[2026-05-24 20:36:56] [INFO ] Invariant cache hit.
[2026-05-24 20:36:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 37/75 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 1/76 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/76 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 56 constraints, problems are : Problem set: 0 solved, 57 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 37/75 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 57/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 1/76 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/76 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 113 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2148ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2148ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/543 places, 58/817 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2241 ms. Remains : 38/543 places, 58/817 transitions.
[2026-05-24 20:36:58] [INFO ] Flatten gal took : 2 ms
[2026-05-24 20:36:58] [INFO ] Flatten gal took : 2 ms
[2026-05-24 20:36:58] [INFO ] Input system was already deterministic with 58 transitions.
[2026-05-24 20:36:58] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:36:58] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:36:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11233762990731535872.gal : 0 ms
[2026-05-24 20:36:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14651922583330729722.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11233762990731535872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14651922583330729722.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5185,0.015879,4048,2,96,5,327,6,0,162,220,0


Converting to forward existential form...Done !
original formula: A(EF(((AG((((p544==1)&&(p726==1))||((p531==1)&&(p693==1)))) + A((((p294==1)&&(p1099==1))||(p524==1)) U ((p548==1)&&(p955==1)))) + AF(((((...283
=> equivalent forward existential formula: [((Init * !(EG(!(((p534==1)&&(p652==1)))))) * !(E(!(((p534==1)&&(p652==1))) U (!(E(TRUE U ((!(E(TRUE U !((((p544...501
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 54/0/4
(forward)formula 0,0,0.033389,4804,1,0,15,2377,46,6,872,1226,20
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Graph (trivial) has 749 edges and 543 vertex of which 388 / 543 are part of one of the 75 SCC in 3 ms
Free SCC test removed 313 places
Ensure Unique test removed 638 transitions
Reduce isomorphic transitions removed 638 transitions.
Graph (complete) has 363 edges and 230 vertex of which 138 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.3 ms
Discarding 92 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 138 transition count 176
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 135 transition count 174
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 133 transition count 173
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 88 place count 58 transition count 93
Iterating global reduction 3 with 75 rules applied. Total rules applied 163 place count 58 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 58 transition count 89
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 58 transition count 89
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 55 transition count 86
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 55 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 179 place count 55 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 55 transition count 81
Applied a total of 181 rules in 23 ms. Remains 55 /543 variables (removed 488) and now considering 81/817 (removed 736) transitions.
[2026-05-24 20:36:58] [INFO ] Flow matrix only has 56 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10404488850485636417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7435010864293916911.kers'
[2026-05-24 20:36:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10404488850485636417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7435010864293916911.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 55 rows 40 cols 117 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-24 20:36:58] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7435010864293916911.kers
Total runtime 0 ms.
[2026-05-24 20:36:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 20:36:58] [INFO ] Flow matrix only has 56 transitions (discarded 25 similar events)
[2026-05-24 20:36:58] [INFO ] Invariant cache hit.
[2026-05-24 20:36:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:36:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-24 20:36:58] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2026-05-24 20:36:58] [INFO ] Flow matrix only has 56 transitions (discarded 25 similar events)
[2026-05-24 20:36:58] [INFO ] Invariant cache hit.
[2026-05-24 20:36:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 14/55 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 55/110 variables, 55/78 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 79 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1690 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 14/55 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 55/110 variables, 55/78 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 80/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/111 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 159 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1858 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3552ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3552ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/543 places, 81/817 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3634 ms. Remains : 55/543 places, 81/817 transitions.
[2026-05-24 20:37:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 20:37:01] [INFO ] Flatten gal took : 3 ms
[2026-05-24 20:37:01] [INFO ] Input system was already deterministic with 81 transitions.
[2026-05-24 20:37:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 20:37:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 20:37:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8321442371732023258.gal : 1 ms
[2026-05-24 20:37:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5249803147052035755.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8321442371732023258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5249803147052035755.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,122473,0.008603,4196,2,141,5,499,6,0,233,340,0


Converting to forward existential form...Done !
original formula: A(!(((p552==1)&&(p889==1))) U (((!(((AG(((p529==1)&&(p587==1))) * (p540==1)) * ((p759==1)&&((!((p554==1)&&(p982==1)))||((p564==1)&&(p1096...458
=> equivalent forward existential formula: [((Init * !(EG(!((((!(((!(E(TRUE U !(((p529==1)&&(p587==1))))) * (p540==1)) * ((p759==1)&&((!((p554==1)&&(p982==...1584
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 77/4/4
Hit Full ! (commute/partial/dont) 79/0/2
Using saturation style SCC detection
(forward)formula 0,0,0.052676,5472,1,0,37,6618,68,23,1364,4124,37
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 442 transition count 817
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 129 place count 414 transition count 761
Iterating global reduction 1 with 28 rules applied. Total rules applied 157 place count 414 transition count 761
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 168 place count 414 transition count 750
Applied a total of 168 rules in 17 ms. Remains 414 /543 variables (removed 129) and now considering 750/817 (removed 67) transitions.
[2026-05-24 20:37:02] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15048661207190007205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17908227009035368353.kers'
[2026-05-24 20:37:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15048661207190007205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17908227009035368353.kers]
Normalized transition count is 583 out of 584 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 583 rows 409 cols 1244 entries
Finished phase 1 with 330 SingleSign rule and 0 generalized
[2026-05-24 20:37:02] [INFO ] Computed 84 invariants in 2 ms
Computed 84 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17908227009035368353.kers
Total runtime 3 ms.
[2026-05-24 20:37:02] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 20:37:02] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2026-05-24 20:37:02] [INFO ] Invariant cache hit.
[2026-05-24 20:37:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:37:02] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 749 sub problems to find dead transitions.
[2026-05-24 20:37:02] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2026-05-24 20:37:02] [INFO ] Invariant cache hit.
[2026-05-24 20:37:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 5/414 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/998 variables, and 84 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 5/414 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 583/997 variables, 414/498 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 749/1247 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/998 variables, and 1247 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 414/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 414/543 places, 750/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60413 ms. Remains : 414/543 places, 750/817 transitions.
[2026-05-24 20:38:02] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:38:02] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:38:02] [INFO ] Input system was already deterministic with 750 transitions.
[2026-05-24 20:38:02] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:38:02] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:38:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7868976054854002622.gal : 2 ms
[2026-05-24 20:38:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6333452566312053906.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7868976054854002622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6333452566312053906.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30104e+56,0.165771,7456,2,1157,5,4400,6,0,2226,3000,0


Converting to forward existential form...Done !
original formula: E((EF(((p544==1)&&(p766==1))) * (AF(!(((E(((p543==1)&&(p743==1)) U ((p483==1)&&(p703==1))) * (p555==1)) * ((p1172==1)&&(p347==1))))) + EX...204
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U ((p544==1)&&(p766==1))) * (!(EG(!(!(((E(((p543==1)&&(p743==1)) U ((p483==1)&&(p703==1))) *...286
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.895862,33668,1,0,6,166981,15,0,9325,8373,6
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 444 transition count 817
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 128 place count 415 transition count 759
Iterating global reduction 1 with 29 rules applied. Total rules applied 157 place count 415 transition count 759
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 168 place count 415 transition count 748
Applied a total of 168 rules in 9 ms. Remains 415 /543 variables (removed 128) and now considering 748/817 (removed 69) transitions.
[2026-05-24 20:38:03] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4850604090119431310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-836219811236755829.kers'
[2026-05-24 20:38:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4850604090119431310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-836219811236755829.kers]
Normalized transition count is 582 out of 583 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 582 rows 408 cols 1242 entries
Finished phase 1 with 329 SingleSign rule and 0 generalized
[2026-05-24 20:38:03] [INFO ] Computed 86 invariants in 2 ms
Computed 86 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-836219811236755829.kers
Total runtime 3 ms.
[2026-05-24 20:38:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 20:38:03] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
[2026-05-24 20:38:03] [INFO ] Invariant cache hit.
[2026-05-24 20:38:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:38:03] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 747 sub problems to find dead transitions.
[2026-05-24 20:38:03] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
[2026-05-24 20:38:03] [INFO ] Invariant cache hit.
[2026-05-24 20:38:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 1 (OVERLAPS) 1/408 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 3 (OVERLAPS) 7/415 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 747 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/998 variables, and 86 constraints, problems are : Problem set: 0 solved, 747 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 747/747 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 747 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 1 (OVERLAPS) 1/408 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 3 (OVERLAPS) 7/415 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 5 (OVERLAPS) 582/997 variables, 415/501 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 747/1248 constraints. Problems are: Problem set: 0 solved, 747 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/998 variables, and 1248 constraints, problems are : Problem set: 0 solved, 747 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 415/415 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 747/747 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 747 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 415/543 places, 748/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60370 ms. Remains : 415/543 places, 748/817 transitions.
[2026-05-24 20:39:03] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:39:03] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:39:03] [INFO ] Input system was already deterministic with 748 transitions.
[2026-05-24 20:39:03] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:39:03] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:39:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13501350862917491600.gal : 3 ms
[2026-05-24 20:39:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7784275288989708677.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13501350862917491600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7784275288989708677.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0842e+56,0.168672,7408,2,1158,5,4397,6,0,2223,2999,0


Converting to forward existential form...Done !
original formula: E(EF(((!((p49==1)&&(p579==1)))||(((p518==1)&&(p1163==1))&&(((p294==1)&&(p949==1))||(((p544==1)&&(p784==1))&&((p540==1)&&(p721==1))))))) U...220
=> equivalent forward existential formula: [((EY(FwdU(Init,E(TRUE U ((!((p49==1)&&(p579==1)))||(((p518==1)&&(p1163==1))&&(((p294==1)&&(p949==1))||(((p544==...275
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.816811,32056,1,0,6,161983,11,0,8668,4975,4
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 447 transition count 817
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 121 place count 422 transition count 767
Iterating global reduction 1 with 25 rules applied. Total rules applied 146 place count 422 transition count 767
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 155 place count 422 transition count 758
Applied a total of 155 rules in 11 ms. Remains 422 /543 variables (removed 121) and now considering 758/817 (removed 59) transitions.
[2026-05-24 20:39:04] [INFO ] Flow matrix only has 589 transitions (discarded 169 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15946955536837498806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9311769518569802902.kers'
[2026-05-24 20:39:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15946955536837498806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9311769518569802902.kers]
Normalized transition count is 588 out of 589 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 588 rows 412 cols 1254 entries
Finished phase 1 with 333 SingleSign rule and 0 generalized
[2026-05-24 20:39:04] [INFO ] Computed 89 invariants in 1 ms
Computed 89 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9311769518569802902.kers
Total runtime 2 ms.
[2026-05-24 20:39:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 20:39:04] [INFO ] Flow matrix only has 589 transitions (discarded 169 similar events)
[2026-05-24 20:39:04] [INFO ] Invariant cache hit.
[2026-05-24 20:39:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:39:04] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 757 sub problems to find dead transitions.
[2026-05-24 20:39:04] [INFO ] Flow matrix only has 589 transitions (discarded 169 similar events)
[2026-05-24 20:39:04] [INFO ] Invariant cache hit.
[2026-05-24 20:39:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 3 (OVERLAPS) 10/422 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1011 variables, and 89 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 0/422 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 3 (OVERLAPS) 10/422 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 5 (OVERLAPS) 588/1010 variables, 422/511 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 757/1268 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1011 variables, and 1268 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 422/422 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 422/543 places, 758/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60385 ms. Remains : 422/543 places, 758/817 transitions.
[2026-05-24 20:40:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:40:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:40:05] [INFO ] Input system was already deterministic with 758 transitions.
[2026-05-24 20:40:05] [INFO ] Flatten gal took : 11 ms
[2026-05-24 20:40:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:40:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9626557094036868028.gal : 4 ms
[2026-05-24 20:40:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3545444771771370021.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9626557094036868028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3545444771771370021.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97596e+56,0.175044,7460,2,1176,5,4476,6,0,2248,3047,0


Converting to forward existential form...Done !
original formula: EX(A((EF((p352==1)) * (((p554==1)&&(p984==1)) + ((EX(((p544==1)&&(p838==1))) * (p80==1)) * (((p528==1)&&(p641==1))||((p77==1)&&(p1037==1)...346
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((!((E(!(!(((p544==1)&&(p716==1)))) U (!(((((p476==1)&&(p1151==1))||((p44==1)&&(p878==1))) *...1046
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 748/10/10
Using saturation style SCC detection
(forward)formula 0,0,1.21636,38576,1,0,32,187668,49,20,10639,37726,31
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 441 transition count 817
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 130 place count 413 transition count 761
Iterating global reduction 1 with 28 rules applied. Total rules applied 158 place count 413 transition count 761
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 169 place count 413 transition count 750
Applied a total of 169 rules in 8 ms. Remains 413 /543 variables (removed 130) and now considering 750/817 (removed 67) transitions.
[2026-05-24 20:40:06] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9602750786040300549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15869364102970827832.kers'
[2026-05-24 20:40:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9602750786040300549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15869364102970827832.kers]
Normalized transition count is 583 out of 584 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 583 rows 409 cols 1244 entries
Finished phase 1 with 330 SingleSign rule and 0 generalized
[2026-05-24 20:40:06] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15869364102970827832.kers
Total runtime 2 ms.
[2026-05-24 20:40:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 20:40:06] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2026-05-24 20:40:06] [INFO ] Invariant cache hit.
[2026-05-24 20:40:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:40:06] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 749 sub problems to find dead transitions.
[2026-05-24 20:40:06] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2026-05-24 20:40:06] [INFO ] Invariant cache hit.
[2026-05-24 20:40:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 4/413 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/997 variables, and 83 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 4/413 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 583/996 variables, 413/496 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/996 variables, 749/1245 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 996/997 variables, and 1245 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 413/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 413/543 places, 750/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60390 ms. Remains : 413/543 places, 750/817 transitions.
[2026-05-24 20:41:06] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:41:06] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:41:06] [INFO ] Input system was already deterministic with 750 transitions.
[2026-05-24 20:41:06] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:41:06] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:41:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9119920152418957374.gal : 2 ms
[2026-05-24 20:41:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3938291994095485854.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9119920152418957374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3938291994095485854.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21973e+56,0.16696,7412,2,1155,5,4394,6,0,2225,3001,0


Converting to forward existential form...Done !
original formula: EF((EF((A(((p469==1)&&(p998==1)) U ((p539==1)&&(p855==1))) * (((p469==1)&&(p699==1))||((p504==1)&&(p1009==1))))) + AX(AX((p502==1)))))
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),TRUE) * (((p469==1)&&(p699==1))||((p504==1)&&(p1009==1)))) * !(EG(!(((p539==1)&&(p855=...330
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 746/0/4
(forward)formula 0,1,1.11644,35392,1,0,11,162654,26,4,10414,6881,13
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 441 transition count 817
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 129 place count 414 transition count 763
Iterating global reduction 1 with 27 rules applied. Total rules applied 156 place count 414 transition count 763
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 166 place count 414 transition count 753
Applied a total of 166 rules in 21 ms. Remains 414 /543 variables (removed 129) and now considering 753/817 (removed 64) transitions.
[2026-05-24 20:41:08] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17340917630177711695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11526229540456164823.kers'
[2026-05-24 20:41:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17340917630177711695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11526229540456164823.kers]
Normalized transition count is 585 out of 586 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 585 rows 410 cols 1248 entries
Finished phase 1 with 331 SingleSign rule and 0 generalized
[2026-05-24 20:41:08] [INFO ] Computed 83 invariants in 4 ms
Computed 83 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11526229540456164823.kers
Total runtime 6 ms.
[2026-05-24 20:41:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 20:41:08] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
[2026-05-24 20:41:08] [INFO ] Invariant cache hit.
[2026-05-24 20:41:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:41:08] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 752 sub problems to find dead transitions.
[2026-05-24 20:41:08] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
[2026-05-24 20:41:08] [INFO ] Invariant cache hit.
[2026-05-24 20:41:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 3 (OVERLAPS) 4/414 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1000 variables, and 83 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 752 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 3 (OVERLAPS) 4/414 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 5 (OVERLAPS) 585/999 variables, 414/497 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 752/1249 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1000 variables, and 1249 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 414/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 752 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 414/543 places, 753/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60396 ms. Remains : 414/543 places, 753/817 transitions.
[2026-05-24 20:42:08] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:42:08] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:42:08] [INFO ] Input system was already deterministic with 753 transitions.
[2026-05-24 20:42:08] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:42:08] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:42:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12445824792795100313.gal : 2 ms
[2026-05-24 20:42:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11798564847332514456.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12445824792795100313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11798564847332514456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.56125e+56,0.176949,7428,2,1158,5,4410,6,0,2231,3007,0


Converting to forward existential form...Done !
original formula: EF(((A(!(EX(((p394==1)||((p544==1)&&(p772==1))))) U AF(((p533==1)&&(p571==1)))) * ((p459==0)||(p996==0))) * ((p448==0)||(p993==0))))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((p448==0)||(p993==0))) * ((p459==0)||(p996==0))) * !(EG(!(!(EG(!(((p533==1)&&(p571==1)))...304
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.96755,34944,1,0,21,172134,27,13,9776,15759,21
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 455 transition count 817
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 110 place count 433 transition count 773
Iterating global reduction 1 with 22 rules applied. Total rules applied 132 place count 433 transition count 773
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 140 place count 433 transition count 765
Applied a total of 140 rules in 17 ms. Remains 433 /543 variables (removed 110) and now considering 765/817 (removed 52) transitions.
[2026-05-24 20:42:09] [INFO ] Flow matrix only has 593 transitions (discarded 172 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5436510469344684989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1825977083981358830.kers'
[2026-05-24 20:42:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5436510469344684989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1825977083981358830.kers]
Normalized transition count is 592 out of 593 initially.
Culling duplicate invariants (modulo rational): removing 18 columns.
Culled 18 columns in 0 ms.
// Phase 1: matrix 592 rows 415 cols 1262 entries
Finished phase 1 with 336 SingleSign rule and 0 generalized
[2026-05-24 20:42:09] [INFO ] Computed 97 invariants in 2 ms
Computed 97 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1825977083981358830.kers
Total runtime 3 ms.
[2026-05-24 20:42:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 20:42:09] [INFO ] Flow matrix only has 593 transitions (discarded 172 similar events)
[2026-05-24 20:42:09] [INFO ] Invariant cache hit.
[2026-05-24 20:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:42:09] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 764 sub problems to find dead transitions.
[2026-05-24 20:42:09] [INFO ] Flow matrix only has 593 transitions (discarded 172 similar events)
[2026-05-24 20:42:09] [INFO ] Invariant cache hit.
[2026-05-24 20:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 3 (OVERLAPS) 18/433 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/1026 variables, and 97 constraints, problems are : Problem set: 0 solved, 764 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 0/433 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 3 (OVERLAPS) 18/433 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 5 (OVERLAPS) 592/1025 variables, 433/530 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1025 variables, 764/1294 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1026 variables, and 1294 constraints, problems are : Problem set: 0 solved, 764 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 433/433 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 764 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 433/543 places, 765/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60387 ms. Remains : 433/543 places, 765/817 transitions.
[2026-05-24 20:43:09] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:43:09] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:43:09] [INFO ] Input system was already deterministic with 765 transitions.
[2026-05-24 20:43:09] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:43:09] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:43:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12005681084096884262.gal : 3 ms
[2026-05-24 20:43:09] [INFO ] Time to serialize properties into /tmp/CTLFireability8004977917949800896.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12005681084096884262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8004977917949800896.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.16153e+56,0.18199,7512,2,1201,5,4571,6,0,2272,3098,0


Converting to forward existential form...Done !
original formula: AF((((AG(EF(((p217==0)||(p626==0)))) * EX(AF(((p551==1)&&(p899==1))))) * (AX(AF(((p559==1)&&(p1087==1)))) * (EG((p33==1)) + ((AG((((p543=...581
=> equivalent forward existential formula: [FwdG(Init,!((((!(E(TRUE U !(E(TRUE U ((p217==0)||(p626==0)))))) * EX(!(EG(!(((p551==1)&&(p899==1))))))) * (!(EX...704
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.31353,40012,1,0,27,188644,63,8,10785,20195,34
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Graph (trivial) has 814 edges and 543 vertex of which 434 / 543 are part of one of the 79 SCC in 5 ms
Free SCC test removed 355 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 267 edges and 188 vertex of which 82 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.1 ms
Discarding 106 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 158 place count 3 transition count 3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 2 transition count 3
Applied a total of 160 rules in 18 ms. Remains 2 /543 variables (removed 541) and now considering 3/817 (removed 814) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10700010942495371499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2821633377944936170.kers'
[2026-05-24 20:43:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10700010942495371499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2821633377944936170.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-24 20:43:11] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2821633377944936170.kers
Total runtime 0 ms.
[2026-05-24 20:43:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 20:43:11] [INFO ] Invariant cache hit.
[2026-05-24 20:43:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-24 20:43:11] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-24 20:43:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 52ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/543 places, 3/817 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 125 ms. Remains : 2/543 places, 3/817 transitions.
[2026-05-24 20:43:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:43:11] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:43:11] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-24 20:43:11] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:43:11] [INFO ] Flatten gal took : 0 ms
[2026-05-24 20:43:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1487256753057905843.gal : 0 ms
[2026-05-24 20:43:11] [INFO ] Time to serialize properties into /tmp/CTLFireability540444347589013051.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1487256753057905843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability540444347589013051.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.0014,3728,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: EF(AG((p460==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p460==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.001975,4004,1,0,5,19,13,0,43,10,5
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Graph (trivial) has 802 edges and 543 vertex of which 426 / 543 are part of one of the 78 SCC in 1 ms
Free SCC test removed 348 places
Ensure Unique test removed 718 transitions
Reduce isomorphic transitions removed 718 transitions.
Graph (complete) has 283 edges and 195 vertex of which 93 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.0 ms
Discarding 102 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 93 transition count 97
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 91 transition count 96
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 81 place count 17 transition count 22
Iterating global reduction 2 with 74 rules applied. Total rules applied 155 place count 17 transition count 22
Applied a total of 155 rules in 7 ms. Remains 17 /543 variables (removed 526) and now considering 22/817 (removed 795) transitions.
[2026-05-24 20:43:11] [INFO ] Flow matrix only has 14 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17344717265027262401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12952589317806748885.kers'
[2026-05-24 20:43:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17344717265027262401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12952589317806748885.kers]
Normalized transition count is 13 out of 14 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 13 rows 12 cols 29 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 20:43:11] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12952589317806748885.kers
Total runtime 0 ms.
[2026-05-24 20:43:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 20:43:11] [INFO ] Flow matrix only has 14 transitions (discarded 8 similar events)
[2026-05-24 20:43:11] [INFO ] Invariant cache hit.
[2026-05-24 20:43:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:43:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2026-05-24 20:43:11] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2026-05-24 20:43:11] [INFO ] Flow matrix only has 14 transitions (discarded 8 similar events)
[2026-05-24 20:43:11] [INFO ] Invariant cache hit.
[2026-05-24 20:43:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 13/30 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 21 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 13/30 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/31 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 48 constraints, problems are : Problem set: 0 solved, 21 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 535ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/543 places, 22/817 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 587 ms. Remains : 17/543 places, 22/817 transitions.
[2026-05-24 20:43:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 20:43:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:43:11] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-24 20:43:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:43:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 20:43:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3931951431133480266.gal : 1 ms
[2026-05-24 20:43:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12466315385740482803.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3931951431133480266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12466315385740482803.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,55,0.003503,3840,2,37,5,128,6,0,69,80,0


Converting to forward existential form...Done !
original formula: AF(AG(E(((p552==1)&&(p903==1)) U E((((p457==1)&&(p846==1))||((p531==1)&&(p601==1))) U ((p441==1)&&(p1141==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(((p552==1)&&(p903==1)) U E((((p457==1)&&(p846==1))||((p531==1)&&(p601==1))) U ((p441...188
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 15/0/7
Hit Full ! (commute/partial/dont) 19/3/3
(forward)formula 0,0,0.009706,4128,1,0,12,542,32,2,413,328,17
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 443 transition count 817
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 124 place count 419 transition count 769
Iterating global reduction 1 with 24 rules applied. Total rules applied 148 place count 419 transition count 769
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 158 place count 419 transition count 759
Applied a total of 158 rules in 9 ms. Remains 419 /543 variables (removed 124) and now considering 759/817 (removed 58) transitions.
[2026-05-24 20:43:12] [INFO ] Flow matrix only has 589 transitions (discarded 170 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12754165128939876225.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3756499720712246498.kers'
[2026-05-24 20:43:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12754165128939876225.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3756499720712246498.kers]
Normalized transition count is 588 out of 589 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 588 rows 413 cols 1254 entries
Finished phase 1 with 334 SingleSign rule and 0 generalized
[2026-05-24 20:43:12] [INFO ] Computed 85 invariants in 2 ms
Computed 85 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3756499720712246498.kers
Total runtime 3 ms.
[2026-05-24 20:43:12] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-24 20:43:12] [INFO ] Flow matrix only has 589 transitions (discarded 170 similar events)
[2026-05-24 20:43:12] [INFO ] Invariant cache hit.
[2026-05-24 20:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:43:12] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 758 sub problems to find dead transitions.
[2026-05-24 20:43:12] [INFO ] Flow matrix only has 589 transitions (discarded 170 similar events)
[2026-05-24 20:43:12] [INFO ] Invariant cache hit.
[2026-05-24 20:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 3 (OVERLAPS) 6/419 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1008 variables, and 85 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 0/419 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 3 (OVERLAPS) 6/419 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 5 (OVERLAPS) 588/1007 variables, 419/504 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 758/1262 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1008 variables, and 1262 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 419/419 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 419/543 places, 759/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60386 ms. Remains : 419/543 places, 759/817 transitions.
[2026-05-24 20:44:12] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:44:12] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:44:12] [INFO ] Input system was already deterministic with 759 transitions.
[2026-05-24 20:44:12] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:44:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:44:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6951424698530254459.gal : 2 ms
[2026-05-24 20:44:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11424358982999731915.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6951424698530254459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11424358982999731915.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.52923e+56,0.179025,7496,2,1171,5,4466,6,0,2248,3034,0


Converting to forward existential form...Done !
original formula: AF(((EX((p389==0)) * !(A((((p555==1)&&(p963==1))||((p102==1)&&(p1044==1))) U !(((p536==1)&&(p733==1)))))) * EX((((p543==0)||(p1169==0)) *...212
=> equivalent forward existential formula: [FwdG(Init,!(((EX((p389==0)) * !(!((E(!(!(((p536==1)&&(p733==1)))) U (!((((p555==1)&&(p963==1))||((p102==1)&&(p1...411
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 755/0/4
Hit Full ! (commute/partial/dont) 755/4/4
(forward)formula 0,0,4.7346,160832,1,0,503,571205,42,333,10123,1.19485e+06,349
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 440 transition count 817
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 131 place count 412 transition count 761
Iterating global reduction 1 with 28 rules applied. Total rules applied 159 place count 412 transition count 761
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 170 place count 412 transition count 750
Applied a total of 170 rules in 21 ms. Remains 412 /543 variables (removed 131) and now considering 750/817 (removed 67) transitions.
[2026-05-24 20:44:17] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2610209299263182246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15352176265347189682.kers'
[2026-05-24 20:44:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2610209299263182246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15352176265347189682.kers]
Normalized transition count is 583 out of 584 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 583 rows 409 cols 1244 entries
Finished phase 1 with 330 SingleSign rule and 0 generalized
[2026-05-24 20:44:17] [INFO ] Computed 82 invariants in 2 ms
Computed 82 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15352176265347189682.kers
Total runtime 3 ms.
[2026-05-24 20:44:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 20:44:17] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2026-05-24 20:44:17] [INFO ] Invariant cache hit.
[2026-05-24 20:44:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:44:17] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 749 sub problems to find dead transitions.
[2026-05-24 20:44:17] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2026-05-24 20:44:17] [INFO ] Invariant cache hit.
[2026-05-24 20:44:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 3/412 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/996 variables, and 82 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 3/412 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 583/995 variables, 412/494 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/995 variables, 749/1243 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 995/996 variables, and 1243 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 412/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 412/543 places, 750/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60417 ms. Remains : 412/543 places, 750/817 transitions.
[2026-05-24 20:45:17] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:45:17] [INFO ] Flatten gal took : 10 ms
[2026-05-24 20:45:17] [INFO ] Input system was already deterministic with 750 transitions.
[2026-05-24 20:45:17] [INFO ] Flatten gal took : 8 ms
[2026-05-24 20:45:17] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:45:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5427402566242546047.gal : 2 ms
[2026-05-24 20:45:17] [INFO ] Time to serialize properties into /tmp/CTLFireability15960500410767432752.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5427402566242546047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15960500410767432752.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21973e+56,0.16815,7444,2,1153,5,4387,6,0,2224,2995,0


Converting to forward existential form...Done !
original formula: AF((EX(((AF(((p518==0)||(p862==0))) * (p558==1)) * (p1039==1))) + ((p560==1)&&(p1115==1))))
=> equivalent forward existential formula: [FwdG(Init,!((EX(((!(EG(!(((p518==0)||(p862==0))))) * (p558==1)) * (p1039==1))) + ((p560==1)&&(p1115==1)))))] = ...160
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,3.81736,125328,1,0,504,489851,26,336,9075,863160,343
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 543/543 places, 817/817 transitions.
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 438 transition count 817
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 134 place count 409 transition count 759
Iterating global reduction 1 with 29 rules applied. Total rules applied 163 place count 409 transition count 759
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 174 place count 409 transition count 748
Applied a total of 174 rules in 18 ms. Remains 409 /543 variables (removed 134) and now considering 748/817 (removed 69) transitions.
[2026-05-24 20:45:21] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7417558895926813299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10138611668595156706.kers'
[2026-05-24 20:45:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7417558895926813299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10138611668595156706.kers]
Normalized transition count is 582 out of 583 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 582 rows 408 cols 1242 entries
Finished phase 1 with 329 SingleSign rule and 0 generalized
[2026-05-24 20:45:21] [INFO ] Computed 80 invariants in 7 ms
Computed 80 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10138611668595156706.kers
Total runtime 8 ms.
[2026-05-24 20:45:21] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 20:45:21] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
[2026-05-24 20:45:21] [INFO ] Invariant cache hit.
[2026-05-24 20:45:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:45:21] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 747 sub problems to find dead transitions.
[2026-05-24 20:45:21] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
[2026-05-24 20:45:21] [INFO ] Invariant cache hit.
[2026-05-24 20:45:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 1 (OVERLAPS) 1/408 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 3 (OVERLAPS) 1/409 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 747 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/992 variables, and 80 constraints, problems are : Problem set: 0 solved, 747 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 0/409 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 747/747 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 747 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 1 (OVERLAPS) 1/408 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 3 (OVERLAPS) 1/409 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 5 (OVERLAPS) 582/991 variables, 409/489 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/991 variables, 747/1236 constraints. Problems are: Problem set: 0 solved, 747 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 991/992 variables, and 1236 constraints, problems are : Problem set: 0 solved, 747 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 409/409 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 747/747 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 747 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 409/543 places, 748/817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60430 ms. Remains : 409/543 places, 748/817 transitions.
[2026-05-24 20:46:21] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:46:21] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:46:21] [INFO ] Input system was already deterministic with 748 transitions.
[2026-05-24 20:46:21] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:46:22] [INFO ] Flatten gal took : 6 ms
[2026-05-24 20:46:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5061451078323246951.gal : 2 ms
[2026-05-24 20:46:22] [INFO ] Time to serialize properties into /tmp/CTLFireability470602873419510381.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5061451078323246951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability470602873419510381.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0842e+56,0.161554,7400,2,1146,5,4361,6,0,2217,2981,0


Converting to forward existential form...Done !
original formula: EF(AX(((p562==1)&&(p1029==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p562==1)&&(p1029==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.746547,31384,1,0,6,159064,11,0,8614,4693,4
FORMULA DLCshifumi-PT-4a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-05-24 20:46:22] [INFO ] Flatten gal took : 22 ms
[2026-05-24 20:46:22] [INFO ] Flatten gal took : 9 ms
Total runtime 761748 ms.

BK_STOP 1779655582855

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="DLCshifumi-PT-4a"
export BK_EXAMINATION="CTLFireability"
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 DLCshifumi-PT-4a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695700714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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