Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824800093.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PGCD-PT-D04N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 9.3K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748842358107

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D04N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:32:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:32:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:32:39] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2025-06-02 05:32:39] [INFO ] Transformed 15 places.
[2025-06-02 05:32:39] [INFO ] Transformed 15 transitions.
[2025-06-02 05:32:39] [INFO ] Parsed PT model containing 15 places and 15 transitions and 70 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 50, 1, 1, 1, 50, 1, 1, 50, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 50, 1, 1, 1, 50, 1, 1, 50, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 15 rows 15 cols
[2025-06-02 05:32:39] [INFO ] Computed 6 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 50, 1, 1, 1, 50, 1, 1, 50, 1] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
RANDOM walk for 10040 steps (2 resets) in 11 ms. (836 steps per ms)
BEST_FIRST walk for 110005 steps (22 resets) in 93 ms. (1170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[85, 111, 153, 101, 85, 111, 168, 93, 101, 165, 83] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
[2025-06-02 05:32:39] [INFO ] Invariant cache hit.
[2025-06-02 05:32:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:32:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-06-02 05:32:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 05:32:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:32:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:32:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:32:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:32:39] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 56 ms.
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:32:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:32:40] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:32:40] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 41 ms.
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:32:40] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 55 ms.
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 05:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:32:40] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 53 ms.
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:32:40] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 26 ms.
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 05:32:40] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 35 ms.
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:32:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:32:40] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 36 ms.
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:32:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:32:40] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 55 ms.
[2025-06-02 05:32:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:32:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2025-06-02 05:32:41] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:32:41] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 35 ms.
[2025-06-02 05:32:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 05:32:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:32:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:41] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:32:41] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[85, 111, 153, 101, 85, 111, 168, 93, 101, 165, 83] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[251, 251, 249, 251, 251, 251, 247, 248, 251, 249, 251] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
Support contains 11 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 11 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:32:41] [INFO ] Invariant cache hit.
[2025-06-02 05:32:41] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 26 constraints, problems are : Problem set: 0 solved, 5 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 31 constraints, problems are : Problem set: 0 solved, 5 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 15/15 places, 15/15 transitions.
[2025-06-02 05:32:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[251, 251, 249, 251, 251, 251, 247, 248, 251, 249, 251] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
RANDOM walk for 1000000 steps (2 resets) in 192 ms. (5181 steps per ms)
BEST_FIRST walk for 11000008 steps (22 resets) in 3276 ms. (3356 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[251, 251, 249, 251, 251, 251, 247, 248, 251, 249, 251] Max Struct:[255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255]
[2025-06-02 05:32:45] [INFO ] Invariant cache hit.
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:32:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using state equation in 88 ms returned unsat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:32:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:32:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:32:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:32:45] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:32:45] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:32:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:32:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using state equation in 9012 ms returned unknown
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:32:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using state equation in 37 ms returned unsat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:32:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:32:55] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:32:55] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:32:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:32:55] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 47 ms.
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:32:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:32:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 9 ms to minimize.
[2025-06-02 05:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-06-02 05:32:55] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:32:55] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:32:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:55] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[251, 251, 249, 251, 251, 251, 247, 248, 251, 249, 251] Max Struct:[251, 251, 255, 251, 255, 251, 255, 255, 251, 255, 251]
FORMULA PGCD-PT-D04N050-UpperBounds-15 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-13 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-07 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-11 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-03 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-01 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-00 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 251, 247, 251, 249] Max Struct:[255, 255, 255, 255, 255]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 15/15 transitions.
[2025-06-02 05:32:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249, 251, 247, 251, 249] Max Struct:[255, 255, 255, 255, 255]
RANDOM walk for 1000023 steps (2 resets) in 163 ms. (6097 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 1394 ms. (3584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249, 251, 247, 251, 249] Max Struct:[255, 255, 255, 255, 255]
[2025-06-02 05:32:57] [INFO ] Invariant cache hit.
[2025-06-02 05:32:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:32:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:32:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-06-02 05:32:57] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:32:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:32:57] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:32:57] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:32:57] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 05:32:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:32:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 05:32:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:32:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using state equation in 9009 ms returned unknown
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:33:06] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:06] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:33:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:33:06] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:06] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
[2025-06-02 05:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-02 05:33:06] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:06] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249, 251, 247, 251, 249] Max Struct:[255, 255, 255, 251, 255]
FORMULA PGCD-PT-D04N050-UpperBounds-12 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 251, 247, 249] Max Struct:[255, 255, 255, 255]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 15/15 transitions.
[2025-06-02 05:33:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249, 251, 247, 249] Max Struct:[255, 255, 255, 255]
RANDOM walk for 1000048 steps (2 resets) in 165 ms. (6024 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1105 ms. (3616 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249, 251, 247, 249] Max Struct:[255, 255, 255, 255]
[2025-06-02 05:33:08] [INFO ] Invariant cache hit.
[2025-06-02 05:33:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:33:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:33:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:33:08] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:08] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:08] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 05:33:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Nat]Absence check using state equation in 9005 ms returned unknown
[2025-06-02 05:33:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:33:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:17] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:17] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 05:33:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:33:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:33:17] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 4 ms to minimize.
[2025-06-02 05:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2025-06-02 05:33:17] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:17] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249, 251, 247, 249] Max Struct:[255, 255, 255, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 251, 247, 249] Max Struct:[255, 255, 255, 255]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:33:17] [INFO ] Invariant cache hit.
[2025-06-02 05:33:17] [INFO ] Implicit Places using invariants in 44 ms returned [10, 11, 12, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 11/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51 ms. Remains : 11/15 places, 15/15 transitions.
// Phase 1: matrix 15 rows 11 cols
[2025-06-02 05:33:17] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[249, 251, 247, 249] Max Struct:[255, 255, 255, 255]
RANDOM walk for 1000037 steps (2 resets) in 142 ms. (6993 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 926 ms. (4314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249, 251, 247, 249] Max Struct:[255, 255, 255, 255]
[2025-06-02 05:33:18] [INFO ] Invariant cache hit.
[2025-06-02 05:33:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:33:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:18] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:33:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:18] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:18] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 16 ms.
[2025-06-02 05:33:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:33:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:18] [INFO ] [Nat]Absence check using state equation in 77 ms returned unsat
[2025-06-02 05:33:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:33:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:33:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:18] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 05:33:18] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 05:33:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:33:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:33:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:33:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:19] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249, 251, 247, 249] Max Struct:[255, 251, 255, 255]
FORMULA PGCD-PT-D04N050-UpperBounds-06 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-10 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D04N050-UpperBounds-05 251 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 247, 249] Max Struct:[255, 255, 255]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 11/11 places, 15/15 transitions.
[2025-06-02 05:33:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249, 247, 249] Max Struct:[255, 255, 255]
RANDOM walk for 1000033 steps (2 resets) in 139 ms. (7143 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 664 ms. (4511 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249, 247, 249] Max Struct:[255, 255, 255]
[2025-06-02 05:33:19] [INFO ] Invariant cache hit.
[2025-06-02 05:33:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:19] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:33:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:20] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 18 ms.
[2025-06-02 05:33:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:20] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:20] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 05:33:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:33:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:33:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:33:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2025-06-02 05:33:20] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:20] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249, 247, 249] Max Struct:[255, 255, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 249, 249] Max Struct:[255, 255, 255]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 11/11 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:33:20] [INFO ] Invariant cache hit.
[2025-06-02 05:33:20] [INFO ] Implicit Places using invariants in 25 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/11 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 28 ms. Remains : 10/11 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2025-06-02 05:33:20] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[249, 249, 249] Max Struct:[255, 255, 255]
RANDOM walk for 1000013 steps (2 resets) in 136 ms. (7299 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 630 ms. (4754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249, 249, 249] Max Struct:[255, 255, 255]
[2025-06-02 05:33:21] [INFO ] Invariant cache hit.
[2025-06-02 05:33:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:33:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:33:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:33:21] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 05:33:21] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 05:33:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:33:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:33:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:33:21] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2025-06-02 05:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2025-06-02 05:33:21] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:21] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
[2025-06-02 05:33:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:33:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:33:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:33:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:33:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:33:21] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:33:21] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249, 249, 249] Max Struct:[255, 255, 255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249, 249, 249] Max Struct:[255, 255, 255]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:33:21] [INFO ] Invariant cache hit.
[2025-06-02 05:33:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 05:33:21] [INFO ] Invariant cache hit.
[2025-06-02 05:33:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:33:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2025-06-02 05:33:21] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:33:21] [INFO ] Invariant cache hit.
[2025-06-02 05:33:21] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40070 steps (8 resets) in 158 ms. (252 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
[2025-06-02 05:33:21] [INFO ] Flatten gal took : 33 ms
[2025-06-02 05:33:21] [INFO ] Flatten gal took : 6 ms
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
[2025-06-02 05:33:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4888757568007557781.gal : 7 ms
[2025-06-02 05:33:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12366007925227870191.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4888757568007557781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12366007925227870191.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12366007925227870191.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 449720 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 6
Probabilistic random walk after 449720 steps, saw 268553 distinct states, run finished after 3004 ms. (steps per millisecond=149 ) properties seen :0
[2025-06-02 05:33:24] [INFO ] Invariant cache hit.
[2025-06-02 05:33:24] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-02 05:33:24] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 3 solved, 3 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 3/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 3 solved, 3 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 133ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 1751 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:33:26] [INFO ] Invariant cache hit.
[2025-06-02 05:33:26] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40113 steps (8 resets) in 18 ms. (2111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 619864 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 3
Probabilistic random walk after 619864 steps, saw 366459 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
[2025-06-02 05:33:30] [INFO ] Invariant cache hit.
[2025-06-02 05:33:30] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:33:30] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 3 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 3 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1586 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:33:31] [INFO ] Invariant cache hit.
[2025-06-02 05:33:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 05:33:31] [INFO ] Invariant cache hit.
[2025-06-02 05:33:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:33:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2025-06-02 05:33:31] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:33:31] [INFO ] Invariant cache hit.
[2025-06-02 05:33:31] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:33:31] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:33:31] [INFO ] Applying decomposition
[2025-06-02 05:33:31] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16668491989052889143.txt' '-o' '/tmp/graph16668491989052889143.bin' '-w' '/tmp/graph16668491989052889143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16668491989052889143.bin' '-l' '-1' '-v' '-w' '/tmp/graph16668491989052889143.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:33:32] [INFO ] Decomposing Gal with order
[2025-06-02 05:33:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:33:32] [INFO ] Flatten gal took : 32 ms
[2025-06-02 05:33:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:33:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18135216129312062476.gal : 2 ms
[2025-06-02 05:33:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality304940663876449373.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18135216129312062476.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality304940663876449373.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality304940663876449373.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :969 after 374408
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :374408 after 4.5324e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.66122e+13 after 1.66124e+13
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.66124e+13 after 1.66124e+13
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.66124e+13 after 1.66124e+13
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.66124e+13 after 1.66124e+13
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.66124e+13 after 1.72281e+13
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.72281e+13 after 1.72285e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[249, 249, 249] Max Struct:[255, 255, 255]
Starting property specific reduction for PGCD-PT-D04N050-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
[2025-06-02 05:34:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10009 steps (2 resets) in 3 ms. (2502 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[165] Max Struct:[255]
[2025-06-02 05:34:22] [INFO ] Invariant cache hit.
[2025-06-02 05:34:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:34:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:34:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:34:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2025-06-02 05:34:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:34:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:34:22] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:34:22] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:34:22] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[165] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:34:22] [INFO ] Invariant cache hit.
[2025-06-02 05:34:22] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:34:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249] Max Struct:[255]
RANDOM walk for 1000005 steps (2 resets) in 136 ms. (7299 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 221 ms. (4504 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[255]
[2025-06-02 05:34:22] [INFO ] Invariant cache hit.
[2025-06-02 05:34:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:34:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:34:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:34:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:34:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:34:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:34:22] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:34:22] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 05:34:22] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 7 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:34:22] [INFO ] Invariant cache hit.
[2025-06-02 05:34:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 05:34:23] [INFO ] Invariant cache hit.
[2025-06-02 05:34:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:34:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2025-06-02 05:34:23] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:34:23] [INFO ] Invariant cache hit.
[2025-06-02 05:34:23] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:34:23] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:34:23] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:34:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5454417778255291237.gal : 1 ms
[2025-06-02 05:34:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11213992546248136158.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5454417778255291237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11213992546248136158.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40085 steps (8 resets) in 15 ms. (2505 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11213992546248136158.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 9957
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 703359 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 2
Probabilistic random walk after 703359 steps, saw 411953 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
[2025-06-02 05:34:26] [INFO ] Invariant cache hit.
[2025-06-02 05:34:26] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:34:26] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 104ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:34:26] [INFO ] Invariant cache hit.
[2025-06-02 05:34:26] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40111 steps (8 resets) in 12 ms. (3085 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2845488 steps, run timeout after 3001 ms. (steps per millisecond=948 ) properties seen :0 out of 1
Probabilistic random walk after 2845488 steps, saw 1602709 distinct states, run finished after 3001 ms. (steps per millisecond=948 ) properties seen :0
[2025-06-02 05:34:29] [INFO ] Invariant cache hit.
[2025-06-02 05:34:29] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:34:29] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:34:29] [INFO ] Invariant cache hit.
[2025-06-02 05:34:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 05:34:29] [INFO ] Invariant cache hit.
[2025-06-02 05:34:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:34:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2025-06-02 05:34:29] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:34:29] [INFO ] Invariant cache hit.
[2025-06-02 05:34:29] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:34:29] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:34:29] [INFO ] Applying decomposition
[2025-06-02 05:34:29] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3278370974003623472.txt' '-o' '/tmp/graph3278370974003623472.bin' '-w' '/tmp/graph3278370974003623472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3278370974003623472.bin' '-l' '-1' '-v' '-w' '/tmp/graph3278370974003623472.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:34:29] [INFO ] Decomposing Gal with order
[2025-06-02 05:34:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:34:29] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:34:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:34:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4403557295805709483.gal : 1 ms
[2025-06-02 05:34:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10696967403594679695.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4403557295805709483.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10696967403594679695.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality10696967403594679695.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :421209 after 1.80997e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.66122e+13 after 1.72391e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.72391e+13 after 1.72395e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.72395e+13 after 1.72395e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.72395e+13 after 1.72395e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.72395e+13 after 1.72395e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.01101e+13 after 3.02059e+13
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.51751e+13 after 4.59563e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[249] Max Struct:[255]
Ending property specific reduction for PGCD-PT-D04N050-UpperBounds-02 in 57818 ms.
Starting property specific reduction for PGCD-PT-D04N050-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
[2025-06-02 05:35:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10003 steps (2 resets) in 4 ms. (2000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[165] Max Struct:[255]
[2025-06-02 05:35:19] [INFO ] Invariant cache hit.
[2025-06-02 05:35:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:35:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:35:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:35:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:35:20] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:35:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:35:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:35:20] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:35:20] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[165] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:35:20] [INFO ] Invariant cache hit.
[2025-06-02 05:35:20] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:35:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249] Max Struct:[255]
RANDOM walk for 1000001 steps (2 resets) in 148 ms. (6711 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 236 ms. (4219 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[255]
[2025-06-02 05:35:20] [INFO ] Invariant cache hit.
[2025-06-02 05:35:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:35:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:35:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:35:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:35:20] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:35:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:35:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:35:20] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2025-06-02 05:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2025-06-02 05:35:20] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:35:20] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:35:20] [INFO ] Invariant cache hit.
[2025-06-02 05:35:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 05:35:20] [INFO ] Invariant cache hit.
[2025-06-02 05:35:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:35:20] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2025-06-02 05:35:20] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:35:20] [INFO ] Invariant cache hit.
[2025-06-02 05:35:20] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40101 steps (8 resets) in 29 ms. (1336 steps per ms) remains 2/2 properties
[2025-06-02 05:35:20] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:35:20] [INFO ] Flatten gal took : 2 ms
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
[2025-06-02 05:35:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12674502357673747343.gal : 2 ms
[2025-06-02 05:35:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6971008754651448719.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12674502357673747343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6971008754651448719.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6971008754651448719.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 1195651 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :0 out of 2
Probabilistic random walk after 1195651 steps, saw 691214 distinct states, run finished after 3001 ms. (steps per millisecond=398 ) properties seen :0
[2025-06-02 05:35:23] [INFO ] Invariant cache hit.
[2025-06-02 05:35:23] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:35:24] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 153ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:35:24] [INFO ] Invariant cache hit.
[2025-06-02 05:35:24] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40120 steps (8 resets) in 13 ms. (2865 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2704733 steps, run timeout after 3001 ms. (steps per millisecond=901 ) properties seen :0 out of 1
Probabilistic random walk after 2704733 steps, saw 1524044 distinct states, run finished after 3001 ms. (steps per millisecond=901 ) properties seen :0
[2025-06-02 05:35:27] [INFO ] Invariant cache hit.
[2025-06-02 05:35:27] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:35:27] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 13 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:35:27] [INFO ] Invariant cache hit.
[2025-06-02 05:35:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 05:35:27] [INFO ] Invariant cache hit.
[2025-06-02 05:35:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:35:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2025-06-02 05:35:27] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:35:27] [INFO ] Invariant cache hit.
[2025-06-02 05:35:27] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:35:27] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:35:27] [INFO ] Applying decomposition
[2025-06-02 05:35:27] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13097023376990206815.txt' '-o' '/tmp/graph13097023376990206815.bin' '-w' '/tmp/graph13097023376990206815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13097023376990206815.bin' '-l' '-1' '-v' '-w' '/tmp/graph13097023376990206815.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:35:27] [INFO ] Decomposing Gal with order
[2025-06-02 05:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:35:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:35:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:35:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16023739205526101443.gal : 1 ms
[2025-06-02 05:35:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4966362964626073507.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16023739205526101443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4966362964626073507.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4966362964626073507.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 374408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :374408 after 6.41708e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.71328e+12 after 9.71367e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9.71367e+12 after 9.71367e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.71367e+12 after 9.71367e+12
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9.71367e+12 after 9.75607e+12
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.75607e+12 after 1.00317e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.82471e+13 after 2.8677e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[249] Max Struct:[255]
Ending property specific reduction for PGCD-PT-D04N050-UpperBounds-08 in 58024 ms.
Starting property specific reduction for PGCD-PT-D04N050-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[255]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[255]
[2025-06-02 05:36:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[255]
RANDOM walk for 10029 steps (2 resets) in 3 ms. (2507 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[171] Max Struct:[255]
[2025-06-02 05:36:17] [INFO ] Invariant cache hit.
[2025-06-02 05:36:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:36:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:36:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:18] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:36:18] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[171] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[245] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:36:18] [INFO ] Invariant cache hit.
[2025-06-02 05:36:18] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:36:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[245] Max Struct:[255]
RANDOM walk for 1000025 steps (2 resets) in 163 ms. (6097 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 228 ms. (4366 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[245] Max Struct:[255]
[2025-06-02 05:36:18] [INFO ] Invariant cache hit.
[2025-06-02 05:36:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:36:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:36:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:36:18] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:18] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[245] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[247] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:36:18] [INFO ] Invariant cache hit.
[2025-06-02 05:36:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 05:36:18] [INFO ] Invariant cache hit.
[2025-06-02 05:36:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:36:18] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2025-06-02 05:36:18] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:36:18] [INFO ] Invariant cache hit.
[2025-06-02 05:36:18] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:36:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[247] Max Struct:[255]
RANDOM walk for 1000081 steps (2 resets) in 131 ms. (7576 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 209 ms. (4761 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[247] Max Struct:[255]
[2025-06-02 05:36:19] [INFO ] Invariant cache hit.
[2025-06-02 05:36:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:36:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:19] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:36:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:36:19] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:36:19] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:36:19] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[247] Max Struct:[255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[247] Max Struct:[255]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:36:19] [INFO ] Invariant cache hit.
[2025-06-02 05:36:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 05:36:19] [INFO ] Invariant cache hit.
[2025-06-02 05:36:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:36:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2025-06-02 05:36:19] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:36:19] [INFO ] Invariant cache hit.
[2025-06-02 05:36:19] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:36:19] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:36:19] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:36:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7890777253952339919.gal : 1 ms
RANDOM walk for 40121 steps (8 resets) in 25 ms. (1543 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 15 ms. (2500 steps per ms) remains 2/2 properties
[2025-06-02 05:36:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18009549979264171132.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7890777253952339919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18009549979264171132.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18009549979264171132.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 9957
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
Interrupted probabilistic random walk after 1034101 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 2
Probabilistic random walk after 1034101 steps, saw 602236 distinct states, run finished after 3002 ms. (steps per millisecond=344 ) properties seen :0
[2025-06-02 05:36:22] [INFO ] Invariant cache hit.
[2025-06-02 05:36:22] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:36:22] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 91ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:36:22] [INFO ] Invariant cache hit.
[2025-06-02 05:36:22] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40063 steps (8 resets) in 11 ms. (3338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3382728 steps, run timeout after 3001 ms. (steps per millisecond=1127 ) properties seen :0 out of 1
Probabilistic random walk after 3382728 steps, saw 1898733 distinct states, run finished after 3001 ms. (steps per millisecond=1127 ) properties seen :0
[2025-06-02 05:36:25] [INFO ] Invariant cache hit.
[2025-06-02 05:36:25] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:36:25] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:36:25] [INFO ] Invariant cache hit.
[2025-06-02 05:36:25] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 05:36:26] [INFO ] Invariant cache hit.
[2025-06-02 05:36:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:36:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2025-06-02 05:36:26] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:36:26] [INFO ] Invariant cache hit.
[2025-06-02 05:36:26] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:36:26] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:36:26] [INFO ] Applying decomposition
[2025-06-02 05:36:26] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6411564229867498377.txt' '-o' '/tmp/graph6411564229867498377.bin' '-w' '/tmp/graph6411564229867498377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6411564229867498377.bin' '-l' '-1' '-v' '-w' '/tmp/graph6411564229867498377.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:36:26] [INFO ] Decomposing Gal with order
[2025-06-02 05:36:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:36:26] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:36:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:36:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3652184527719065791.gal : 1 ms
[2025-06-02 05:36:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18445301630098944485.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3652184527719065791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18445301630098944485.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality18445301630098944485.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :421209 after 1.80997e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.66122e+13 after 1.72362e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.72362e+13 after 1.72391e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.72391e+13 after 1.72391e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.72391e+13 after 1.72391e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.72391e+13 after 1.72391e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.72391e+13 after 1.72396e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[247] Max Struct:[255]
Ending property specific reduction for PGCD-PT-D04N050-UpperBounds-14 in 58363 ms.
[2025-06-02 05:37:16] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:37:16] [INFO ] Applying decomposition
[2025-06-02 05:37:16] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph798201872500209257.txt' '-o' '/tmp/graph798201872500209257.bin' '-w' '/tmp/graph798201872500209257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph798201872500209257.bin' '-l' '-1' '-v' '-w' '/tmp/graph798201872500209257.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:37:16] [INFO ] Decomposing Gal with order
[2025-06-02 05:37:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:37:16] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:37:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:37:16] [INFO ] Time to serialize gal into /tmp/UpperBounds699011897675098699.gal : 1 ms
[2025-06-02 05:37:16] [INFO ] Time to serialize properties into /tmp/UpperBounds17995730266543291559.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds699011897675098699.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17995730266543291559.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds17995730266543291559.prop.
Detected timeout of ITS tools.
[2025-06-02 05:58:48] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:58:48] [INFO ] Time to serialize gal into /tmp/UpperBounds3864200742297241030.gal : 1 ms
[2025-06-02 05:58:48] [INFO ] Time to serialize properties into /tmp/UpperBounds4361593044280099152.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3864200742297241030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4361593044280099152.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds4361593044280099152.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9.33482e+14,251.219,2213972,2,4596,5,7.96874e+06,6,0,73,8.07218e+06,0
Total reachable state count : 933481841500756

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property PGCD-PT-D04N050-UpperBounds-02 :0 <= p1_1 <= 249
FORMULA PGCD-PT-D04N050-UpperBounds-04 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
FORMULA PGCD-PT-D04N050-UpperBounds-09 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
FORMULA PGCD-PT-D04N050-UpperBounds-02 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N050-UpperBounds-02,0,251.554,2213972,1,0,7,7.96874e+06,9,1,354,8.07218e+06,4
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property PGCD-PT-D04N050-UpperBounds-08 :0 <= p1_2 <= 249
FORMULA PGCD-PT-D04N050-UpperBounds-08 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N050-UpperBounds-08,0,251.833,2213972,1,0,8,7.96874e+06,10,1,619,8.07218e+06,5
Min sum of variable value : 0
Maximum sum along a path : 249
Bounds property PGCD-PT-D04N050-UpperBounds-14 :0 <= p1_5 <= 249
FORMULA PGCD-PT-D04N050-UpperBounds-14 249 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N050-UpperBounds-14,0,251.844,2213972,1,0,9,7.96874e+06,11,1,872,8.07218e+06,6
Total runtime 1821347 ms.

BK_STOP 1748844180750

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-PT-D04N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PGCD-PT-D04N050, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-174876824800093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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