Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505200133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CANInsertWithFailure-PT-050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505200133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1716250346225

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 00:12:27] [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]
[2024-05-21 00:12:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 00:12:28] [INFO ] Load time of PNML (sax parser for PT used): 578 ms
[2024-05-21 00:12:28] [INFO ] Transformed 5604 places.
[2024-05-21 00:12:28] [INFO ] Transformed 15300 transitions.
[2024-05-21 00:12:28] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 758 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 15300 rows 5604 cols
[2024-05-21 00:12:29] [INFO ] Computed 53 invariants in 1240 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1]
RANDOM walk for 10000 steps (8 resets) in 184 ms. (54 steps per ms)
FORMULA CANInsertWithFailure-PT-050-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 216 ms. (691 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2024-05-21 00:12:30] [INFO ] Invariant cache hit.
[2024-05-21 00:12:30] [INFO ] [Real]Absence check using 51 positive place invariants in 128 ms returned sat
[2024-05-21 00:12:30] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-21 00:12:35] [INFO ] [Real]Absence check using state equation in 4135 ms returned unknown
[2024-05-21 00:12:35] [INFO ] [Real]Absence check using 51 positive place invariants in 120 ms returned sat
[2024-05-21 00:12:35] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-21 00:12:40] [INFO ] [Real]Absence check using state equation in 4294 ms returned sat
[2024-05-21 00:12:40] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-21 00:12:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:12:40] [INFO ] [Real]Absence check using 51 positive place invariants in 119 ms returned sat
[2024-05-21 00:12:41] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-21 00:12:45] [INFO ] [Real]Absence check using state equation in 4181 ms returned sat
[2024-05-21 00:12:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:12:45] [INFO ] [Real]Absence check using 51 positive place invariants in 100 ms returned sat
[2024-05-21 00:12:45] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-21 00:12:50] [INFO ] [Real]Absence check using state equation in 4207 ms returned sat
[2024-05-21 00:12:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:12:50] [INFO ] [Real]Absence check using 51 positive place invariants in 112 ms returned sat
[2024-05-21 00:12:50] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-21 00:12:55] [INFO ] [Real]Absence check using state equation in 4209 ms returned sat
[2024-05-21 00:12:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:12:55] [INFO ] [Real]Absence check using 51 positive place invariants in 111 ms returned sat
[2024-05-21 00:12:55] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 43 ms returned sat
[2024-05-21 00:13:00] [INFO ] [Real]Absence check using state equation in 4332 ms returned sat
[2024-05-21 00:13:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:13:00] [INFO ] [Real]Absence check using 51 positive place invariants in 99 ms returned sat
[2024-05-21 00:13:00] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-21 00:13:05] [INFO ] [Real]Absence check using state equation in 4257 ms returned sat
[2024-05-21 00:13:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:13:05] [INFO ] [Real]Absence check using 51 positive place invariants in 103 ms returned sat
[2024-05-21 00:13:06] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-21 00:13:10] [INFO ] [Real]Absence check using state equation in 4345 ms returned unknown
[2024-05-21 00:13:11] [INFO ] [Real]Absence check using 51 positive place invariants in 99 ms returned sat
[2024-05-21 00:13:11] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 53 ms returned sat
[2024-05-21 00:13:15] [INFO ] [Real]Absence check using state equation in 4342 ms returned unknown
[2024-05-21 00:13:16] [INFO ] [Real]Absence check using 51 positive place invariants in 110 ms returned sat
[2024-05-21 00:13:16] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 53 ms returned sat
[2024-05-21 00:13:20] [INFO ] [Real]Absence check using state equation in 4314 ms returned sat
[2024-05-21 00:13:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:13:21] [INFO ] [Real]Absence check using 51 positive place invariants in 97 ms returned sat
[2024-05-21 00:13:21] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-21 00:13:25] [INFO ] [Real]Absence check using state equation in 4308 ms returned sat
[2024-05-21 00:13:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:13:26] [INFO ] [Real]Absence check using 51 positive place invariants in 99 ms returned sat
[2024-05-21 00:13:26] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 54 ms returned sat
[2024-05-21 00:13:30] [INFO ] [Real]Absence check using state equation in 4183 ms returned sat
[2024-05-21 00:13:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:13:31] [INFO ] [Nat]Absence check using 51 positive place invariants in 98 ms returned sat
[2024-05-21 00:13:31] [INFO ] [Nat]Absence check using 51 positive and 2 generalized place invariants in 55 ms returned sat
[2024-05-21 00:13:35] [INFO ] [Nat]Absence check using state equation in 4049 ms returned sat
[2024-05-21 00:13:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 00:13:35] [INFO ] [Nat]Added 4950 Read/Feed constraints in 313 ms returned unknown
[2024-05-21 00:13:36] [INFO ] [Real]Absence check using 51 positive place invariants in 97 ms returned sat
[2024-05-21 00:13:36] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-21 00:13:40] [INFO ] [Real]Absence check using state equation in 4093 ms returned sat
[2024-05-21 00:13:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:13:41] [INFO ] [Real]Absence check using 51 positive place invariants in 97 ms returned sat
[2024-05-21 00:13:41] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-21 00:13:45] [INFO ] [Real]Absence check using state equation in 4227 ms returned sat
[2024-05-21 00:13:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 00:13:46] [INFO ] [Real]Absence check using 51 positive place invariants in 97 ms returned sat
[2024-05-21 00:13:46] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 43 ms returned sat
[2024-05-21 00:13:50] [INFO ] [Real]Absence check using state equation in 4145 ms returned sat
[2024-05-21 00:13:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 15 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 350 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 699 place count 5254 transition count 14951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 699 place count 5254 transition count 14950
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 701 place count 5253 transition count 14950
Performed 2438 Post agglomeration using F-continuation condition.Transition count delta: 2438
Deduced a syphon composed of 2438 places in 8 ms
Reduce places removed 2438 places and 0 transitions.
Iterating global reduction 2 with 4876 rules applied. Total rules applied 5577 place count 2815 transition count 12512
Drop transitions (Redundant composition of simpler transitions.) removed 2341 transitions
Redundant transition composition rules discarded 2341 transitions
Iterating global reduction 2 with 2341 rules applied. Total rules applied 7918 place count 2815 transition count 10171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7919 place count 2815 transition count 10170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7920 place count 2814 transition count 10170
Partial Free-agglomeration rule applied 2549 times.
Drop transitions (Partial Free agglomeration) removed 2549 transitions
Iterating global reduction 3 with 2549 rules applied. Total rules applied 10469 place count 2814 transition count 10170
Partial Free-agglomeration rule applied 50 times.
Drop transitions (Partial Free agglomeration) removed 50 transitions
Iterating global reduction 3 with 50 rules applied. Total rules applied 10519 place count 2814 transition count 10170
Applied a total of 10519 rules in 4249 ms. Remains 2814 /5604 variables (removed 2790) and now considering 10170/15300 (removed 5130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4266 ms. Remains : 2814/5604 places, 10170/15300 transitions.
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:13:55] [INFO ] Computed 52 invariants in 372 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 1000000 steps (4330 resets) in 15345 ms. (65 steps per ms)
BEST_FIRST walk for 15000015 steps (1024 resets) in 22501 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2024-05-21 00:14:33] [INFO ] Invariant cache hit.
[2024-05-21 00:14:33] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:14:33] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:14:35] [INFO ] [Real]Absence check using state equation in 1993 ms returned sat
[2024-05-21 00:14:35] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:14:36] [INFO ] [Real]Added 9984 Read/Feed constraints in 881 ms returned sat
[2024-05-21 00:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:14:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 53 ms returned sat
[2024-05-21 00:14:37] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:14:39] [INFO ] [Nat]Absence check using state equation in 2004 ms returned sat
[2024-05-21 00:14:40] [INFO ] [Nat]Added 9984 Read/Feed constraints in 836 ms returned sat
[2024-05-21 00:14:41] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 590 ms.
[2024-05-21 00:14:42] [INFO ] Added : 8 causal constraints over 2 iterations in 2182 ms. Result :sat
Minimization took 5781 ms.
[2024-05-21 00:14:48] [INFO ] [Real]Absence check using 50 positive place invariants in 58 ms returned sat
[2024-05-21 00:14:48] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:14:50] [INFO ] [Real]Absence check using state equation in 2081 ms returned sat
[2024-05-21 00:14:51] [INFO ] [Real]Added 9984 Read/Feed constraints in 725 ms returned sat
[2024-05-21 00:14:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:14:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 51 ms returned sat
[2024-05-21 00:14:52] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:14:54] [INFO ] [Nat]Absence check using state equation in 1955 ms returned sat
[2024-05-21 00:14:55] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1575 ms returned sat
[2024-05-21 00:14:56] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 558 ms.
[2024-05-21 00:14:58] [INFO ] Added : 10 causal constraints over 2 iterations in 2056 ms. Result :sat
Minimization took 5628 ms.
[2024-05-21 00:15:03] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:15:04] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:15:05] [INFO ] [Real]Absence check using state equation in 1937 ms returned sat
[2024-05-21 00:15:06] [INFO ] [Real]Added 9984 Read/Feed constraints in 842 ms returned sat
[2024-05-21 00:15:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:15:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:15:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:15:09] [INFO ] [Nat]Absence check using state equation in 1991 ms returned sat
[2024-05-21 00:15:10] [INFO ] [Nat]Added 9984 Read/Feed constraints in 944 ms returned sat
[2024-05-21 00:15:11] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 475 ms.
[2024-05-21 00:15:12] [INFO ] Added : 8 causal constraints over 2 iterations in 1883 ms. Result :sat
Minimization took 5686 ms.
[2024-05-21 00:15:18] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:15:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:15:20] [INFO ] [Real]Absence check using state equation in 1969 ms returned sat
[2024-05-21 00:15:21] [INFO ] [Real]Added 9984 Read/Feed constraints in 857 ms returned sat
[2024-05-21 00:15:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:15:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:15:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:15:24] [INFO ] [Nat]Absence check using state equation in 2014 ms returned sat
[2024-05-21 00:15:24] [INFO ] [Nat]Added 9984 Read/Feed constraints in 849 ms returned sat
[2024-05-21 00:15:25] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 488 ms.
[2024-05-21 00:15:27] [INFO ] Added : 8 causal constraints over 2 iterations in 1968 ms. Result :sat
Minimization took 5766 ms.
[2024-05-21 00:15:33] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:15:33] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:15:35] [INFO ] [Real]Absence check using state equation in 2006 ms returned sat
[2024-05-21 00:15:36] [INFO ] [Real]Added 9984 Read/Feed constraints in 841 ms returned sat
[2024-05-21 00:15:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:15:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:15:36] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:15:38] [INFO ] [Nat]Absence check using state equation in 2003 ms returned sat
[2024-05-21 00:15:39] [INFO ] [Nat]Added 9984 Read/Feed constraints in 828 ms returned sat
[2024-05-21 00:15:40] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 503 ms.
[2024-05-21 00:15:41] [INFO ] Added : 7 causal constraints over 2 iterations in 1943 ms. Result :sat
Minimization took 5735 ms.
[2024-05-21 00:15:47] [INFO ] [Real]Absence check using 50 positive place invariants in 49 ms returned sat
[2024-05-21 00:15:47] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-21 00:15:50] [INFO ] [Real]Absence check using state equation in 2254 ms returned sat
[2024-05-21 00:15:51] [INFO ] [Real]Added 9984 Read/Feed constraints in 868 ms returned sat
[2024-05-21 00:15:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:15:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:15:51] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:15:53] [INFO ] [Nat]Absence check using state equation in 1982 ms returned sat
[2024-05-21 00:15:54] [INFO ] [Nat]Added 9984 Read/Feed constraints in 819 ms returned sat
[2024-05-21 00:15:55] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 499 ms.
[2024-05-21 00:15:56] [INFO ] Added : 6 causal constraints over 2 iterations in 1893 ms. Result :sat
Minimization took 5632 ms.
[2024-05-21 00:16:02] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:16:02] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:16:04] [INFO ] [Real]Absence check using state equation in 1947 ms returned sat
[2024-05-21 00:16:05] [INFO ] [Real]Added 9984 Read/Feed constraints in 764 ms returned sat
[2024-05-21 00:16:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:16:05] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:16:05] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:16:07] [INFO ] [Nat]Absence check using state equation in 1981 ms returned sat
[2024-05-21 00:16:08] [INFO ] [Nat]Added 9984 Read/Feed constraints in 826 ms returned sat
[2024-05-21 00:16:09] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 485 ms.
[2024-05-21 00:16:11] [INFO ] Added : 11 causal constraints over 3 iterations in 2349 ms. Result :sat
Minimization took 5597 ms.
[2024-05-21 00:16:17] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 00:16:17] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:16:19] [INFO ] [Real]Absence check using state equation in 1942 ms returned sat
[2024-05-21 00:16:19] [INFO ] [Real]Added 9984 Read/Feed constraints in 735 ms returned sat
[2024-05-21 00:16:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:16:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:16:20] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:16:22] [INFO ] [Nat]Absence check using state equation in 1972 ms returned sat
[2024-05-21 00:16:23] [INFO ] [Nat]Added 9984 Read/Feed constraints in 857 ms returned sat
[2024-05-21 00:16:23] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 500 ms.
[2024-05-21 00:16:25] [INFO ] Added : 8 causal constraints over 2 iterations in 1916 ms. Result :sat
Minimization took 5660 ms.
[2024-05-21 00:16:31] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:16:31] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:16:33] [INFO ] [Real]Absence check using state equation in 1968 ms returned sat
[2024-05-21 00:16:34] [INFO ] [Real]Added 9984 Read/Feed constraints in 832 ms returned sat
[2024-05-21 00:16:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:16:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:16:34] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-21 00:16:36] [INFO ] [Nat]Absence check using state equation in 2006 ms returned sat
[2024-05-21 00:16:37] [INFO ] [Nat]Added 9984 Read/Feed constraints in 883 ms returned sat
[2024-05-21 00:16:38] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 499 ms.
[2024-05-21 00:16:39] [INFO ] Added : 8 causal constraints over 2 iterations in 1950 ms. Result :sat
Minimization took 5633 ms.
[2024-05-21 00:16:45] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:16:45] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:16:47] [INFO ] [Real]Absence check using state equation in 1934 ms returned sat
[2024-05-21 00:16:48] [INFO ] [Real]Added 9984 Read/Feed constraints in 808 ms returned sat
[2024-05-21 00:16:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:16:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:16:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:16:51] [INFO ] [Nat]Absence check using state equation in 1995 ms returned sat
[2024-05-21 00:16:52] [INFO ] [Nat]Added 9984 Read/Feed constraints in 991 ms returned sat
[2024-05-21 00:16:52] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 487 ms.
[2024-05-21 00:16:54] [INFO ] Added : 9 causal constraints over 2 iterations in 1937 ms. Result :sat
Minimization took 5630 ms.
[2024-05-21 00:17:00] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 00:17:00] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:17:02] [INFO ] [Real]Absence check using state equation in 2028 ms returned sat
[2024-05-21 00:17:03] [INFO ] [Real]Added 9984 Read/Feed constraints in 943 ms returned sat
[2024-05-21 00:17:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:17:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:17:04] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:17:06] [INFO ] [Nat]Absence check using state equation in 1999 ms returned sat
[2024-05-21 00:17:06] [INFO ] [Nat]Added 9984 Read/Feed constraints in 885 ms returned sat
[2024-05-21 00:17:07] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 482 ms.
[2024-05-21 00:17:09] [INFO ] Added : 8 causal constraints over 2 iterations in 2008 ms. Result :sat
Minimization took 5661 ms.
[2024-05-21 00:17:15] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:17:15] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:17:17] [INFO ] [Real]Absence check using state equation in 1982 ms returned sat
[2024-05-21 00:17:18] [INFO ] [Real]Added 9984 Read/Feed constraints in 821 ms returned sat
[2024-05-21 00:17:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:17:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:17:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:17:20] [INFO ] [Nat]Absence check using state equation in 1991 ms returned sat
[2024-05-21 00:17:23] [INFO ] [Nat]Added 9984 Read/Feed constraints in 2605 ms returned sat
[2024-05-21 00:17:23] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 502 ms.
[2024-05-21 00:17:25] [INFO ] Added : 14 causal constraints over 3 iterations in 2352 ms. Result :sat
Minimization took 5691 ms.
[2024-05-21 00:17:31] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:17:31] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:17:33] [INFO ] [Real]Absence check using state equation in 2008 ms returned sat
[2024-05-21 00:17:34] [INFO ] [Real]Added 9984 Read/Feed constraints in 821 ms returned sat
[2024-05-21 00:17:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:17:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:17:35] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:17:37] [INFO ] [Nat]Absence check using state equation in 2035 ms returned sat
[2024-05-21 00:17:38] [INFO ] [Nat]Added 9984 Read/Feed constraints in 820 ms returned sat
[2024-05-21 00:17:38] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 499 ms.
[2024-05-21 00:17:40] [INFO ] Added : 7 causal constraints over 2 iterations in 1927 ms. Result :sat
Minimization took 5765 ms.
[2024-05-21 00:17:46] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:17:46] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:17:48] [INFO ] [Real]Absence check using state equation in 2015 ms returned sat
[2024-05-21 00:17:49] [INFO ] [Real]Added 9984 Read/Feed constraints in 827 ms returned sat
[2024-05-21 00:17:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:17:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:17:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-21 00:17:51] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2024-05-21 00:17:52] [INFO ] [Nat]Added 9984 Read/Feed constraints in 834 ms returned sat
[2024-05-21 00:17:53] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 506 ms.
[2024-05-21 00:17:54] [INFO ] Added : 8 causal constraints over 2 iterations in 1962 ms. Result :sat
Minimization took 5669 ms.
[2024-05-21 00:18:00] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:18:00] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:18:02] [INFO ] [Real]Absence check using state equation in 2015 ms returned sat
[2024-05-21 00:18:03] [INFO ] [Real]Added 9984 Read/Feed constraints in 843 ms returned sat
[2024-05-21 00:18:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:18:04] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:18:04] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:18:06] [INFO ] [Nat]Absence check using state equation in 2098 ms returned sat
[2024-05-21 00:18:07] [INFO ] [Nat]Added 9984 Read/Feed constraints in 907 ms returned sat
[2024-05-21 00:18:08] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 505 ms.
[2024-05-21 00:18:09] [INFO ] Added : 8 causal constraints over 2 iterations in 1963 ms. Result :sat
Minimization took 5787 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 15 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 408 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 2814/2814 places, 10170/10170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 402 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
[2024-05-21 00:18:16] [INFO ] Invariant cache hit.
[2024-05-21 00:18:20] [INFO ] Implicit Places using invariants in 3880 ms returned []
Implicit Place search using SMT only with invariants took 3881 ms to find 0 implicit places.
Running 10120 sub problems to find dead transitions.
[2024-05-21 00:18:20] [INFO ] Invariant cache hit.
[2024-05-21 00:18:20] [INFO ] State equation strengthened by 9984 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10120 unsolved
SMT process timed out in 43808ms, After SMT, problems are : Problem set: 0 solved, 10120 unsolved
Search for dead transitions found 0 dead transitions in 43929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48268 ms. Remains : 2814/2814 places, 10170/10170 transitions.
[2024-05-21 00:19:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 1000000 steps (4320 resets) in 14712 ms. (67 steps per ms)
BEST_FIRST walk for 15000015 steps (1027 resets) in 22083 ms. (679 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2024-05-21 00:19:40] [INFO ] Invariant cache hit.
[2024-05-21 00:19:41] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:19:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 00:19:43] [INFO ] [Real]Absence check using state equation in 1970 ms returned sat
[2024-05-21 00:19:43] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:19:44] [INFO ] [Real]Added 9984 Read/Feed constraints in 833 ms returned sat
[2024-05-21 00:19:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:19:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:19:44] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:19:46] [INFO ] [Nat]Absence check using state equation in 1997 ms returned sat
[2024-05-21 00:19:47] [INFO ] [Nat]Added 9984 Read/Feed constraints in 834 ms returned sat
[2024-05-21 00:19:48] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 494 ms.
[2024-05-21 00:19:49] [INFO ] Added : 8 causal constraints over 2 iterations in 1915 ms. Result :sat
Minimization took 5932 ms.
[2024-05-21 00:19:55] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-21 00:19:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-21 00:19:58] [INFO ] [Real]Absence check using state equation in 2027 ms returned sat
[2024-05-21 00:19:58] [INFO ] [Real]Added 9984 Read/Feed constraints in 752 ms returned sat
[2024-05-21 00:19:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:19:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:19:59] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:20:01] [INFO ] [Nat]Absence check using state equation in 1959 ms returned sat
[2024-05-21 00:20:03] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1635 ms returned sat
[2024-05-21 00:20:03] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 481 ms.
[2024-05-21 00:20:05] [INFO ] Added : 10 causal constraints over 2 iterations in 1998 ms. Result :sat
Minimization took 5818 ms.
[2024-05-21 00:20:11] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:20:11] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:20:13] [INFO ] [Real]Absence check using state equation in 2019 ms returned sat
[2024-05-21 00:20:14] [INFO ] [Real]Added 9984 Read/Feed constraints in 885 ms returned sat
[2024-05-21 00:20:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:20:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:20:15] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:20:17] [INFO ] [Nat]Absence check using state equation in 2036 ms returned sat
[2024-05-21 00:20:18] [INFO ] [Nat]Added 9984 Read/Feed constraints in 980 ms returned sat
[2024-05-21 00:20:18] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 490 ms.
[2024-05-21 00:20:20] [INFO ] Added : 8 causal constraints over 2 iterations in 1986 ms. Result :sat
Minimization took 5803 ms.
[2024-05-21 00:20:26] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:20:26] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:20:28] [INFO ] [Real]Absence check using state equation in 1993 ms returned sat
[2024-05-21 00:20:29] [INFO ] [Real]Added 9984 Read/Feed constraints in 867 ms returned sat
[2024-05-21 00:20:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:20:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:20:29] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:20:31] [INFO ] [Nat]Absence check using state equation in 2012 ms returned sat
[2024-05-21 00:20:32] [INFO ] [Nat]Added 9984 Read/Feed constraints in 893 ms returned sat
[2024-05-21 00:20:33] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 503 ms.
[2024-05-21 00:20:34] [INFO ] Added : 8 causal constraints over 2 iterations in 1985 ms. Result :sat
Minimization took 5727 ms.
[2024-05-21 00:20:40] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:20:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:20:43] [INFO ] [Real]Absence check using state equation in 2041 ms returned sat
[2024-05-21 00:20:44] [INFO ] [Real]Added 9984 Read/Feed constraints in 827 ms returned sat
[2024-05-21 00:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:20:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:20:44] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:20:46] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2024-05-21 00:20:47] [INFO ] [Nat]Added 9984 Read/Feed constraints in 819 ms returned sat
[2024-05-21 00:20:48] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 498 ms.
[2024-05-21 00:20:49] [INFO ] Added : 7 causal constraints over 2 iterations in 1970 ms. Result :sat
Minimization took 5787 ms.
[2024-05-21 00:20:55] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:20:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:20:57] [INFO ] [Real]Absence check using state equation in 1977 ms returned sat
[2024-05-21 00:20:58] [INFO ] [Real]Added 9984 Read/Feed constraints in 862 ms returned sat
[2024-05-21 00:20:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:20:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:20:59] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:21:01] [INFO ] [Nat]Absence check using state equation in 1965 ms returned sat
[2024-05-21 00:21:02] [INFO ] [Nat]Added 9984 Read/Feed constraints in 840 ms returned sat
[2024-05-21 00:21:02] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 504 ms.
[2024-05-21 00:21:04] [INFO ] Added : 6 causal constraints over 2 iterations in 1974 ms. Result :sat
Minimization took 5914 ms.
[2024-05-21 00:21:10] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:21:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-21 00:21:12] [INFO ] [Real]Absence check using state equation in 1995 ms returned sat
[2024-05-21 00:21:13] [INFO ] [Real]Added 9984 Read/Feed constraints in 789 ms returned sat
[2024-05-21 00:21:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:21:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:21:13] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:21:15] [INFO ] [Nat]Absence check using state equation in 2050 ms returned sat
[2024-05-21 00:21:16] [INFO ] [Nat]Added 9984 Read/Feed constraints in 847 ms returned sat
[2024-05-21 00:21:17] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 500 ms.
[2024-05-21 00:21:19] [INFO ] Added : 11 causal constraints over 3 iterations in 2367 ms. Result :sat
Minimization took 5851 ms.
[2024-05-21 00:21:25] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:21:25] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-21 00:21:27] [INFO ] [Real]Absence check using state equation in 2031 ms returned sat
[2024-05-21 00:21:28] [INFO ] [Real]Added 9984 Read/Feed constraints in 801 ms returned sat
[2024-05-21 00:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:21:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:21:29] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:21:31] [INFO ] [Nat]Absence check using state equation in 2054 ms returned sat
[2024-05-21 00:21:32] [INFO ] [Nat]Added 9984 Read/Feed constraints in 882 ms returned sat
[2024-05-21 00:21:32] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 488 ms.
[2024-05-21 00:21:34] [INFO ] Added : 8 causal constraints over 2 iterations in 1934 ms. Result :sat
Minimization took 5788 ms.
[2024-05-21 00:21:40] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:21:40] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-21 00:21:42] [INFO ] [Real]Absence check using state equation in 1976 ms returned sat
[2024-05-21 00:21:43] [INFO ] [Real]Added 9984 Read/Feed constraints in 824 ms returned sat
[2024-05-21 00:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:21:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:21:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-21 00:21:45] [INFO ] [Nat]Absence check using state equation in 2030 ms returned sat
[2024-05-21 00:21:46] [INFO ] [Nat]Added 9984 Read/Feed constraints in 892 ms returned sat
[2024-05-21 00:21:47] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 518 ms.
[2024-05-21 00:21:48] [INFO ] Added : 8 causal constraints over 2 iterations in 2001 ms. Result :sat
Minimization took 5821 ms.
[2024-05-21 00:21:55] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 00:21:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:21:57] [INFO ] [Real]Absence check using state equation in 2036 ms returned sat
[2024-05-21 00:21:58] [INFO ] [Real]Added 9984 Read/Feed constraints in 871 ms returned sat
[2024-05-21 00:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:21:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:21:58] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-21 00:22:00] [INFO ] [Nat]Absence check using state equation in 2064 ms returned sat
[2024-05-21 00:22:01] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1073 ms returned sat
[2024-05-21 00:22:02] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 482 ms.
[2024-05-21 00:22:03] [INFO ] Added : 9 causal constraints over 2 iterations in 1945 ms. Result :sat
Minimization took 5873 ms.
[2024-05-21 00:22:10] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:22:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:22:12] [INFO ] [Real]Absence check using state equation in 2016 ms returned sat
[2024-05-21 00:22:13] [INFO ] [Real]Added 9984 Read/Feed constraints in 952 ms returned sat
[2024-05-21 00:22:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:22:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:22:13] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:22:15] [INFO ] [Nat]Absence check using state equation in 2070 ms returned sat
[2024-05-21 00:22:16] [INFO ] [Nat]Added 9984 Read/Feed constraints in 917 ms returned sat
[2024-05-21 00:22:17] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 494 ms.
[2024-05-21 00:22:19] [INFO ] Added : 8 causal constraints over 2 iterations in 2013 ms. Result :sat
Minimization took 5822 ms.
[2024-05-21 00:22:25] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:22:25] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-21 00:22:27] [INFO ] [Real]Absence check using state equation in 1981 ms returned sat
[2024-05-21 00:22:28] [INFO ] [Real]Added 9984 Read/Feed constraints in 820 ms returned sat
[2024-05-21 00:22:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:22:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:22:28] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:22:30] [INFO ] [Nat]Absence check using state equation in 2016 ms returned sat
[2024-05-21 00:22:33] [INFO ] [Nat]Added 9984 Read/Feed constraints in 2638 ms returned sat
[2024-05-21 00:22:34] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 487 ms.
[2024-05-21 00:22:35] [INFO ] Added : 14 causal constraints over 3 iterations in 2374 ms. Result :sat
Minimization took 5649 ms.
[2024-05-21 00:22:41] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:22:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:22:43] [INFO ] [Real]Absence check using state equation in 1957 ms returned sat
[2024-05-21 00:22:44] [INFO ] [Real]Added 9984 Read/Feed constraints in 825 ms returned sat
[2024-05-21 00:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:22:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:22:45] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:22:47] [INFO ] [Nat]Absence check using state equation in 2002 ms returned sat
[2024-05-21 00:22:48] [INFO ] [Nat]Added 9984 Read/Feed constraints in 826 ms returned sat
[2024-05-21 00:22:48] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 489 ms.
[2024-05-21 00:22:50] [INFO ] Added : 7 causal constraints over 2 iterations in 1895 ms. Result :sat
Minimization took 5746 ms.
[2024-05-21 00:22:56] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:22:56] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:22:58] [INFO ] [Real]Absence check using state equation in 1947 ms returned sat
[2024-05-21 00:22:59] [INFO ] [Real]Added 9984 Read/Feed constraints in 821 ms returned sat
[2024-05-21 00:22:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:22:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:22:59] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:23:01] [INFO ] [Nat]Absence check using state equation in 2032 ms returned sat
[2024-05-21 00:23:02] [INFO ] [Nat]Added 9984 Read/Feed constraints in 848 ms returned sat
[2024-05-21 00:23:03] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 486 ms.
[2024-05-21 00:23:04] [INFO ] Added : 8 causal constraints over 2 iterations in 1968 ms. Result :sat
Minimization took 5855 ms.
[2024-05-21 00:23:11] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:23:11] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:23:12] [INFO ] [Real]Absence check using state equation in 1936 ms returned sat
[2024-05-21 00:23:13] [INFO ] [Real]Added 9984 Read/Feed constraints in 839 ms returned sat
[2024-05-21 00:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:23:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:23:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:23:16] [INFO ] [Nat]Absence check using state equation in 2045 ms returned sat
[2024-05-21 00:23:17] [INFO ] [Nat]Added 9984 Read/Feed constraints in 876 ms returned sat
[2024-05-21 00:23:18] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 480 ms.
[2024-05-21 00:23:19] [INFO ] Added : 8 causal constraints over 2 iterations in 1908 ms. Result :sat
Minimization took 5843 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 15 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 409 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 2814/2814 places, 10170/10170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 394 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
[2024-05-21 00:23:26] [INFO ] Invariant cache hit.
[2024-05-21 00:23:29] [INFO ] Implicit Places using invariants in 3659 ms returned []
Implicit Place search using SMT only with invariants took 3659 ms to find 0 implicit places.
Running 10120 sub problems to find dead transitions.
[2024-05-21 00:23:29] [INFO ] Invariant cache hit.
[2024-05-21 00:23:30] [INFO ] State equation strengthened by 9984 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10120 unsolved
SMT process timed out in 42993ms, After SMT, problems are : Problem set: 0 solved, 10120 unsolved
Search for dead transitions found 0 dead transitions in 43076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47148 ms. Remains : 2814/2814 places, 10170/10170 transitions.
RANDOM walk for 40000 steps (170 resets) in 2505 ms. (15 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
[2024-05-21 00:24:14] [INFO ] Flatten gal took : 816 ms
[2024-05-21 00:24:14] [INFO ] Flatten gal took : 279 ms
[2024-05-21 00:24:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9907992834838471035.gal : 97 ms
[2024-05-21 00:24:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality665848409714263016.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/ReachabilityCardinality9907992834838471035.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality665848409714263016.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 ...327
Loading property file /tmp/ReachabilityCardinality665848409714263016.prop.
Interrupted probabilistic random walk after 66545 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 30
Probabilistic random walk after 66545 steps, saw 28079 distinct states, run finished after 3006 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-21 00:24:16] [INFO ] Invariant cache hit.
[2024-05-21 00:24:17] [INFO ] State equation strengthened by 9984 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2697/2712 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-21 00:24:17] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 7 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-21 00:24:17] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
[2024-05-21 00:24:17] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-21 00:24:17] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-21 00:24:18] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-21 00:24:19] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 7 ms to minimize.
[2024-05-21 00:24:19] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 00:24:19] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-05-21 00:24:19] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 00:24:19] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-21 00:24:19] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2712 variables, 20/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2712 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 98/2810 variables, 49/70 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 0/70 constraints. Problems are: Problem set: 15 solved, 15 unsolved
SMT process timed out in 5170ms, After SMT, problems are : Problem set: 15 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 397 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 2814/2814 places, 10170/10170 transitions.
RANDOM walk for 40000 steps (170 resets) in 1328 ms. (30 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 75386 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 15
Probabilistic random walk after 75386 steps, saw 29212 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-21 00:24:25] [INFO ] Invariant cache hit.
[2024-05-21 00:24:26] [INFO ] State equation strengthened by 9984 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 2697/2712 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 00:24:26] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2712 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2712 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 98/2810 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/2812 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 00:24:32] [INFO ] Deduced a trap composed of 57 places in 2566 ms of which 18 ms to minimize.
[2024-05-21 00:24:35] [INFO ] Deduced a trap composed of 63 places in 2598 ms of which 17 ms to minimize.
[2024-05-21 00:24:37] [INFO ] Deduced a trap composed of 63 places in 2515 ms of which 18 ms to minimize.
[2024-05-21 00:24:40] [INFO ] Deduced a trap composed of 63 places in 2490 ms of which 17 ms to minimize.
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 2519
[2024-05-21 00:24:42] [INFO ] Deduced a trap composed of 87 places in 2540 ms of which 19 ms to minimize.
[2024-05-21 00:24:45] [INFO ] Deduced a trap composed of 78 places in 2544 ms of which 17 ms to minimize.
[2024-05-21 00:24:48] [INFO ] Deduced a trap composed of 67 places in 2570 ms of which 17 ms to minimize.
[2024-05-21 00:24:50] [INFO ] Deduced a trap composed of 66 places in 2559 ms of which 17 ms to minimize.
[2024-05-21 00:24:53] [INFO ] Deduced a trap composed of 67 places in 2483 ms of which 16 ms to minimize.
[2024-05-21 00:24:55] [INFO ] Deduced a trap composed of 67 places in 2351 ms of which 16 ms to minimize.
[2024-05-21 00:24:58] [INFO ] Deduced a trap composed of 91 places in 2392 ms of which 16 ms to minimize.
[2024-05-21 00:25:00] [INFO ] Deduced a trap composed of 66 places in 2312 ms of which 16 ms to minimize.
[2024-05-21 00:25:02] [INFO ] Deduced a trap composed of 66 places in 2321 ms of which 17 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:25:05] [INFO ] Deduced a trap composed of 71 places in 2461 ms of which 17 ms to minimize.
[2024-05-21 00:25:05] [INFO ] Flatten gal took : 261 ms
[2024-05-21 00:25:05] [INFO ] Applying decomposition
[2024-05-21 00:25:05] [INFO ] Flatten gal took : 277 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/graph5790764811623465396.txt' '-o' '/tmp/graph5790764811623465396.bin' '-w' '/tmp/graph5790764811623465396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5790764811623465396.bin' '-l' '-1' '-v' '-w' '/tmp/graph5790764811623465396.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:25:06] [INFO ] Decomposing Gal with order
[2024-05-21 00:25:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:25:07] [INFO ] Deduced a trap composed of 115 places in 2235 ms of which 14 ms to minimize.
[2024-05-21 00:25:07] [INFO ] Removed a total of 7685 redundant transitions.
[2024-05-21 00:25:08] [INFO ] Flatten gal took : 1255 ms
[2024-05-21 00:25:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 8823 labels/synchronizations in 680 ms.
[2024-05-21 00:25:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7559320983279678443.gal : 125 ms
[2024-05-21 00:25:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5725259699336008174.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/ReachabilityCardinality7559320983279678443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5725259699336008174.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
[2024-05-21 00:25:09] [INFO ] Deduced a trap composed of 62 places in 2105 ms of which 15 ms to minimize.
Loading property file /tmp/ReachabilityCardinality5725259699336008174.prop.
[2024-05-21 00:25:11] [INFO ] Deduced a trap composed of 61 places in 2280 ms of which 15 ms to minimize.
SMT process timed out in 46036ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 406 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 2814/2814 places, 10170/10170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 403 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
[2024-05-21 00:25:12] [INFO ] Invariant cache hit.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 4348
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :4348 after 4348
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :4348 after 4492
[2024-05-21 00:25:16] [INFO ] Implicit Places using invariants in 3710 ms returned []
Implicit Place search using SMT only with invariants took 3712 ms to find 0 implicit places.
Running 10120 sub problems to find dead transitions.
[2024-05-21 00:25:16] [INFO ] Invariant cache hit.
[2024-05-21 00:25:16] [INFO ] State equation strengthened by 9984 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :4492 after 1.09216e+06
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10120 unsolved
SMT process timed out in 44432ms, After SMT, problems are : Problem set: 0 solved, 10120 unsolved
Search for dead transitions found 0 dead transitions in 44530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48666 ms. Remains : 2814/2814 places, 10170/10170 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2024-05-21 00:26:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 174 ms. (57 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-21 00:26:01] [INFO ] Invariant cache hit.
[2024-05-21 00:26:01] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:26:01] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:26:03] [INFO ] [Real]Absence check using state equation in 2127 ms returned sat
[2024-05-21 00:26:04] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:26:04] [INFO ] [Real]Added 9984 Read/Feed constraints in 858 ms returned sat
[2024-05-21 00:26:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:26:05] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:26:05] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:26:07] [INFO ] [Nat]Absence check using state equation in 2032 ms returned sat
[2024-05-21 00:26:08] [INFO ] [Nat]Added 9984 Read/Feed constraints in 961 ms returned sat
[2024-05-21 00:26:09] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 585 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1143 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1145 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 00:26:11] [INFO ] Computed 52 invariants in 340 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4345 resets) in 15234 ms. (65 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1580 ms. (632 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:26:28] [INFO ] Invariant cache hit.
[2024-05-21 00:26:28] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:26:28] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:26:30] [INFO ] [Real]Absence check using state equation in 2000 ms returned sat
[2024-05-21 00:26:31] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:26:32] [INFO ] [Real]Added 10007 Read/Feed constraints in 857 ms returned sat
[2024-05-21 00:26:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:26:32] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:26:32] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:26:34] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2024-05-21 00:26:35] [INFO ] [Nat]Added 10007 Read/Feed constraints in 979 ms returned sat
[2024-05-21 00:26:36] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 563 ms.
[2024-05-21 00:26:37] [INFO ] Added : 8 causal constraints over 2 iterations in 2071 ms. Result :sat
Minimization took 7066 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 395 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 390 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:26:45] [INFO ] Invariant cache hit.
[2024-05-21 00:26:49] [INFO ] Implicit Places using invariants in 3698 ms returned []
Implicit Place search using SMT only with invariants took 3699 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:26:49] [INFO ] Invariant cache hit.
[2024-05-21 00:26:49] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43080ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47271 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 00:27:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4347 resets) in 15460 ms. (64 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1519 ms. (657 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:27:49] [INFO ] Invariant cache hit.
[2024-05-21 00:27:49] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-21 00:27:49] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:27:51] [INFO ] [Real]Absence check using state equation in 2043 ms returned sat
[2024-05-21 00:27:52] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:27:53] [INFO ] [Real]Added 10007 Read/Feed constraints in 996 ms returned sat
[2024-05-21 00:27:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:27:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-21 00:27:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:27:55] [INFO ] [Nat]Absence check using state equation in 2078 ms returned sat
[2024-05-21 00:27:56] [INFO ] [Nat]Added 10007 Read/Feed constraints in 934 ms returned sat
[2024-05-21 00:27:57] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 492 ms.
[2024-05-21 00:27:58] [INFO ] Added : 8 causal constraints over 2 iterations in 1974 ms. Result :sat
Minimization took 7119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 409 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 405 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:28:06] [INFO ] Invariant cache hit.
[2024-05-21 00:28:10] [INFO ] Implicit Places using invariants in 3623 ms returned []
Implicit Place search using SMT only with invariants took 3624 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:28:10] [INFO ] Invariant cache hit.
[2024-05-21 00:28:10] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43372ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47531 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 1328 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2024-05-21 00:28:54] [INFO ] Flatten gal took : 436 ms
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2024-05-21 00:28:54] [INFO ] Flatten gal took : 222 ms
[2024-05-21 00:28:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16502780276314172099.gal : 39 ms
[2024-05-21 00:28:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8372666001633823867.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/ReachabilityCardinality16502780276314172099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8372666001633823867.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/ReachabilityCardinality8372666001633823867.prop.
Interrupted probabilistic random walk after 81440 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81440 steps, saw 28974 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-21 00:28:57] [INFO ] Invariant cache hit.
[2024-05-21 00:28:57] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:28:58] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:29:01] [INFO ] Deduced a trap composed of 102 places in 2959 ms of which 28 ms to minimize.
[2024-05-21 00:29:04] [INFO ] Deduced a trap composed of 84 places in 2920 ms of which 18 ms to minimize.
SMT process timed out in 6758ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 397 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 832 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 85132 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 85132 steps, saw 29503 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 00:29:07] [INFO ] Invariant cache hit.
[2024-05-21 00:29:08] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:29:08] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:29:11] [INFO ] Deduced a trap composed of 71 places in 2846 ms of which 17 ms to minimize.
[2024-05-21 00:29:14] [INFO ] Deduced a trap composed of 68 places in 2797 ms of which 17 ms to minimize.
[2024-05-21 00:29:17] [INFO ] Deduced a trap composed of 76 places in 2795 ms of which 18 ms to minimize.
[2024-05-21 00:29:20] [INFO ] Deduced a trap composed of 68 places in 2733 ms of which 17 ms to minimize.
[2024-05-21 00:29:22] [INFO ] Deduced a trap composed of 74 places in 2778 ms of which 17 ms to minimize.
[2024-05-21 00:29:25] [INFO ] Deduced a trap composed of 78 places in 2777 ms of which 17 ms to minimize.
[2024-05-21 00:29:28] [INFO ] Deduced a trap composed of 66 places in 2809 ms of which 18 ms to minimize.
[2024-05-21 00:29:31] [INFO ] Deduced a trap composed of 101 places in 2793 ms of which 17 ms to minimize.
[2024-05-21 00:29:34] [INFO ] Deduced a trap composed of 79 places in 2774 ms of which 18 ms to minimize.
[2024-05-21 00:29:37] [INFO ] Deduced a trap composed of 75 places in 2719 ms of which 17 ms to minimize.
[2024-05-21 00:29:39] [INFO ] Deduced a trap composed of 76 places in 2689 ms of which 17 ms to minimize.
[2024-05-21 00:29:42] [INFO ] Deduced a trap composed of 78 places in 2785 ms of which 17 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:29:45] [INFO ] Flatten gal took : 220 ms
[2024-05-21 00:29:45] [INFO ] Applying decomposition
[2024-05-21 00:29:45] [INFO ] Flatten gal took : 218 ms
[2024-05-21 00:29:45] [INFO ] Deduced a trap composed of 71 places in 2720 ms of which 18 ms to minimize.
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/graph18433163384239052405.txt' '-o' '/tmp/graph18433163384239052405.bin' '-w' '/tmp/graph18433163384239052405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18433163384239052405.bin' '-l' '-1' '-v' '-w' '/tmp/graph18433163384239052405.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:29:45] [INFO ] Decomposing Gal with order
[2024-05-21 00:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:29:46] [INFO ] Removed a total of 7716 redundant transitions.
[2024-05-21 00:29:46] [INFO ] Flatten gal took : 797 ms
[2024-05-21 00:29:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 9658 labels/synchronizations in 534 ms.
[2024-05-21 00:29:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2545064958964015679.gal : 76 ms
[2024-05-21 00:29:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9223706779545747628.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/ReachabilityCardinality2545064958964015679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9223706779545747628.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
[2024-05-21 00:29:48] [INFO ] Deduced a trap composed of 76 places in 2642 ms of which 17 ms to minimize.
Loading property file /tmp/ReachabilityCardinality9223706779545747628.prop.
[2024-05-21 00:29:50] [INFO ] Deduced a trap composed of 55 places in 2626 ms of which 17 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1408
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1408 after 1408
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1408 after 1408
[2024-05-21 00:29:53] [INFO ] Deduced a trap composed of 71 places in 2602 ms of which 17 ms to minimize.
SMT process timed out in 45366ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 385 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 390 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:29:54] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1408 after 5193
[2024-05-21 00:29:57] [INFO ] Implicit Places using invariants in 3805 ms returned []
Implicit Place search using SMT only with invariants took 3807 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:29:58] [INFO ] Invariant cache hit.
[2024-05-21 00:29:58] [INFO ] State equation strengthened by 10007 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5193 after 1.1593e+06
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43019ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47338 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-00 in 280000 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:30:41] [INFO ] Computed 52 invariants in 362 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:30:41] [INFO ] Invariant cache hit.
[2024-05-21 00:30:41] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 00:30:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:30:43] [INFO ] [Real]Absence check using state equation in 1950 ms returned sat
[2024-05-21 00:30:44] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:30:44] [INFO ] [Real]Added 9984 Read/Feed constraints in 721 ms returned sat
[2024-05-21 00:30:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:30:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:30:45] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:30:47] [INFO ] [Nat]Absence check using state equation in 1996 ms returned sat
[2024-05-21 00:30:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 00:30:49] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1613 ms returned sat
[2024-05-21 00:30:49] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 496 ms.
[2024-05-21 00:30:50] [INFO ] Added : 5 causal constraints over 1 iterations in 912 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1035 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 00:30:51] [INFO ] Computed 52 invariants in 422 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4337 resets) in 14591 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (58 resets) in 1530 ms. (653 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:31:07] [INFO ] Invariant cache hit.
[2024-05-21 00:31:08] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:31:08] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:31:10] [INFO ] [Real]Absence check using state equation in 1951 ms returned sat
[2024-05-21 00:31:10] [INFO ] State equation strengthened by 10009 read => feed constraints.
[2024-05-21 00:31:11] [INFO ] [Real]Added 10009 Read/Feed constraints in 795 ms returned sat
[2024-05-21 00:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:31:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:31:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-21 00:31:13] [INFO ] [Nat]Absence check using state equation in 2027 ms returned sat
[2024-05-21 00:31:14] [INFO ] [Nat]Added 10009 Read/Feed constraints in 1132 ms returned sat
[2024-05-21 00:31:15] [INFO ] Computed and/alt/rep : 7365/19590/7365 causal constraints (skipped 2744 transitions) in 496 ms.
[2024-05-21 00:31:17] [INFO ] Added : 8 causal constraints over 2 iterations in 1970 ms. Result :sat
Minimization took 6481 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 398 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 384 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:31:24] [INFO ] Invariant cache hit.
[2024-05-21 00:31:27] [INFO ] Implicit Places using invariants in 3646 ms returned []
Implicit Place search using SMT only with invariants took 3646 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:31:28] [INFO ] Invariant cache hit.
[2024-05-21 00:31:28] [INFO ] State equation strengthened by 10009 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42877ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42958ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47005 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 1171 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
[2024-05-21 00:32:11] [INFO ] Flatten gal took : 398 ms
[2024-05-21 00:32:11] [INFO ] Flatten gal took : 218 ms
[2024-05-21 00:32:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2656227426948244934.gal : 55 ms
[2024-05-21 00:32:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12494689913647744784.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/ReachabilityCardinality2656227426948244934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12494689913647744784.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/ReachabilityCardinality12494689913647744784.prop.
Interrupted probabilistic random walk after 79488 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 79488 steps, saw 28723 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-21 00:32:14] [INFO ] Invariant cache hit.
[2024-05-21 00:32:14] [INFO ] State equation strengthened by 10009 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:32:14] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:32:18] [INFO ] Deduced a trap composed of 63 places in 2843 ms of which 17 ms to minimize.
[2024-05-21 00:32:20] [INFO ] Deduced a trap composed of 60 places in 2851 ms of which 18 ms to minimize.
SMT process timed out in 6553ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 382 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 1112 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 86880 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 86880 steps, saw 29702 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 00:32:24] [INFO ] Invariant cache hit.
[2024-05-21 00:32:24] [INFO ] State equation strengthened by 10009 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:32:25] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:32:28] [INFO ] Deduced a trap composed of 87 places in 2850 ms of which 17 ms to minimize.
[2024-05-21 00:32:31] [INFO ] Deduced a trap composed of 64 places in 2862 ms of which 18 ms to minimize.
[2024-05-21 00:32:34] [INFO ] Deduced a trap composed of 60 places in 2892 ms of which 19 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2519
[2024-05-21 00:32:37] [INFO ] Deduced a trap composed of 56 places in 2846 ms of which 17 ms to minimize.
[2024-05-21 00:32:39] [INFO ] Deduced a trap composed of 76 places in 2773 ms of which 17 ms to minimize.
[2024-05-21 00:32:42] [INFO ] Deduced a trap composed of 92 places in 2747 ms of which 17 ms to minimize.
[2024-05-21 00:32:45] [INFO ] Deduced a trap composed of 73 places in 2751 ms of which 17 ms to minimize.
[2024-05-21 00:32:48] [INFO ] Deduced a trap composed of 55 places in 2658 ms of which 16 ms to minimize.
[2024-05-21 00:32:50] [INFO ] Deduced a trap composed of 73 places in 2661 ms of which 17 ms to minimize.
[2024-05-21 00:32:53] [INFO ] Deduced a trap composed of 61 places in 2646 ms of which 16 ms to minimize.
[2024-05-21 00:32:55] [INFO ] Deduced a trap composed of 55 places in 2375 ms of which 16 ms to minimize.
[2024-05-21 00:32:58] [INFO ] Deduced a trap composed of 55 places in 2441 ms of which 16 ms to minimize.
[2024-05-21 00:33:00] [INFO ] Deduced a trap composed of 56 places in 2450 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
[2024-05-21 00:33:01] [INFO ] Flatten gal took : 194 ms
[2024-05-21 00:33:01] [INFO ] Applying decomposition
[2024-05-21 00:33:02] [INFO ] Flatten gal took : 206 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/graph9007581882690222961.txt' '-o' '/tmp/graph9007581882690222961.bin' '-w' '/tmp/graph9007581882690222961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9007581882690222961.bin' '-l' '-1' '-v' '-w' '/tmp/graph9007581882690222961.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:33:02] [INFO ] Decomposing Gal with order
[2024-05-21 00:33:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:33:03] [INFO ] Removed a total of 7719 redundant transitions.
[2024-05-21 00:33:03] [INFO ] Flatten gal took : 598 ms
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:33:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 9756 labels/synchronizations in 508 ms.
[2024-05-21 00:33:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17839325171118141544.gal : 83 ms
[2024-05-21 00:33:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality261769642791856620.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/ReachabilityCardinality17839325171118141544.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality261769642791856620.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/ReachabilityCardinality261769642791856620.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2135
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2135 after 2135
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2135 after 2135
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2135 after 2135
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2135 after 2135
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2135 after 2135
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2135 after 2135
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2135 after 2135
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2135 after 2135
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2135 after 2176
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2176 after 2187
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2187 after 2209
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12960/12962 variables, and 12876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45005 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2801/2803 constraints, ReadFeed: 10009/10009 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:33:10] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2209 after 7964
[2024-05-21 00:33:13] [INFO ] Deduced a trap composed of 71 places in 2808 ms of which 22 ms to minimize.
[2024-05-21 00:33:15] [INFO ] Deduced a trap composed of 58 places in 2656 ms of which 17 ms to minimize.
[2024-05-21 00:33:18] [INFO ] Deduced a trap composed of 64 places in 2561 ms of which 15 ms to minimize.
[2024-05-21 00:33:21] [INFO ] Deduced a trap composed of 61 places in 2673 ms of which 17 ms to minimize.
[2024-05-21 00:33:23] [INFO ] Deduced a trap composed of 66 places in 2568 ms of which 16 ms to minimize.
[2024-05-21 00:33:26] [INFO ] Deduced a trap composed of 61 places in 2526 ms of which 15 ms to minimize.
[2024-05-21 00:33:29] [INFO ] Deduced a trap composed of 63 places in 2499 ms of which 16 ms to minimize.
[2024-05-21 00:33:31] [INFO ] Deduced a trap composed of 63 places in 2525 ms of which 16 ms to minimize.
[2024-05-21 00:33:34] [INFO ] Deduced a trap composed of 62 places in 2579 ms of which 17 ms to minimize.
[2024-05-21 00:33:36] [INFO ] Deduced a trap composed of 58 places in 2546 ms of which 16 ms to minimize.
[2024-05-21 00:33:39] [INFO ] Deduced a trap composed of 56 places in 2468 ms of which 16 ms to minimize.
[2024-05-21 00:33:41] [INFO ] Deduced a trap composed of 54 places in 2474 ms of which 16 ms to minimize.
[2024-05-21 00:33:44] [INFO ] Deduced a trap composed of 64 places in 2378 ms of which 16 ms to minimize.
[2024-05-21 00:33:46] [INFO ] Deduced a trap composed of 121 places in 2491 ms of which 15 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7964 after 3.90734e+07
[2024-05-21 00:33:49] [INFO ] Deduced a trap composed of 68 places in 2527 ms of which 14 ms to minimize.
[2024-05-21 00:33:51] [INFO ] Deduced a trap composed of 61 places in 2304 ms of which 15 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.90734e+07 after 5.98319e+07
[2024-05-21 00:33:54] [INFO ] Deduced a trap composed of 76 places in 2376 ms of which 15 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:33:56] [INFO ] Deduced a trap composed of 78 places in 2161 ms of which 13 ms to minimize.
SMT process timed out in 91573ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 385 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 380 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:33:57] [INFO ] Invariant cache hit.
[2024-05-21 00:34:00] [INFO ] Implicit Places using invariants in 3464 ms returned []
Implicit Place search using SMT only with invariants took 3464 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:34:00] [INFO ] Invariant cache hit.
[2024-05-21 00:34:00] [INFO ] State equation strengthened by 10009 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42752ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42831ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46691 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-01 in 242253 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:34:43] [INFO ] Computed 52 invariants in 380 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 151 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-21 00:34:43] [INFO ] Invariant cache hit.
[2024-05-21 00:34:44] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:34:44] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-21 00:34:46] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2024-05-21 00:34:46] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:34:47] [INFO ] [Real]Added 9984 Read/Feed constraints in 853 ms returned sat
[2024-05-21 00:34:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:34:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 00:34:47] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:34:49] [INFO ] [Nat]Absence check using state equation in 2057 ms returned sat
[2024-05-21 00:34:50] [INFO ] [Nat]Added 9984 Read/Feed constraints in 823 ms returned sat
[2024-05-21 00:34:51] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 595 ms.
[2024-05-21 00:34:52] [INFO ] Added : 1 causal constraints over 1 iterations in 1550 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1063 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 00:34:53] [INFO ] Computed 52 invariants in 334 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4335 resets) in 14611 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1539 ms. (649 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:35:10] [INFO ] Invariant cache hit.
[2024-05-21 00:35:10] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:35:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:35:12] [INFO ] [Real]Absence check using state equation in 2032 ms returned sat
[2024-05-21 00:35:12] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:35:13] [INFO ] [Real]Added 10007 Read/Feed constraints in 831 ms returned sat
[2024-05-21 00:35:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:35:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:35:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:35:16] [INFO ] [Nat]Absence check using state equation in 2036 ms returned sat
[2024-05-21 00:35:17] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1085 ms returned sat
[2024-05-21 00:35:17] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 497 ms.
[2024-05-21 00:35:19] [INFO ] Added : 12 causal constraints over 3 iterations in 2272 ms. Result :sat
Minimization took 5991 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 393 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 380 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:35:26] [INFO ] Invariant cache hit.
[2024-05-21 00:35:29] [INFO ] Implicit Places using invariants in 3553 ms returned []
Implicit Place search using SMT only with invariants took 3555 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:35:30] [INFO ] Invariant cache hit.
[2024-05-21 00:35:30] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 1.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 44224ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 44303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48251 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 00:36:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4347 resets) in 14468 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1475 ms. (677 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:36:30] [INFO ] Invariant cache hit.
[2024-05-21 00:36:30] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:36:30] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:36:32] [INFO ] [Real]Absence check using state equation in 1976 ms returned sat
[2024-05-21 00:36:32] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:36:33] [INFO ] [Real]Added 10007 Read/Feed constraints in 810 ms returned sat
[2024-05-21 00:36:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:36:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:36:34] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:36:36] [INFO ] [Nat]Absence check using state equation in 2013 ms returned sat
[2024-05-21 00:36:37] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1108 ms returned sat
[2024-05-21 00:36:37] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 480 ms.
[2024-05-21 00:36:39] [INFO ] Added : 12 causal constraints over 3 iterations in 2274 ms. Result :sat
Minimization took 6040 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 397 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 391 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:36:46] [INFO ] Invariant cache hit.
[2024-05-21 00:36:50] [INFO ] Implicit Places using invariants in 3625 ms returned []
Implicit Place search using SMT only with invariants took 3625 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:36:50] [INFO ] Invariant cache hit.
[2024-05-21 00:36:50] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43304ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43383ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47412 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 00:37:33] [INFO ] Flatten gal took : 348 ms
RANDOM walk for 40000 steps (173 resets) in 1598 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
[2024-05-21 00:37:34] [INFO ] Flatten gal took : 235 ms
[2024-05-21 00:37:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality314979362422864395.gal : 32 ms
[2024-05-21 00:37:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4138207645746138027.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/ReachabilityCardinality314979362422864395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4138207645746138027.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 ...327
Loading property file /tmp/ReachabilityCardinality4138207645746138027.prop.
Interrupted probabilistic random walk after 83062 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 83062 steps, saw 29184 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-21 00:37:37] [INFO ] Invariant cache hit.
[2024-05-21 00:37:37] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:37:37] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:37:40] [INFO ] Deduced a trap composed of 65 places in 2929 ms of which 18 ms to minimize.
[2024-05-21 00:37:43] [INFO ] Deduced a trap composed of 66 places in 2856 ms of which 17 ms to minimize.
SMT process timed out in 6639ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 391 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 765 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84954 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 84954 steps, saw 29486 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 00:37:47] [INFO ] Invariant cache hit.
[2024-05-21 00:37:47] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:37:47] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:37:51] [INFO ] Deduced a trap composed of 60 places in 2956 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8333 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:37:56] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:37:59] [INFO ] Deduced a trap composed of 103 places in 2996 ms of which 18 ms to minimize.
[2024-05-21 00:38:02] [INFO ] Deduced a trap composed of 65 places in 2805 ms of which 19 ms to minimize.
[2024-05-21 00:38:05] [INFO ] Deduced a trap composed of 59 places in 2754 ms of which 17 ms to minimize.
[2024-05-21 00:38:07] [INFO ] Deduced a trap composed of 65 places in 2718 ms of which 16 ms to minimize.
[2024-05-21 00:38:10] [INFO ] Deduced a trap composed of 60 places in 2643 ms of which 17 ms to minimize.
[2024-05-21 00:38:13] [INFO ] Deduced a trap composed of 56 places in 2634 ms of which 17 ms to minimize.
[2024-05-21 00:38:15] [INFO ] Deduced a trap composed of 60 places in 2611 ms of which 16 ms to minimize.
[2024-05-21 00:38:18] [INFO ] Deduced a trap composed of 57 places in 2624 ms of which 16 ms to minimize.
[2024-05-21 00:38:21] [INFO ] Deduced a trap composed of 89 places in 2638 ms of which 16 ms to minimize.
[2024-05-21 00:38:23] [INFO ] Deduced a trap composed of 67 places in 2607 ms of which 16 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:38:24] [INFO ] Flatten gal took : 198 ms
[2024-05-21 00:38:24] [INFO ] Applying decomposition
[2024-05-21 00:38:24] [INFO ] Flatten gal took : 203 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/graph10782749302089533124.txt' '-o' '/tmp/graph10782749302089533124.bin' '-w' '/tmp/graph10782749302089533124.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10782749302089533124.bin' '-l' '-1' '-v' '-w' '/tmp/graph10782749302089533124.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:38:25] [INFO ] Decomposing Gal with order
[2024-05-21 00:38:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:38:25] [INFO ] Removed a total of 7716 redundant transitions.
[2024-05-21 00:38:25] [INFO ] Flatten gal took : 669 ms
[2024-05-21 00:38:26] [INFO ] Deduced a trap composed of 90 places in 2562 ms of which 15 ms to minimize.
[2024-05-21 00:38:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 9850 labels/synchronizations in 498 ms.
[2024-05-21 00:38:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9569077036431886475.gal : 60 ms
[2024-05-21 00:38:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10393381624353235087.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/ReachabilityCardinality9569077036431886475.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10393381624353235087.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/ReachabilityCardinality10393381624353235087.prop.
[2024-05-21 00:38:29] [INFO ] Deduced a trap composed of 77 places in 2607 ms of which 17 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6519
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6519 after 6519
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6519 after 6519
[2024-05-21 00:38:31] [INFO ] Deduced a trap composed of 63 places in 2608 ms of which 16 ms to minimize.
[2024-05-21 00:38:34] [INFO ] Deduced a trap composed of 62 places in 2659 ms of which 16 ms to minimize.
[2024-05-21 00:38:37] [INFO ] Deduced a trap composed of 68 places in 2621 ms of which 16 ms to minimize.
[2024-05-21 00:38:39] [INFO ] Deduced a trap composed of 68 places in 2586 ms of which 16 ms to minimize.
[2024-05-21 00:38:42] [INFO ] Deduced a trap composed of 69 places in 2567 ms of which 18 ms to minimize.
SMT process timed out in 54934ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 532 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 396 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:38:43] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6519 after 25382
[2024-05-21 00:38:46] [INFO ] Implicit Places using invariants in 3609 ms returned []
Implicit Place search using SMT only with invariants took 3612 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:38:47] [INFO ] Invariant cache hit.
[2024-05-21 00:38:47] [INFO ] State equation strengthened by 10007 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42799ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42879ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46900 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-02 in 286493 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:39:30] [INFO ] Computed 52 invariants in 379 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 149 ms. (66 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-21 00:39:30] [INFO ] Invariant cache hit.
[2024-05-21 00:39:30] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 00:39:30] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:39:32] [INFO ] [Real]Absence check using state equation in 1969 ms returned sat
[2024-05-21 00:39:32] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:39:33] [INFO ] [Real]Added 9984 Read/Feed constraints in 831 ms returned sat
[2024-05-21 00:39:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:39:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:39:34] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:39:36] [INFO ] [Nat]Absence check using state equation in 2046 ms returned sat
[2024-05-21 00:39:37] [INFO ] [Nat]Added 9984 Read/Feed constraints in 795 ms returned sat
[2024-05-21 00:39:37] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 513 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1036 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 00:39:40] [INFO ] Computed 52 invariants in 339 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4346 resets) in 14688 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1472 ms. (678 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:39:56] [INFO ] Invariant cache hit.
[2024-05-21 00:39:56] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 00:39:56] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:39:58] [INFO ] [Real]Absence check using state equation in 1992 ms returned sat
[2024-05-21 00:39:59] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:40:00] [INFO ] [Real]Added 10007 Read/Feed constraints in 825 ms returned sat
[2024-05-21 00:40:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:40:00] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:40:00] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:40:02] [INFO ] [Nat]Absence check using state equation in 1986 ms returned sat
[2024-05-21 00:40:03] [INFO ] [Nat]Added 10007 Read/Feed constraints in 925 ms returned sat
[2024-05-21 00:40:04] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 484 ms.
[2024-05-21 00:40:05] [INFO ] Added : 9 causal constraints over 2 iterations in 1950 ms. Result :sat
Minimization took 5994 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 395 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 387 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:40:12] [INFO ] Invariant cache hit.
[2024-05-21 00:40:15] [INFO ] Implicit Places using invariants in 3449 ms returned []
Implicit Place search using SMT only with invariants took 3454 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:40:15] [INFO ] Invariant cache hit.
[2024-05-21 00:40:15] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42787ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46718 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 00:40:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4353 resets) in 14445 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1454 ms. (687 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:41:14] [INFO ] Invariant cache hit.
[2024-05-21 00:41:14] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:41:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:41:16] [INFO ] [Real]Absence check using state equation in 1939 ms returned sat
[2024-05-21 00:41:17] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:41:17] [INFO ] [Real]Added 10007 Read/Feed constraints in 793 ms returned sat
[2024-05-21 00:41:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:41:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:41:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:41:20] [INFO ] [Nat]Absence check using state equation in 1980 ms returned sat
[2024-05-21 00:41:21] [INFO ] [Nat]Added 10007 Read/Feed constraints in 924 ms returned sat
[2024-05-21 00:41:21] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 494 ms.
[2024-05-21 00:41:23] [INFO ] Added : 9 causal constraints over 2 iterations in 1924 ms. Result :sat
Minimization took 5816 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 409 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 386 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:41:30] [INFO ] Invariant cache hit.
[2024-05-21 00:41:33] [INFO ] Implicit Places using invariants in 3571 ms returned []
Implicit Place search using SMT only with invariants took 3572 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:41:33] [INFO ] Invariant cache hit.
[2024-05-21 00:41:33] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42630ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42709ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46679 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (173 resets) in 1066 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2024-05-21 00:42:16] [INFO ] Flatten gal took : 400 ms
[2024-05-21 00:42:17] [INFO ] Flatten gal took : 252 ms
[2024-05-21 00:42:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8866948412601531216.gal : 39 ms
[2024-05-21 00:42:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7556050368821614560.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/ReachabilityCardinality8866948412601531216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7556050368821614560.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 ...328
Loading property file /tmp/ReachabilityCardinality7556050368821614560.prop.
Interrupted probabilistic random walk after 82511 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82511 steps, saw 29075 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-21 00:42:19] [INFO ] Invariant cache hit.
[2024-05-21 00:42:19] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:42:20] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:42:23] [INFO ] Deduced a trap composed of 65 places in 3082 ms of which 19 ms to minimize.
[2024-05-21 00:42:26] [INFO ] Deduced a trap composed of 66 places in 2974 ms of which 18 ms to minimize.
SMT process timed out in 6913ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 379 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (173 resets) in 737 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84521 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 84521 steps, saw 29402 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 00:42:30] [INFO ] Invariant cache hit.
[2024-05-21 00:42:30] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:42:30] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:42:34] [INFO ] Deduced a trap composed of 89 places in 2935 ms of which 17 ms to minimize.
[2024-05-21 00:42:36] [INFO ] Deduced a trap composed of 61 places in 2662 ms of which 17 ms to minimize.
[2024-05-21 00:42:39] [INFO ] Deduced a trap composed of 60 places in 2753 ms of which 17 ms to minimize.
[2024-05-21 00:42:42] [INFO ] Deduced a trap composed of 57 places in 2746 ms of which 17 ms to minimize.
[2024-05-21 00:42:45] [INFO ] Deduced a trap composed of 59 places in 2655 ms of which 17 ms to minimize.
[2024-05-21 00:42:47] [INFO ] Deduced a trap composed of 60 places in 2668 ms of which 16 ms to minimize.
[2024-05-21 00:42:50] [INFO ] Deduced a trap composed of 64 places in 2605 ms of which 17 ms to minimize.
[2024-05-21 00:42:53] [INFO ] Deduced a trap composed of 79 places in 2536 ms of which 16 ms to minimize.
[2024-05-21 00:42:55] [INFO ] Deduced a trap composed of 59 places in 2527 ms of which 16 ms to minimize.
[2024-05-21 00:42:58] [INFO ] Deduced a trap composed of 64 places in 2542 ms of which 16 ms to minimize.
[2024-05-21 00:43:00] [INFO ] Deduced a trap composed of 80 places in 2450 ms of which 16 ms to minimize.
[2024-05-21 00:43:03] [INFO ] Deduced a trap composed of 78 places in 2494 ms of which 16 ms to minimize.
[2024-05-21 00:43:05] [INFO ] Deduced a trap composed of 77 places in 2489 ms of which 16 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:43:07] [INFO ] Flatten gal took : 199 ms
[2024-05-21 00:43:07] [INFO ] Applying decomposition
[2024-05-21 00:43:07] [INFO ] Flatten gal took : 203 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/graph9212382870589258089.txt' '-o' '/tmp/graph9212382870589258089.bin' '-w' '/tmp/graph9212382870589258089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9212382870589258089.bin' '-l' '-1' '-v' '-w' '/tmp/graph9212382870589258089.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:43:07] [INFO ] Decomposing Gal with order
[2024-05-21 00:43:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:43:08] [INFO ] Deduced a trap composed of 68 places in 2405 ms of which 16 ms to minimize.
[2024-05-21 00:43:08] [INFO ] Removed a total of 7716 redundant transitions.
[2024-05-21 00:43:08] [INFO ] Flatten gal took : 601 ms
[2024-05-21 00:43:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 9658 labels/synchronizations in 461 ms.
[2024-05-21 00:43:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10745564129860916576.gal : 60 ms
[2024-05-21 00:43:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10870260058310030374.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/ReachabilityCardinality10745564129860916576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10870260058310030374.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 ...309
[2024-05-21 00:43:10] [INFO ] Deduced a trap composed of 65 places in 2197 ms of which 16 ms to minimize.
Loading property file /tmp/ReachabilityCardinality10870260058310030374.prop.
[2024-05-21 00:43:12] [INFO ] Deduced a trap composed of 63 places in 2244 ms of which 16 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2258
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2258 after 2258
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2258 after 2258
[2024-05-21 00:43:15] [INFO ] Deduced a trap composed of 64 places in 2254 ms of which 15 ms to minimize.
[2024-05-21 00:43:17] [INFO ] Deduced a trap composed of 73 places in 2378 ms of which 15 ms to minimize.
SMT process timed out in 47095ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 407 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 410 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:43:18] [INFO ] Invariant cache hit.
[2024-05-21 00:43:21] [INFO ] Implicit Places using invariants in 3656 ms returned []
Implicit Place search using SMT only with invariants took 3657 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:43:22] [INFO ] Invariant cache hit.
[2024-05-21 00:43:22] [INFO ] State equation strengthened by 10007 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2258 after 2.07338e+06
Detected timeout of ITS tools.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43513ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43610ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47693 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-03 in 275717 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:44:05] [INFO ] Computed 52 invariants in 381 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 177 ms. (56 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:44:06] [INFO ] Invariant cache hit.
[2024-05-21 00:44:06] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:44:06] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:44:08] [INFO ] [Real]Absence check using state equation in 2112 ms returned sat
[2024-05-21 00:44:08] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:44:09] [INFO ] [Real]Added 9984 Read/Feed constraints in 899 ms returned sat
[2024-05-21 00:44:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:44:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:44:10] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:44:12] [INFO ] [Nat]Absence check using state equation in 2126 ms returned sat
[2024-05-21 00:44:13] [INFO ] [Nat]Added 9984 Read/Feed constraints in 868 ms returned sat
[2024-05-21 00:44:14] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 568 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1070 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1071 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 00:44:16] [INFO ] Computed 52 invariants in 335 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4352 resets) in 16810 ms. (59 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1472 ms. (678 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:44:34] [INFO ] Invariant cache hit.
[2024-05-21 00:44:35] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:44:35] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:44:37] [INFO ] [Real]Absence check using state equation in 1981 ms returned sat
[2024-05-21 00:44:37] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:44:38] [INFO ] [Real]Added 10007 Read/Feed constraints in 819 ms returned sat
[2024-05-21 00:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:44:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:44:38] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:44:40] [INFO ] [Nat]Absence check using state equation in 1989 ms returned sat
[2024-05-21 00:44:41] [INFO ] [Nat]Added 10007 Read/Feed constraints in 947 ms returned sat
[2024-05-21 00:44:42] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 492 ms.
[2024-05-21 00:44:43] [INFO ] Added : 10 causal constraints over 2 iterations in 2009 ms. Result :sat
Minimization took 5968 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 397 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 385 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:44:50] [INFO ] Invariant cache hit.
[2024-05-21 00:44:54] [INFO ] Implicit Places using invariants in 3606 ms returned []
Implicit Place search using SMT only with invariants took 3606 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:44:54] [INFO ] Invariant cache hit.
[2024-05-21 00:44:54] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42759ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46841 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 00:45:37] [INFO ] Flatten gal took : 305 ms
RANDOM walk for 40000 steps (172 resets) in 1274 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2024-05-21 00:45:37] [INFO ] Flatten gal took : 195 ms
[2024-05-21 00:45:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4311702931740251226.gal : 32 ms
[2024-05-21 00:45:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11238937507790342610.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/ReachabilityCardinality4311702931740251226.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11238937507790342610.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/ReachabilityCardinality11238937507790342610.prop.
Interrupted probabilistic random walk after 83234 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 83234 steps, saw 29214 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-21 00:45:40] [INFO ] Invariant cache hit.
[2024-05-21 00:45:40] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:45:41] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:45:44] [INFO ] Deduced a trap composed of 65 places in 3002 ms of which 18 ms to minimize.
[2024-05-21 00:45:47] [INFO ] Deduced a trap composed of 66 places in 2871 ms of which 21 ms to minimize.
SMT process timed out in 6726ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 388 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 835 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 87137 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 87137 steps, saw 29784 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-21 00:45:51] [INFO ] Invariant cache hit.
[2024-05-21 00:45:51] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:45:51] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:45:54] [INFO ] Deduced a trap composed of 63 places in 2903 ms of which 18 ms to minimize.
[2024-05-21 00:45:57] [INFO ] Deduced a trap composed of 58 places in 2961 ms of which 17 ms to minimize.
[2024-05-21 00:45:57] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12866 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11587 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:46:03] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:46:06] [INFO ] Deduced a trap composed of 102 places in 3024 ms of which 18 ms to minimize.
[2024-05-21 00:46:09] [INFO ] Deduced a trap composed of 64 places in 2923 ms of which 16 ms to minimize.
[2024-05-21 00:46:12] [INFO ] Deduced a trap composed of 65 places in 2910 ms of which 18 ms to minimize.
[2024-05-21 00:46:15] [INFO ] Deduced a trap composed of 65 places in 2853 ms of which 18 ms to minimize.
[2024-05-21 00:46:18] [INFO ] Deduced a trap composed of 68 places in 2851 ms of which 18 ms to minimize.
[2024-05-21 00:46:21] [INFO ] Deduced a trap composed of 92 places in 2972 ms of which 17 ms to minimize.
[2024-05-21 00:46:24] [INFO ] Deduced a trap composed of 105 places in 2883 ms of which 18 ms to minimize.
[2024-05-21 00:46:27] [INFO ] Deduced a trap composed of 97 places in 3019 ms of which 18 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:46:27] [INFO ] Flatten gal took : 189 ms
[2024-05-21 00:46:27] [INFO ] Applying decomposition
[2024-05-21 00:46:28] [INFO ] Flatten gal took : 198 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/graph11637185221898509212.txt' '-o' '/tmp/graph11637185221898509212.bin' '-w' '/tmp/graph11637185221898509212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11637185221898509212.bin' '-l' '-1' '-v' '-w' '/tmp/graph11637185221898509212.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:46:28] [INFO ] Decomposing Gal with order
[2024-05-21 00:46:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:46:29] [INFO ] Removed a total of 7716 redundant transitions.
[2024-05-21 00:46:29] [INFO ] Flatten gal took : 591 ms
[2024-05-21 00:46:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 9658 labels/synchronizations in 467 ms.
[2024-05-21 00:46:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10908169155212484245.gal : 61 ms
[2024-05-21 00:46:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18088177669671240561.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/ReachabilityCardinality10908169155212484245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18088177669671240561.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 ...309
[2024-05-21 00:46:30] [INFO ] Deduced a trap composed of 67 places in 2934 ms of which 18 ms to minimize.
Loading property file /tmp/ReachabilityCardinality18088177669671240561.prop.
[2024-05-21 00:46:33] [INFO ] Deduced a trap composed of 69 places in 3039 ms of which 18 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 188
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :188 after 188
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :188 after 229
[2024-05-21 00:46:36] [INFO ] Deduced a trap composed of 64 places in 2968 ms of which 18 ms to minimize.
[2024-05-21 00:46:39] [INFO ] Deduced a trap composed of 64 places in 2873 ms of which 17 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :229 after 35508
[2024-05-21 00:46:41] [INFO ] Deduced a trap composed of 94 places in 2840 ms of which 17 ms to minimize.
[2024-05-21 00:46:44] [INFO ] Deduced a trap composed of 67 places in 2676 ms of which 17 ms to minimize.
[2024-05-21 00:46:47] [INFO ] Deduced a trap composed of 79 places in 2755 ms of which 18 ms to minimize.
[2024-05-21 00:46:50] [INFO ] Deduced a trap composed of 61 places in 2691 ms of which 17 ms to minimize.
SMT process timed out in 59194ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 405 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 386 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:46:51] [INFO ] Invariant cache hit.
[2024-05-21 00:46:54] [INFO ] Implicit Places using invariants in 3549 ms returned []
Implicit Place search using SMT only with invariants took 3549 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:46:54] [INFO ] Invariant cache hit.
[2024-05-21 00:46:54] [INFO ] State equation strengthened by 10007 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 0.0)
(s1831 0.0)
(s1832 0.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 0.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 0.0)
(s1850 0.0)
(s1851 0.0)
(s1852 0.0)
(s1853 0.0)
(s1854 0.0)
(s1855 0.0)
(s1856 1.0)
(s1857 0.0)
(s1858 0.0)
(s1859 0.0)
(s1860 0.0)
(s1861 0.0)
(s1862 0.0)
(s1863 0.0)
(s1864 0.0)
(s1865 0.0)
(s1866 0.0)
(s1867 0.0)
(s1868 0.0)
(s1869 0.0)
(s1870 0.0)
(s1871 0.0)
(s1872 1.0)
(s1873 0.0)
(s1874 0.0)
(s1875 0.0)
(s1876 0.0)
(s1877 1.0)
(s1878 0.0)
(s1879 timeout
0.0)
(s1880 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42953ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43031ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46978 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-04 in 212068 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:47:37] [INFO ] Computed 52 invariants in 378 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 145 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-21 00:47:38] [INFO ] Invariant cache hit.
[2024-05-21 00:47:38] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:47:38] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-21 00:47:40] [INFO ] [Real]Absence check using state equation in 2076 ms returned sat
[2024-05-21 00:47:40] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:47:41] [INFO ] [Real]Added 9984 Read/Feed constraints in 845 ms returned sat
[2024-05-21 00:47:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:47:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:47:42] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:47:44] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2024-05-21 00:47:44] [INFO ] [Nat]Added 9984 Read/Feed constraints in 756 ms returned sat
[2024-05-21 00:47:45] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 499 ms.
[2024-05-21 00:47:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1194 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1195 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 00:47:48] [INFO ] Computed 52 invariants in 328 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4348 resets) in 14808 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1485 ms. (672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:48:04] [INFO ] Invariant cache hit.
[2024-05-21 00:48:05] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:48:05] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:48:07] [INFO ] [Real]Absence check using state equation in 1961 ms returned sat
[2024-05-21 00:48:07] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:48:08] [INFO ] [Real]Added 10007 Read/Feed constraints in 825 ms returned sat
[2024-05-21 00:48:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:48:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 00:48:08] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:48:10] [INFO ] [Nat]Absence check using state equation in 1992 ms returned sat
[2024-05-21 00:48:11] [INFO ] [Nat]Added 10007 Read/Feed constraints in 916 ms returned sat
[2024-05-21 00:48:12] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 494 ms.
[2024-05-21 00:48:13] [INFO ] Added : 8 causal constraints over 2 iterations in 2118 ms. Result :sat
Minimization took 5929 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 387 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 391 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:48:20] [INFO ] Invariant cache hit.
[2024-05-21 00:48:24] [INFO ] Implicit Places using invariants in 3676 ms returned []
Implicit Place search using SMT only with invariants took 3677 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:48:24] [INFO ] Invariant cache hit.
[2024-05-21 00:48:24] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43333ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47494 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 00:49:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4348 resets) in 14740 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (67 resets) in 1486 ms. (672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:49:23] [INFO ] Invariant cache hit.
[2024-05-21 00:49:24] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:49:24] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:49:26] [INFO ] [Real]Absence check using state equation in 1954 ms returned sat
[2024-05-21 00:49:26] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:49:27] [INFO ] [Real]Added 10007 Read/Feed constraints in 836 ms returned sat
[2024-05-21 00:49:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:49:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:49:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 00:49:29] [INFO ] [Nat]Absence check using state equation in 1986 ms returned sat
[2024-05-21 00:49:30] [INFO ] [Nat]Added 10007 Read/Feed constraints in 931 ms returned sat
[2024-05-21 00:49:31] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 484 ms.
[2024-05-21 00:49:32] [INFO ] Added : 8 causal constraints over 2 iterations in 2017 ms. Result :sat
Minimization took 5865 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 392 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 381 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:49:39] [INFO ] Invariant cache hit.
[2024-05-21 00:49:43] [INFO ] Implicit Places using invariants in 3561 ms returned []
Implicit Place search using SMT only with invariants took 3561 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:49:43] [INFO ] Invariant cache hit.
[2024-05-21 00:49:43] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)timeout

(s380 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43455ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47488 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 00:50:26] [INFO ] Flatten gal took : 251 ms
RANDOM walk for 40000 steps (172 resets) in 1358 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2024-05-21 00:50:27] [INFO ] Flatten gal took : 285 ms
[2024-05-21 00:50:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10140211618979429488.gal : 31 ms
[2024-05-21 00:50:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6911301919606974348.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/ReachabilityCardinality10140211618979429488.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6911301919606974348.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/ReachabilityCardinality6911301919606974348.prop.
Interrupted probabilistic random walk after 82491 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82491 steps, saw 30035 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-21 00:50:30] [INFO ] Invariant cache hit.
[2024-05-21 00:50:30] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:50:30] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:50:33] [INFO ] Deduced a trap composed of 65 places in 2966 ms of which 18 ms to minimize.
[2024-05-21 00:50:36] [INFO ] Deduced a trap composed of 66 places in 2883 ms of which 20 ms to minimize.
SMT process timed out in 6674ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 426 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 920 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 85768 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 85768 steps, saw 30500 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 00:50:40] [INFO ] Invariant cache hit.
[2024-05-21 00:50:40] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:50:41] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:50:44] [INFO ] Deduced a trap composed of 60 places in 3012 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9801 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:50:50] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:50:54] [INFO ] Deduced a trap composed of 102 places in 3000 ms of which 18 ms to minimize.
[2024-05-21 00:50:57] [INFO ] Deduced a trap composed of 64 places in 2833 ms of which 18 ms to minimize.
[2024-05-21 00:51:00] [INFO ] Deduced a trap composed of 65 places in 2922 ms of which 18 ms to minimize.
[2024-05-21 00:51:02] [INFO ] Deduced a trap composed of 65 places in 2858 ms of which 18 ms to minimize.
[2024-05-21 00:51:05] [INFO ] Deduced a trap composed of 68 places in 2845 ms of which 17 ms to minimize.
[2024-05-21 00:51:08] [INFO ] Deduced a trap composed of 92 places in 2936 ms of which 17 ms to minimize.
[2024-05-21 00:51:11] [INFO ] Deduced a trap composed of 64 places in 2895 ms of which 18 ms to minimize.
[2024-05-21 00:51:14] [INFO ] Deduced a trap composed of 64 places in 2891 ms of which 18 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:51:17] [INFO ] Deduced a trap composed of 63 places in 2809 ms of which 17 ms to minimize.
[2024-05-21 00:51:17] [INFO ] Flatten gal took : 199 ms
[2024-05-21 00:51:17] [INFO ] Applying decomposition
[2024-05-21 00:51:17] [INFO ] Flatten gal took : 212 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/graph6039904147787429350.txt' '-o' '/tmp/graph6039904147787429350.bin' '-w' '/tmp/graph6039904147787429350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6039904147787429350.bin' '-l' '-1' '-v' '-w' '/tmp/graph6039904147787429350.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:51:18] [INFO ] Decomposing Gal with order
[2024-05-21 00:51:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:51:18] [INFO ] Removed a total of 7716 redundant transitions.
[2024-05-21 00:51:18] [INFO ] Flatten gal took : 594 ms
[2024-05-21 00:51:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 9658 labels/synchronizations in 485 ms.
[2024-05-21 00:51:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12528799513336096233.gal : 50 ms
[2024-05-21 00:51:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality71849861605032655.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/ReachabilityCardinality12528799513336096233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality71849861605032655.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 ...306
[2024-05-21 00:51:20] [INFO ] Deduced a trap composed of 63 places in 2846 ms of which 17 ms to minimize.
Loading property file /tmp/ReachabilityCardinality71849861605032655.prop.
[2024-05-21 00:51:23] [INFO ] Deduced a trap composed of 63 places in 2763 ms of which 19 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6959
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6959 after 6959
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6959 after 7096
[2024-05-21 00:51:26] [INFO ] Deduced a trap composed of 62 places in 2860 ms of which 18 ms to minimize.
[2024-05-21 00:51:29] [INFO ] Deduced a trap composed of 63 places in 2937 ms of which 18 ms to minimize.
[2024-05-21 00:51:32] [INFO ] Deduced a trap composed of 66 places in 2975 ms of which 18 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7096 after 26603
[2024-05-21 00:51:35] [INFO ] Deduced a trap composed of 65 places in 2914 ms of which 18 ms to minimize.
[2024-05-21 00:51:38] [INFO ] Deduced a trap composed of 64 places in 2935 ms of which 18 ms to minimize.
SMT process timed out in 57327ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 401 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 393 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:51:38] [INFO ] Invariant cache hit.
[2024-05-21 00:51:42] [INFO ] Implicit Places using invariants in 3603 ms returned []
Implicit Place search using SMT only with invariants took 3604 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 00:51:42] [INFO ] Invariant cache hit.
[2024-05-21 00:51:42] [INFO ] State equation strengthened by 10007 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43607ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43728ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47740 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-05 in 288568 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:52:26] [INFO ] Computed 52 invariants in 406 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:52:26] [INFO ] Invariant cache hit.
[2024-05-21 00:52:27] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 00:52:27] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 00:52:29] [INFO ] [Real]Absence check using state equation in 1942 ms returned sat
[2024-05-21 00:52:29] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:52:30] [INFO ] [Real]Added 9984 Read/Feed constraints in 884 ms returned sat
[2024-05-21 00:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:52:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 00:52:30] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-21 00:52:32] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2024-05-21 00:52:33] [INFO ] [Nat]Added 9984 Read/Feed constraints in 881 ms returned sat
[2024-05-21 00:52:34] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 564 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 2802 transition count 10158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2802 transition count 10158
Applied a total of 26 rules in 1157 ms. Remains 2802 /2814 variables (removed 12) and now considering 10158/10170 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1157 ms. Remains : 2802/2814 places, 10158/10170 transitions.
// Phase 1: matrix 10158 rows 2802 cols
[2024-05-21 00:52:36] [INFO ] Computed 52 invariants in 341 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4346 resets) in 15338 ms. (65 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1494 ms. (668 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:52:53] [INFO ] Invariant cache hit.
[2024-05-21 00:52:54] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:52:54] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:52:56] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2024-05-21 00:52:56] [INFO ] State equation strengthened by 10008 read => feed constraints.
[2024-05-21 00:52:57] [INFO ] [Real]Added 10008 Read/Feed constraints in 963 ms returned sat
[2024-05-21 00:52:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:52:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:52:57] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:53:00] [INFO ] [Nat]Absence check using state equation in 2169 ms returned sat
[2024-05-21 00:53:00] [INFO ] [Nat]Added 10008 Read/Feed constraints in 802 ms returned sat
[2024-05-21 00:53:01] [INFO ] Computed and/alt/rep : 7364/19588/7364 causal constraints (skipped 2744 transitions) in 506 ms.
[2024-05-21 00:53:02] [INFO ] Added : 5 causal constraints over 1 iterations in 1446 ms. Result :sat
Minimization took 5855 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 439 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 388 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-21 00:53:09] [INFO ] Invariant cache hit.
[2024-05-21 00:53:12] [INFO ] Implicit Places using invariants in 3584 ms returned []
Implicit Place search using SMT only with invariants took 3586 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-21 00:53:12] [INFO ] Invariant cache hit.
[2024-05-21 00:53:12] [INFO ] State equation strengthened by 10008 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10108 unsolved
SMT process timed out in 43741ms, After SMT, problems are : Problem set: 0 solved, 10108 unsolved
Search for dead transitions found 0 dead transitions in 43820ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47806 ms. Remains : 2802/2802 places, 10158/10158 transitions.
[2024-05-21 00:53:56] [INFO ] Flatten gal took : 291 ms
RANDOM walk for 40000 steps (171 resets) in 1423 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2024-05-21 00:53:57] [INFO ] Flatten gal took : 207 ms
[2024-05-21 00:53:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6550590880102402506.gal : 32 ms
[2024-05-21 00:53:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14977530565571661212.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/ReachabilityCardinality6550590880102402506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14977530565571661212.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/ReachabilityCardinality14977530565571661212.prop.
Interrupted probabilistic random walk after 79670 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 79670 steps, saw 28796 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-21 00:54:00] [INFO ] Invariant cache hit.
[2024-05-21 00:54:00] [INFO ] State equation strengthened by 10008 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) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:54:00] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:54:03] [INFO ] Deduced a trap composed of 59 places in 2980 ms of which 19 ms to minimize.
[2024-05-21 00:54:06] [INFO ] Deduced a trap composed of 60 places in 2987 ms of which 18 ms to minimize.
SMT process timed out in 6864ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 417 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 2802/2802 places, 10158/10158 transitions.
RANDOM walk for 40000 steps (173 resets) in 1091 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84933 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 84933 steps, saw 29477 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 00:54:10] [INFO ] Invariant cache hit.
[2024-05-21 00:54:10] [INFO ] State equation strengthened by 10008 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) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:54:11] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:54:14] [INFO ] Deduced a trap composed of 76 places in 2997 ms of which 17 ms to minimize.
[2024-05-21 00:54:17] [INFO ] Deduced a trap composed of 68 places in 2800 ms of which 17 ms to minimize.
[2024-05-21 00:54:20] [INFO ] Deduced a trap composed of 56 places in 2692 ms of which 17 ms to minimize.
[2024-05-21 00:54:23] [INFO ] Deduced a trap composed of 78 places in 2771 ms of which 18 ms to minimize.
[2024-05-21 00:54:25] [INFO ] Deduced a trap composed of 55 places in 2868 ms of which 16 ms to minimize.
[2024-05-21 00:54:28] [INFO ] Deduced a trap composed of 55 places in 2572 ms of which 16 ms to minimize.
[2024-05-21 00:54:31] [INFO ] Deduced a trap composed of 89 places in 2535 ms of which 16 ms to minimize.
[2024-05-21 00:54:33] [INFO ] Deduced a trap composed of 83 places in 2511 ms of which 16 ms to minimize.
[2024-05-21 00:54:36] [INFO ] Deduced a trap composed of 73 places in 2492 ms of which 15 ms to minimize.
[2024-05-21 00:54:38] [INFO ] Deduced a trap composed of 60 places in 2401 ms of which 16 ms to minimize.
[2024-05-21 00:54:41] [INFO ] Deduced a trap composed of 55 places in 2490 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2800 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2800 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10158/12958 variables, 2800/2864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12958 variables, 10008/12872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12958 variables, 0/12872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12960 variables, 2/12874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12960 variables, 0/12874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12960 variables, 0/12874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12960/12960 variables, and 12874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36025 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2802/2802 constraints, ReadFeed: 10008/10008 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 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) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
[2024-05-21 00:54:47] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:54:47] [INFO ] Flatten gal took : 195 ms
[2024-05-21 00:54:47] [INFO ] Applying decomposition
At refinement iteration 5 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2800 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:54:47] [INFO ] Flatten gal took : 212 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/graph15066639870355036848.txt' '-o' '/tmp/graph15066639870355036848.bin' '-w' '/tmp/graph15066639870355036848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15066639870355036848.bin' '-l' '-1' '-v' '-w' '/tmp/graph15066639870355036848.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:54:48] [INFO ] Decomposing Gal with order
[2024-05-21 00:54:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:54:48] [INFO ] Removed a total of 7717 redundant transitions.
[2024-05-21 00:54:48] [INFO ] Flatten gal took : 619 ms
[2024-05-21 00:54:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 9752 labels/synchronizations in 462 ms.
[2024-05-21 00:54:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15549057560826980204.gal : 65 ms
[2024-05-21 00:54:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2632552037966946114.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/ReachabilityCardinality15549057560826980204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2632552037966946114.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
[2024-05-21 00:54:50] [INFO ] Deduced a trap composed of 70 places in 2999 ms of which 19 ms to minimize.
Loading property file /tmp/ReachabilityCardinality2632552037966946114.prop.
[2024-05-21 00:54:53] [INFO ] Deduced a trap composed of 66 places in 2974 ms of which 18 ms to minimize.
[2024-05-21 00:54:53] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6722
At refinement iteration 9 (INCLUDED_ONLY) 0/2800 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6722 after 6722
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6722 after 6722
At refinement iteration 10 (INCLUDED_ONLY) 0/2800 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6722 after 6722
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6722 after 6722
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6722 after 6722
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6722 after 6722
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6722 after 6722
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6722 after 6749
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6749 after 6762
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6762 after 6775
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6775 after 6796
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6796 after 6844
At refinement iteration 11 (OVERLAPS) 10158/12958 variables, 2800/2868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12958 variables, 10008/12876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12958 variables, 1/12877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12958 variables, 0/12877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/12960 variables, 2/12879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/12960 variables, 0/12879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/12960 variables, 0/12879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12960/12960 variables, and 12879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14250 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2802/2802 constraints, ReadFeed: 10008/10008 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 50383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 409 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 387 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-21 00:55:02] [INFO ] Invariant cache hit.
[2024-05-21 00:55:05] [INFO ] Implicit Places using invariants in 3732 ms returned []
Implicit Place search using SMT only with invariants took 3748 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-21 00:55:05] [INFO ] Invariant cache hit.
[2024-05-21 00:55:05] [INFO ] State equation strengthened by 10008 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6844 after 25106
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10108 unsolved
SMT process timed out in 43972ms, After SMT, problems are : Problem set: 0 solved, 10108 unsolved
Search for dead transitions found 0 dead transitions in 44050ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48213 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-06 in 203686 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:55:50] [INFO ] Computed 52 invariants in 381 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:55:50] [INFO ] Invariant cache hit.
[2024-05-21 00:55:50] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:55:50] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:55:52] [INFO ] [Real]Absence check using state equation in 2007 ms returned sat
[2024-05-21 00:55:53] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:55:53] [INFO ] [Real]Added 9984 Read/Feed constraints in 846 ms returned sat
[2024-05-21 00:55:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:55:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-21 00:55:54] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 00:55:56] [INFO ] [Nat]Absence check using state equation in 2299 ms returned sat
[2024-05-21 00:55:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 00:55:57] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1108 ms returned sat
[2024-05-21 00:55:58] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 499 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 2802 transition count 10158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2802 transition count 10158
Applied a total of 26 rules in 1166 ms. Remains 2802 /2814 variables (removed 12) and now considering 10158/10170 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1167 ms. Remains : 2802/2814 places, 10158/10170 transitions.
// Phase 1: matrix 10158 rows 2802 cols
[2024-05-21 00:56:00] [INFO ] Computed 52 invariants in 344 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4356 resets) in 17582 ms. (56 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1690 ms. (591 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:56:19] [INFO ] Invariant cache hit.
[2024-05-21 00:56:20] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:56:20] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 00:56:22] [INFO ] [Real]Absence check using state equation in 2019 ms returned sat
[2024-05-21 00:56:22] [INFO ] State equation strengthened by 10008 read => feed constraints.
[2024-05-21 00:56:23] [INFO ] [Real]Added 10008 Read/Feed constraints in 817 ms returned sat
[2024-05-21 00:56:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:56:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:56:24] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-21 00:56:26] [INFO ] [Nat]Absence check using state equation in 2068 ms returned sat
[2024-05-21 00:56:26] [INFO ] [Nat]Added 10008 Read/Feed constraints in 845 ms returned sat
[2024-05-21 00:56:27] [INFO ] Computed and/alt/rep : 7364/19588/7364 causal constraints (skipped 2744 transitions) in 492 ms.
[2024-05-21 00:56:29] [INFO ] Added : 6 causal constraints over 2 iterations in 1944 ms. Result :sat
Minimization took 5987 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 445 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 410 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-21 00:56:35] [INFO ] Invariant cache hit.
[2024-05-21 00:56:39] [INFO ] Implicit Places using invariants in 3781 ms returned []
Implicit Place search using SMT only with invariants took 3782 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-21 00:56:39] [INFO ] Invariant cache hit.
[2024-05-21 00:56:39] [INFO ] State equation strengthened by 10008 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10108 unsolved
SMT process timed out in 43872ms, After SMT, problems are : Problem set: 0 solved, 10108 unsolved
Search for dead transitions found 0 dead transitions in 43987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48191 ms. Remains : 2802/2802 places, 10158/10158 transitions.
[2024-05-21 00:57:24] [INFO ] Flatten gal took : 288 ms
RANDOM walk for 40000 steps (173 resets) in 1242 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
[2024-05-21 00:57:24] [INFO ] Flatten gal took : 216 ms
[2024-05-21 00:57:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality133305576388600920.gal : 35 ms
[2024-05-21 00:57:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality58968011373853436.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/ReachabilityCardinality133305576388600920.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality58968011373853436.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 ...325
Loading property file /tmp/ReachabilityCardinality58968011373853436.prop.
Interrupted probabilistic random walk after 78304 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 78304 steps, saw 28651 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-21 00:57:27] [INFO ] Invariant cache hit.
[2024-05-21 00:57:27] [INFO ] State equation strengthened by 10008 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) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 00:57:27] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 00:57:31] [INFO ] Deduced a trap composed of 64 places in 3081 ms of which 19 ms to minimize.
[2024-05-21 00:57:34] [INFO ] Deduced a trap composed of 61 places in 3053 ms of which 19 ms to minimize.
SMT process timed out in 6984ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 395 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 2802/2802 places, 10158/10158 transitions.
RANDOM walk for 40000 steps (173 resets) in 803 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 86229 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 86229 steps, saw 29645 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 00:57:37] [INFO ] Invariant cache hit.
[2024-05-21 00:57:37] [INFO ] State equation strengthened by 10008 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) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:57:38] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 00:57:41] [INFO ] Deduced a trap composed of 77 places in 3078 ms of which 19 ms to minimize.
[2024-05-21 00:57:44] [INFO ] Deduced a trap composed of 77 places in 3137 ms of which 18 ms to minimize.
[2024-05-21 00:57:48] [INFO ] Deduced a trap composed of 65 places in 3107 ms of which 19 ms to minimize.
[2024-05-21 00:57:51] [INFO ] Deduced a trap composed of 107 places in 3102 ms of which 18 ms to minimize.
[2024-05-21 00:57:54] [INFO ] Deduced a trap composed of 69 places in 2792 ms of which 18 ms to minimize.
[2024-05-21 00:57:57] [INFO ] Deduced a trap composed of 93 places in 2939 ms of which 19 ms to minimize.
[2024-05-21 00:57:59] [INFO ] Deduced a trap composed of 60 places in 2873 ms of which 18 ms to minimize.
[2024-05-21 00:58:02] [INFO ] Deduced a trap composed of 63 places in 2765 ms of which 19 ms to minimize.
[2024-05-21 00:58:05] [INFO ] Deduced a trap composed of 62 places in 2763 ms of which 18 ms to minimize.
[2024-05-21 00:58:08] [INFO ] Deduced a trap composed of 63 places in 2748 ms of which 17 ms to minimize.
[2024-05-21 00:58:11] [INFO ] Deduced a trap composed of 79 places in 2893 ms of which 18 ms to minimize.
[2024-05-21 00:58:14] [INFO ] Deduced a trap composed of 77 places in 2844 ms of which 18 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 00:58:14] [INFO ] Flatten gal took : 203 ms
[2024-05-21 00:58:14] [INFO ] Applying decomposition
[2024-05-21 00:58:14] [INFO ] Flatten gal took : 211 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/graph2474675537265242921.txt' '-o' '/tmp/graph2474675537265242921.bin' '-w' '/tmp/graph2474675537265242921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2474675537265242921.bin' '-l' '-1' '-v' '-w' '/tmp/graph2474675537265242921.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:58:15] [INFO ] Decomposing Gal with order
[2024-05-21 00:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:58:15] [INFO ] Removed a total of 7713 redundant transitions.
[2024-05-21 00:58:15] [INFO ] Flatten gal took : 601 ms
[2024-05-21 00:58:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 9556 labels/synchronizations in 488 ms.
[2024-05-21 00:58:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6287011198590777740.gal : 61 ms
[2024-05-21 00:58:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality142841559408361073.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/ReachabilityCardinality6287011198590777740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality142841559408361073.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 ...306
[2024-05-21 00:58:16] [INFO ] Deduced a trap composed of 62 places in 2741 ms of which 15 ms to minimize.
Loading property file /tmp/ReachabilityCardinality142841559408361073.prop.
[2024-05-21 00:58:19] [INFO ] Deduced a trap composed of 103 places in 2579 ms of which 17 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 112
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :112 after 112
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :112 after 112
[2024-05-21 00:58:22] [INFO ] Deduced a trap composed of 61 places in 2680 ms of which 16 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :112 after 14884
[2024-05-21 00:58:25] [INFO ] Deduced a trap composed of 61 places in 2713 ms of which 17 ms to minimize.
SMT process timed out in 47174ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 394 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 390 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-21 00:58:25] [INFO ] Invariant cache hit.
[2024-05-21 00:58:29] [INFO ] Implicit Places using invariants in 3774 ms returned []
Implicit Place search using SMT only with invariants took 3775 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-21 00:58:29] [INFO ] Invariant cache hit.
[2024-05-21 00:58:29] [INFO ] State equation strengthened by 10008 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :14884 after 2.69721e+06
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10108 unsolved
SMT process timed out in 43653ms, After SMT, problems are : Problem set: 0 solved, 10108 unsolved
Search for dead transitions found 0 dead transitions in 43737ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47918 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-07 in 203498 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 00:59:13] [INFO ] Computed 52 invariants in 378 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 151 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-21 00:59:13] [INFO ] Invariant cache hit.
[2024-05-21 00:59:14] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-21 00:59:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-21 00:59:16] [INFO ] [Real]Absence check using state equation in 2171 ms returned sat
[2024-05-21 00:59:16] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 00:59:17] [INFO ] [Real]Added 9984 Read/Feed constraints in 930 ms returned sat
[2024-05-21 00:59:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:59:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 00:59:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:59:20] [INFO ] [Nat]Absence check using state equation in 2082 ms returned sat
[2024-05-21 00:59:21] [INFO ] [Nat]Added 9984 Read/Feed constraints in 793 ms returned sat
[2024-05-21 00:59:21] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 517 ms.
[2024-05-21 00:59:22] [INFO ] Added : 1 causal constraints over 1 iterations in 1444 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1091 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1091 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 00:59:24] [INFO ] Computed 52 invariants in 360 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4350 resets) in 15197 ms. (65 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1494 ms. (668 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 00:59:41] [INFO ] Invariant cache hit.
[2024-05-21 00:59:41] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 00:59:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:59:43] [INFO ] [Real]Absence check using state equation in 1916 ms returned sat
[2024-05-21 00:59:43] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 00:59:44] [INFO ] [Real]Added 10007 Read/Feed constraints in 948 ms returned sat
[2024-05-21 00:59:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:59:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 00:59:45] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 00:59:47] [INFO ] [Nat]Absence check using state equation in 2090 ms returned sat
[2024-05-21 00:59:48] [INFO ] [Nat]Added 10007 Read/Feed constraints in 967 ms returned sat
[2024-05-21 00:59:48] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 528 ms.
[2024-05-21 00:59:50] [INFO ] Added : 9 causal constraints over 2 iterations in 2011 ms. Result :sat
Minimization took 6013 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 400 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 394 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 00:59:57] [INFO ] Invariant cache hit.
[2024-05-21 01:00:00] [INFO ] Implicit Places using invariants in 3623 ms returned []
Implicit Place search using SMT only with invariants took 3623 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 01:00:00] [INFO ] Invariant cache hit.
[2024-05-21 01:00:00] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43518ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43595ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47624 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 1098 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2024-05-21 01:00:44] [INFO ] Flatten gal took : 328 ms
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2024-05-21 01:00:45] [INFO ] Flatten gal took : 243 ms
[2024-05-21 01:00:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6778312459959117407.gal : 34 ms
[2024-05-21 01:00:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9711490310414331146.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/ReachabilityCardinality6778312459959117407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9711490310414331146.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 ...328
Loading property file /tmp/ReachabilityCardinality9711490310414331146.prop.
Interrupted probabilistic random walk after 79670 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 79670 steps, saw 28796 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-21 01:00:47] [INFO ] Invariant cache hit.
[2024-05-21 01:00:47] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:00:51] [INFO ] Deduced a trap composed of 102 places in 2994 ms of which 19 ms to minimize.
[2024-05-21 01:00:54] [INFO ] Deduced a trap composed of 84 places in 2981 ms of which 18 ms to minimize.
SMT process timed out in 6827ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 389 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (170 resets) in 786 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 86680 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 86680 steps, saw 29726 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 01:00:58] [INFO ] Invariant cache hit.
[2024-05-21 01:00:58] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:00:58] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:01:02] [INFO ] Deduced a trap composed of 60 places in 2960 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9096 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:01:07] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:01:11] [INFO ] Deduced a trap composed of 69 places in 3003 ms of which 19 ms to minimize.
[2024-05-21 01:01:14] [INFO ] Deduced a trap composed of 67 places in 2989 ms of which 19 ms to minimize.
[2024-05-21 01:01:17] [INFO ] Deduced a trap composed of 71 places in 2988 ms of which 19 ms to minimize.
[2024-05-21 01:01:20] [INFO ] Deduced a trap composed of 66 places in 3079 ms of which 19 ms to minimize.
[2024-05-21 01:01:23] [INFO ] Deduced a trap composed of 66 places in 3050 ms of which 19 ms to minimize.
[2024-05-21 01:01:26] [INFO ] Deduced a trap composed of 66 places in 3028 ms of which 19 ms to minimize.
[2024-05-21 01:01:29] [INFO ] Deduced a trap composed of 62 places in 2954 ms of which 21 ms to minimize.
[2024-05-21 01:01:32] [INFO ] Deduced a trap composed of 66 places in 2968 ms of which 19 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 01:01:35] [INFO ] Flatten gal took : 197 ms
[2024-05-21 01:01:35] [INFO ] Applying decomposition
[2024-05-21 01:01:35] [INFO ] Flatten gal took : 206 ms
[2024-05-21 01:01:35] [INFO ] Deduced a trap composed of 69 places in 3026 ms of which 17 ms to minimize.
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/graph15685059296913099090.txt' '-o' '/tmp/graph15685059296913099090.bin' '-w' '/tmp/graph15685059296913099090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15685059296913099090.bin' '-l' '-1' '-v' '-w' '/tmp/graph15685059296913099090.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:01:35] [INFO ] Decomposing Gal with order
[2024-05-21 01:01:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:01:36] [INFO ] Removed a total of 7716 redundant transitions.
[2024-05-21 01:01:36] [INFO ] Flatten gal took : 592 ms
[2024-05-21 01:01:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 9658 labels/synchronizations in 483 ms.
[2024-05-21 01:01:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4692581149963609225.gal : 66 ms
[2024-05-21 01:01:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2507305047128005523.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/ReachabilityCardinality4692581149963609225.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2507305047128005523.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
[2024-05-21 01:01:38] [INFO ] Deduced a trap composed of 75 places in 2934 ms of which 17 ms to minimize.
Loading property file /tmp/ReachabilityCardinality2507305047128005523.prop.
[2024-05-21 01:01:41] [INFO ] Deduced a trap composed of 73 places in 2884 ms of which 19 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5172
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5172 after 5172
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5172 after 5231
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5231 after 5248
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5248 after 5306
[2024-05-21 01:01:44] [INFO ] Deduced a trap composed of 73 places in 2925 ms of which 18 ms to minimize.
[2024-05-21 01:01:47] [INFO ] Deduced a trap composed of 71 places in 2907 ms of which 19 ms to minimize.
[2024-05-21 01:01:50] [INFO ] Deduced a trap composed of 73 places in 2883 ms of which 18 ms to minimize.
[2024-05-21 01:01:53] [INFO ] Deduced a trap composed of 69 places in 2864 ms of which 19 ms to minimize.
SMT process timed out in 54886ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 390 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 386 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 01:01:53] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5306 after 2.55772e+06
[2024-05-21 01:01:57] [INFO ] Implicit Places using invariants in 3734 ms returned []
Implicit Place search using SMT only with invariants took 3736 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 01:01:57] [INFO ] Invariant cache hit.
[2024-05-21 01:01:57] [INFO ] State equation strengthened by 10007 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42854ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42934ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47068 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-08 in 207277 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 01:02:41] [INFO ] Computed 52 invariants in 376 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 145 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 01:02:41] [INFO ] Invariant cache hit.
[2024-05-21 01:02:41] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 01:02:41] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 01:02:43] [INFO ] [Real]Absence check using state equation in 1927 ms returned sat
[2024-05-21 01:02:43] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 01:02:44] [INFO ] [Real]Added 9984 Read/Feed constraints in 846 ms returned sat
[2024-05-21 01:02:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:02:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 01:02:45] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 01:02:47] [INFO ] [Nat]Absence check using state equation in 1979 ms returned sat
[2024-05-21 01:02:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 01:02:48] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1061 ms returned sat
[2024-05-21 01:02:48] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 480 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1053 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 01:02:51] [INFO ] Computed 52 invariants in 338 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4351 resets) in 14618 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1567 ms. (637 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 01:03:07] [INFO ] Invariant cache hit.
[2024-05-21 01:03:07] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 01:03:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 01:03:09] [INFO ] [Real]Absence check using state equation in 2024 ms returned sat
[2024-05-21 01:03:10] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 01:03:10] [INFO ] [Real]Added 10007 Read/Feed constraints in 805 ms returned sat
[2024-05-21 01:03:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:03:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 01:03:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 01:03:13] [INFO ] [Nat]Absence check using state equation in 2010 ms returned sat
[2024-05-21 01:03:14] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1137 ms returned sat
[2024-05-21 01:03:15] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 483 ms.
[2024-05-21 01:03:17] [INFO ] Added : 11 causal constraints over 3 iterations in 2337 ms. Result :sat
Minimization took 6059 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 399 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 389 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 01:03:23] [INFO ] Invariant cache hit.
[2024-05-21 01:03:27] [INFO ] Implicit Places using invariants in 3576 ms returned []
Implicit Place search using SMT only with invariants took 3577 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 01:03:27] [INFO ] Invariant cache hit.
[2024-05-21 01:03:27] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42780ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46837 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 794 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2024-05-21 01:04:10] [INFO ] Flatten gal took : 260 ms
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2024-05-21 01:04:10] [INFO ] Flatten gal took : 208 ms
[2024-05-21 01:04:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5219435261366434867.gal : 35 ms
[2024-05-21 01:04:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14045879396993868395.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/ReachabilityCardinality5219435261366434867.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14045879396993868395.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/ReachabilityCardinality14045879396993868395.prop.
Interrupted probabilistic random walk after 80621 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80621 steps, saw 28898 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-21 01:04:13] [INFO ] Invariant cache hit.
[2024-05-21 01:04:13] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:04:14] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:04:17] [INFO ] Deduced a trap composed of 65 places in 3060 ms of which 18 ms to minimize.
[2024-05-21 01:04:20] [INFO ] Deduced a trap composed of 66 places in 2994 ms of which 19 ms to minimize.
SMT process timed out in 6973ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 398 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 829 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84909 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 84909 steps, saw 29472 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 01:04:24] [INFO ] Invariant cache hit.
[2024-05-21 01:04:24] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:04:24] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:04:28] [INFO ] Deduced a trap composed of 71 places in 2855 ms of which 18 ms to minimize.
[2024-05-21 01:04:31] [INFO ] Deduced a trap composed of 67 places in 2884 ms of which 18 ms to minimize.
[2024-05-21 01:04:33] [INFO ] Deduced a trap composed of 64 places in 2855 ms of which 17 ms to minimize.
[2024-05-21 01:04:36] [INFO ] Deduced a trap composed of 64 places in 2897 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12867 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17025 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:04:41] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:04:45] [INFO ] Deduced a trap composed of 102 places in 3121 ms of which 19 ms to minimize.
[2024-05-21 01:04:48] [INFO ] Deduced a trap composed of 68 places in 2986 ms of which 24 ms to minimize.
[2024-05-21 01:04:51] [INFO ] Deduced a trap composed of 64 places in 2935 ms of which 18 ms to minimize.
[2024-05-21 01:04:54] [INFO ] Deduced a trap composed of 66 places in 2888 ms of which 19 ms to minimize.
[2024-05-21 01:04:57] [INFO ] Deduced a trap composed of 66 places in 2899 ms of which 18 ms to minimize.
[2024-05-21 01:05:00] [INFO ] Deduced a trap composed of 65 places in 2935 ms of which 17 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 01:05:01] [INFO ] Flatten gal took : 193 ms
[2024-05-21 01:05:01] [INFO ] Applying decomposition
[2024-05-21 01:05:01] [INFO ] Flatten gal took : 202 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/graph10877251951837799779.txt' '-o' '/tmp/graph10877251951837799779.bin' '-w' '/tmp/graph10877251951837799779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10877251951837799779.bin' '-l' '-1' '-v' '-w' '/tmp/graph10877251951837799779.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:05:01] [INFO ] Decomposing Gal with order
[2024-05-21 01:05:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:05:02] [INFO ] Removed a total of 7716 redundant transitions.
[2024-05-21 01:05:02] [INFO ] Flatten gal took : 589 ms
[2024-05-21 01:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 9752 labels/synchronizations in 481 ms.
[2024-05-21 01:05:03] [INFO ] Deduced a trap composed of 67 places in 2923 ms of which 16 ms to minimize.
[2024-05-21 01:05:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality458203179426312916.gal : 67 ms
[2024-05-21 01:05:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11817681611112717555.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/ReachabilityCardinality458203179426312916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11817681611112717555.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/ReachabilityCardinality11817681611112717555.prop.
[2024-05-21 01:05:06] [INFO ] Deduced a trap composed of 98 places in 2863 ms of which 16 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 193
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :193 after 193
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :193 after 236
[2024-05-21 01:05:08] [INFO ] Deduced a trap composed of 70 places in 2747 ms of which 17 ms to minimize.
[2024-05-21 01:05:11] [INFO ] Deduced a trap composed of 61 places in 2724 ms of which 17 ms to minimize.
[2024-05-21 01:05:14] [INFO ] Deduced a trap composed of 59 places in 2671 ms of which 16 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :236 after 44489
[2024-05-21 01:05:17] [INFO ] Deduced a trap composed of 61 places in 2688 ms of which 17 ms to minimize.
[2024-05-21 01:05:19] [INFO ] Deduced a trap composed of 66 places in 2641 ms of which 17 ms to minimize.
[2024-05-21 01:05:22] [INFO ] Deduced a trap composed of 68 places in 2662 ms of which 17 ms to minimize.
[2024-05-21 01:05:25] [INFO ] Deduced a trap composed of 61 places in 2678 ms of which 17 ms to minimize.
[2024-05-21 01:05:27] [INFO ] Deduced a trap composed of 70 places in 2606 ms of which 17 ms to minimize.
SMT process timed out in 63410ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 419 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 403 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 01:05:28] [INFO ] Invariant cache hit.
[2024-05-21 01:05:32] [INFO ] Implicit Places using invariants in 3539 ms returned []
Implicit Place search using SMT only with invariants took 3540 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 01:05:32] [INFO ] Invariant cache hit.
[2024-05-21 01:05:32] [INFO ] State equation strengthened by 10007 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43508ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47541 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-09 in 215104 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 01:06:16] [INFO ] Computed 52 invariants in 492 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (44 resets) in 149 ms. (66 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-21 01:06:16] [INFO ] Invariant cache hit.
[2024-05-21 01:06:16] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 01:06:16] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-21 01:06:18] [INFO ] [Real]Absence check using state equation in 1978 ms returned sat
[2024-05-21 01:06:19] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 01:06:19] [INFO ] [Real]Added 9984 Read/Feed constraints in 919 ms returned sat
[2024-05-21 01:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:06:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 01:06:20] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 01:06:22] [INFO ] [Nat]Absence check using state equation in 1931 ms returned sat
[2024-05-21 01:06:23] [INFO ] [Nat]Added 9984 Read/Feed constraints in 830 ms returned sat
[2024-05-21 01:06:23] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 551 ms.
[2024-05-21 01:06:24] [INFO ] Added : 1 causal constraints over 1 iterations in 1514 ms. Result :sat
Minimization took 228 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1064 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-21 01:06:26] [INFO ] Computed 52 invariants in 333 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4356 resets) in 14836 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1488 ms. (671 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 01:06:42] [INFO ] Invariant cache hit.
[2024-05-21 01:06:43] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 01:06:43] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 01:06:45] [INFO ] [Real]Absence check using state equation in 1930 ms returned sat
[2024-05-21 01:06:45] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 01:06:46] [INFO ] [Real]Added 10007 Read/Feed constraints in 850 ms returned sat
[2024-05-21 01:06:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:06:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-21 01:06:46] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 01:06:48] [INFO ] [Nat]Absence check using state equation in 2024 ms returned sat
[2024-05-21 01:06:49] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1021 ms returned sat
[2024-05-21 01:06:50] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 490 ms.
[2024-05-21 01:06:52] [INFO ] Added : 11 causal constraints over 3 iterations in 2518 ms. Result :sat
Minimization took 6085 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 405 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 402 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 01:06:59] [INFO ] Invariant cache hit.
[2024-05-21 01:07:03] [INFO ] Implicit Places using invariants in 3675 ms returned []
Implicit Place search using SMT only with invariants took 3677 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 01:07:03] [INFO ] Invariant cache hit.
[2024-05-21 01:07:03] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43637ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47846 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 01:07:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4345 resets) in 14723 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1498 ms. (667 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 01:08:03] [INFO ] Invariant cache hit.
[2024-05-21 01:08:03] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-21 01:08:03] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2024-05-21 01:08:05] [INFO ] [Real]Absence check using state equation in 2047 ms returned sat
[2024-05-21 01:08:05] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-21 01:08:06] [INFO ] [Real]Added 10007 Read/Feed constraints in 842 ms returned sat
[2024-05-21 01:08:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:08:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 01:08:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 01:08:09] [INFO ] [Nat]Absence check using state equation in 2206 ms returned sat
[2024-05-21 01:08:10] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1133 ms returned sat
[2024-05-21 01:08:11] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 582 ms.
[2024-05-21 01:08:13] [INFO ] Added : 11 causal constraints over 3 iterations in 2558 ms. Result :sat
Minimization took 8184 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 395 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 390 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 01:08:22] [INFO ] Invariant cache hit.
[2024-05-21 01:08:25] [INFO ] Implicit Places using invariants in 3582 ms returned []
Implicit Place search using SMT only with invariants took 3582 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 01:08:25] [INFO ] Invariant cache hit.
[2024-05-21 01:08:25] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43484ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43564ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47548 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-21 01:09:09] [INFO ] Flatten gal took : 214 ms
RANDOM walk for 40000 steps (172 resets) in 897 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
[2024-05-21 01:09:09] [INFO ] Flatten gal took : 220 ms
[2024-05-21 01:09:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12117941574504647221.gal : 37 ms
[2024-05-21 01:09:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4731312439679097749.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/ReachabilityCardinality12117941574504647221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4731312439679097749.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/ReachabilityCardinality4731312439679097749.prop.
Interrupted probabilistic random walk after 80024 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80024 steps, saw 28831 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-21 01:09:12] [INFO ] Invariant cache hit.
[2024-05-21 01:09:12] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 01:09:13] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 01:09:16] [INFO ] Deduced a trap composed of 65 places in 2963 ms of which 18 ms to minimize.
[2024-05-21 01:09:19] [INFO ] Deduced a trap composed of 66 places in 2850 ms of which 18 ms to minimize.
SMT process timed out in 6655ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 501 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 1157 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 86582 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 86582 steps, saw 29715 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 01:09:23] [INFO ] Invariant cache hit.
[2024-05-21 01:09:23] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:09:23] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:09:27] [INFO ] Deduced a trap composed of 60 places in 2981 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8536 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:09:32] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 01:09:35] [INFO ] Deduced a trap composed of 102 places in 3011 ms of which 18 ms to minimize.
[2024-05-21 01:09:38] [INFO ] Deduced a trap composed of 64 places in 2985 ms of which 18 ms to minimize.
[2024-05-21 01:09:41] [INFO ] Deduced a trap composed of 65 places in 2962 ms of which 17 ms to minimize.
[2024-05-21 01:09:44] [INFO ] Deduced a trap composed of 65 places in 2974 ms of which 18 ms to minimize.
[2024-05-21 01:09:47] [INFO ] Deduced a trap composed of 68 places in 2872 ms of which 18 ms to minimize.
[2024-05-21 01:09:50] [INFO ] Deduced a trap composed of 92 places in 3334 ms of which 18 ms to minimize.
[2024-05-21 01:09:53] [INFO ] Deduced a trap composed of 64 places in 2952 ms of which 18 ms to minimize.
[2024-05-21 01:09:56] [INFO ] Deduced a trap composed of 64 places in 2933 ms of which 17 ms to minimize.
[2024-05-21 01:09:59] [INFO ] Deduced a trap composed of 63 places in 2822 ms of which 17 ms to minimize.
Detected timeout of ITS tools.
[2024-05-21 01:10:00] [INFO ] Flatten gal took : 294 ms
[2024-05-21 01:10:00] [INFO ] Applying decomposition
[2024-05-21 01:10:00] [INFO ] Flatten gal took : 197 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/graph11200498176907136864.txt' '-o' '/tmp/graph11200498176907136864.bin' '-w' '/tmp/graph11200498176907136864.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11200498176907136864.bin' '-l' '-1' '-v' '-w' '/tmp/graph11200498176907136864.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:10:00] [INFO ] Decomposing Gal with order
[2024-05-21 01:10:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:10:01] [INFO ] Removed a total of 7716 redundant transitions.
[2024-05-21 01:10:01] [INFO ] Flatten gal took : 601 ms
[2024-05-21 01:10:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 9752 labels/synchronizations in 476 ms.
[2024-05-21 01:10:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10699906022738620620.gal : 61 ms
[2024-05-21 01:10:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18175714650152403734.prop : 15 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/ReachabilityCardinality10699906022738620620.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18175714650152403734.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 ...309
[2024-05-21 01:10:02] [INFO ] Deduced a trap composed of 63 places in 2853 ms of which 17 ms to minimize.
Loading property file /tmp/ReachabilityCardinality18175714650152403734.prop.
[2024-05-21 01:10:05] [INFO ] Deduced a trap composed of 63 places in 2753 ms of which 17 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 146
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :146 after 146
[2024-05-21 01:10:08] [INFO ] Deduced a trap composed of 62 places in 2834 ms of which 18 ms to minimize.
[2024-05-21 01:10:11] [INFO ] Deduced a trap composed of 63 places in 2786 ms of which 17 ms to minimize.
[2024-05-21 01:10:14] [INFO ] Deduced a trap composed of 66 places in 2947 ms of which 18 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :146 after 38251
[2024-05-21 01:10:17] [INFO ] Deduced a trap composed of 65 places in 2889 ms of which 17 ms to minimize.
SMT process timed out in 53781ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 396 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 386 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-21 01:10:17] [INFO ] Invariant cache hit.
[2024-05-21 01:10:21] [INFO ] Implicit Places using invariants in 3609 ms returned []
Implicit Place search using SMT only with invariants took 3624 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-21 01:10:21] [INFO ] Invariant cache hit.
[2024-05-21 01:10:21] [INFO ] State equation strengthened by 10007 read => feed constraints.
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 timeout
0.0)
(s364 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43528ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43608ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47630 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-10 in 289353 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-21 01:11:05] [INFO ] Computed 52 invariants in 386 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 158 ms. (62 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 01:11:05] [INFO ] Invariant cache hit.
[2024-05-21 01:11:05] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-21 01:11:06] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-21 01:11:08] [INFO ] [Real]Absence check using state equation in 2060 ms returned sat
[2024-05-21 01:11:08] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-21 01:11:09] [INFO ] [Real]Added 9984 Read/Feed constraints in 841 ms returned sat
[2024-05-21 01:11:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:11:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-21 01:11:09] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-21 01:11:11] [INFO ] [Nat]Absence check using state equation in 2043 ms returned sat
[2024-05-21 01:11:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 01:11:13] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1422 ms returned sat
[2024-05-21 01:11:13] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 496 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 2802 transition count 10158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2802 transition count 10158
Applied a total of 26 rules in 1044 ms. Remains 2802 /2814 variables (removed 12) and now considering 10158/10170 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 2802/2814 places, 10158/10170 transitions.
// Phase 1: matrix 10158 rows 2802 cols
[2024-05-21 01:11:15] [INFO ] Computed 52 invariants in 372 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4350 resets) in 14755 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1503 ms. (664 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-21 01:11:32] [INFO ] Invariant cache hit.
[2024-05-21 01:11:32] [INFO ] [Real]Absence check using 50 positive place invariants in 41 ms returned sat
[2024-05-21 01:11:32] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 01:11:34] [INFO ] [Real]Absence check using state equation in 2070 ms returned sat
[2024-05-21 01:11:34] [INFO ] State equation strengthened by 10008 read => feed constraints.
[2024-05-21 01:11:35] [INFO ] [Real]Added 10008 Read/Feed constraints in 752 ms returned sat
[2024-05-21 01:11:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:11:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-21 01:11:36] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 01:11:38] [INFO ] [Nat]Absence check using state equation in 2132 ms returned sat
[2024-05-21 01:11:39] [INFO ] [Nat]Added 10008 Read/Feed constraints in 1679 ms returned sat
[2024-05-21 01:11:40] [INFO ] Computed and/alt/rep : 7364/19588/7364 causal constraints (skipped 2744 transitions) in 509 ms.
[2024-05-21 01:11:42] [INFO ] Added : 12 causal constraints over 3 iterations in 2326 ms. Result :sat
Minimization took 5830 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 400 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 395 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-21 01:11:49] [INFO ] Invariant cache hit.
[2024-05-21 01:11:52] [INFO ] Implicit Places using invariants in 3621 ms returned []
Implicit Place search using SMT only with invariants took 3622 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-21 01:11:52] [INFO ] Invariant cache hit.
[2024-05-21 01:11:52] [INFO ] State equation strengthened by 10008 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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