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.r550-tall-171734898600138.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 CO4-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898600138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 239K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717354470219

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:54:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:54:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:54:31] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-06-02 18:54:31] [INFO ] Transformed 979 places.
[2024-06-02 18:54:31] [INFO ] Transformed 1111 transitions.
[2024-06-02 18:54:31] [INFO ] Found NUPN structural information;
[2024-06-02 18:54:31] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 157 places in 14 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-18-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 116 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 114 places :
Symmetric choice reduction at 1 with 114 rule applications. Total rules 131 place count 694 transition count 815
Iterating global reduction 1 with 114 rules applied. Total rules applied 245 place count 694 transition count 815
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 331 place count 608 transition count 729
Iterating global reduction 1 with 86 rules applied. Total rules applied 417 place count 608 transition count 729
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 420 place count 608 transition count 726
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 453 place count 575 transition count 693
Iterating global reduction 2 with 33 rules applied. Total rules applied 486 place count 575 transition count 693
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 487 place count 575 transition count 692
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 505 place count 557 transition count 674
Iterating global reduction 3 with 18 rules applied. Total rules applied 523 place count 557 transition count 674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 524 place count 557 transition count 673
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 535 place count 546 transition count 662
Iterating global reduction 4 with 11 rules applied. Total rules applied 546 place count 546 transition count 662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 547 place count 546 transition count 661
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 549 place count 544 transition count 659
Iterating global reduction 5 with 2 rules applied. Total rules applied 551 place count 544 transition count 659
Applied a total of 551 rules in 216 ms. Remains 544 /822 variables (removed 278) and now considering 659/934 (removed 275) transitions.
// Phase 1: matrix 659 rows 544 cols
[2024-06-02 18:54:31] [INFO ] Computed 5 invariants in 21 ms
[2024-06-02 18:54:32] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-02 18:54:32] [INFO ] Invariant cache hit.
[2024-06-02 18:54:32] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-06-02 18:54:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/544 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (OVERLAPS) 659/1203 variables, 544/549 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-02 18:54:57] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 28 ms to minimize.
[2024-06-02 18:54:57] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1203/1203 variables, and 551 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/544 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (OVERLAPS) 659/1203 variables, 544/551 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1203 variables, 658/1209 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1203/1203 variables, and 1209 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 2/2 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Starting structural reductions in LTL mode, iteration 1 : 544/822 places, 659/934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61115 ms. Remains : 544/822 places, 659/934 transitions.
Support contains 116 out of 544 places after structural reductions.
[2024-06-02 18:55:32] [INFO ] Flatten gal took : 64 ms
[2024-06-02 18:55:33] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:55:33] [INFO ] Input system was already deterministic with 659 transitions.
Support contains 113 out of 544 places (down from 116) after GAL structural reductions.
RANDOM walk for 40000 steps (160 resets) in 1889 ms. (21 steps per ms) remains 58/75 properties
BEST_FIRST walk for 4003 steps (23 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (19 resets) in 47 ms. (83 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (21 resets) in 33 ms. (117 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4002 steps (14 resets) in 61 ms. (64 steps per ms) remains 55/57 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (20 resets) in 20 ms. (190 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4003 steps (20 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (20 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (25 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (20 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (14 resets) in 28 ms. (137 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (22 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (23 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (16 resets) in 15 ms. (250 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (18 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (22 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (18 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (19 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4001 steps (16 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (13 resets) in 9 ms. (400 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4002 steps (22 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
[2024-06-02 18:55:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 27/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 259/370 variables, 111/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 462/832 variables, 212/328 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 284/1116 variables, 164/492 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 68/1184 variables, 44/536 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 15/1199 variables, 10/546 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1199 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 13 (OVERLAPS) 4/1203 variables, 3/549 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1203 variables, 0/549 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 15 (OVERLAPS) 0/1203 variables, 0/549 constraints. Problems are: Problem set: 3 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1203/1203 variables, and 549 constraints, problems are : Problem set: 3 solved, 46 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 28/103 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 243/346 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 4/112 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 456/802 variables, 205/317 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 42/359 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 0/359 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 298/1100 variables, 170/529 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1100 variables, 0/529 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 76/1176 variables, 48/577 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1176 variables, 0/577 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 13 (OVERLAPS) 20/1196 variables, 13/590 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1196 variables, 0/590 constraints. Problems are: Problem set: 3 solved, 46 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 15 (OVERLAPS) 7/1203 variables, 5/595 constraints. Problems are: Problem set: 4 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1203/1203 variables, and 595 constraints, problems are : Problem set: 4 solved, 45 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 46/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 10049ms problems are : Problem set: 4 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 659/659 transitions.
Graph (trivial) has 440 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 815 edges and 542 vertex of which 536 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 536 transition count 451
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 395 place count 344 transition count 448
Reduce places removed 1 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 20 rules applied. Total rules applied 415 place count 343 transition count 429
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 434 place count 324 transition count 429
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 434 place count 324 transition count 398
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 496 place count 293 transition count 398
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 502 place count 287 transition count 392
Iterating global reduction 4 with 6 rules applied. Total rules applied 508 place count 287 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 510 place count 287 transition count 390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 511 place count 286 transition count 390
Performed 62 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 635 place count 224 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 640 place count 224 transition count 319
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 644 place count 220 transition count 315
Iterating global reduction 7 with 4 rules applied. Total rules applied 648 place count 220 transition count 315
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 702 place count 193 transition count 317
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 711 place count 193 transition count 308
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 722 place count 182 transition count 286
Iterating global reduction 8 with 11 rules applied. Total rules applied 733 place count 182 transition count 286
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 739 place count 182 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 745 place count 182 transition count 274
Free-agglomeration rule applied 14 times.
Iterating global reduction 9 with 14 rules applied. Total rules applied 759 place count 182 transition count 260
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 773 place count 168 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 774 place count 168 transition count 259
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 778 place count 168 transition count 259
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 780 place count 168 transition count 259
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 781 place count 168 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 782 place count 167 transition count 257
Applied a total of 782 rules in 129 ms. Remains 167 /544 variables (removed 377) and now considering 257/659 (removed 402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 167/544 places, 257/659 transitions.
RANDOM walk for 40000 steps (3396 resets) in 592 ms. (67 steps per ms) remains 6/45 properties
BEST_FIRST walk for 40004 steps (472 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (256 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (479 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (467 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (476 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (466 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
[2024-06-02 18:55:44] [INFO ] Flow matrix only has 244 transitions (discarded 13 similar events)
// Phase 1: matrix 244 rows 167 cols
[2024-06-02 18:55:44] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:55:44] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/70 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 105/175 variables, 70/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 89/264 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 95/359 variables, 42/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 45/404 variables, 29/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 7/411 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/411 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/411 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 179 constraints, problems are : Problem set: 0 solved, 6 unsolved in 275 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 167/167 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/70 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 105/175 variables, 70/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 89/264 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 95/359 variables, 42/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 45/404 variables, 29/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 7/411 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/411 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/411 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 185 constraints, problems are : Problem set: 0 solved, 6 unsolved in 393 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 167/167 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 3 properties in 698 ms.
Support contains 9 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 257/257 transitions.
Graph (complete) has 357 edges and 167 vertex of which 157 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 157 transition count 208
Reduce places removed 37 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 102 edges and 120 vertex of which 14 / 120 are part of one of the 2 SCC in 0 ms
Free SCC test removed 12 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 89 place count 108 transition count 204
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 108 place count 107 transition count 186
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 108 place count 107 transition count 176
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 128 place count 97 transition count 176
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 141 place count 84 transition count 157
Iterating global reduction 3 with 13 rules applied. Total rules applied 154 place count 84 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 159 place count 84 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 159 place count 84 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 83 transition count 151
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 81 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 81 transition count 148
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 193 place count 67 transition count 133
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 209 place count 67 transition count 117
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 218 place count 58 transition count 107
Iterating global reduction 5 with 9 rules applied. Total rules applied 227 place count 58 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 232 place count 58 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 57 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 57 transition count 100
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 56 transition count 99
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 56 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 238 place count 56 transition count 98
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 248 place count 51 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 254 place count 51 transition count 93
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 258 place count 47 transition count 87
Iterating global reduction 9 with 4 rules applied. Total rules applied 262 place count 47 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 263 place count 47 transition count 86
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 264 place count 46 transition count 83
Iterating global reduction 10 with 1 rules applied. Total rules applied 265 place count 46 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 266 place count 46 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 273 place count 46 transition count 75
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 275 place count 44 transition count 73
Iterating global reduction 11 with 2 rules applied. Total rules applied 277 place count 44 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 279 place count 44 transition count 71
Free-agglomeration rule applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 286 place count 44 transition count 64
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 82 edges and 36 vertex of which 33 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Graph (trivial) has 9 edges and 33 vertex of which 3 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 14 rules applied. Total rules applied 300 place count 31 transition count 58
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 305 place count 30 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 306 place count 30 transition count 53
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 308 place count 30 transition count 51
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 311 place count 28 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 312 place count 28 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 313 place count 27 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 314 place count 26 transition count 49
Applied a total of 314 rules in 45 ms. Remains 26 /167 variables (removed 141) and now considering 49/257 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 26/167 places, 49/257 transitions.
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 18:55:46] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 26 cols
[2024-06-02 18:55:46] [INFO ] Computed 2 invariants in 1 ms
[2024-06-02 18:55:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/71 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/71 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 29 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/71 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/71 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 43 steps, including 9 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 4 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2024-06-02 18:55:46] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:55:46] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:55:46] [INFO ] Input system was already deterministic with 659 transitions.
Support contains 93 out of 544 places (down from 94) after GAL structural reductions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 818 edges and 544 vertex of which 538 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 495 transition count 610
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 495 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 495 transition count 609
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 136 place count 458 transition count 572
Iterating global reduction 1 with 37 rules applied. Total rules applied 173 place count 458 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 175 place count 458 transition count 570
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 188 place count 445 transition count 557
Iterating global reduction 2 with 13 rules applied. Total rules applied 201 place count 445 transition count 557
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 441 transition count 553
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 441 transition count 553
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 211 place count 439 transition count 551
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 439 transition count 551
Applied a total of 213 rules in 72 ms. Remains 439 /544 variables (removed 105) and now considering 551/659 (removed 108) transitions.
// Phase 1: matrix 551 rows 439 cols
[2024-06-02 18:55:46] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:55:46] [INFO ] Implicit Places using invariants in 95 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 438/544 places, 551/659 transitions.
Applied a total of 0 rules in 6 ms. Remains 438 /438 variables (removed 0) and now considering 551/551 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 438/544 places, 551/659 transitions.
[2024-06-02 18:55:46] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:55:46] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:55:46] [INFO ] Input system was already deterministic with 551 transitions.
[2024-06-02 18:55:46] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:55:46] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1556857029990036871.gal : 13 ms
[2024-06-02 18:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9531344427124759330.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1556857029990036871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9531344427124759330.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.51877e+08,1.20607,43180,2,5559,5,121466,6,0,2301,214049,0


Converting to forward existential form...Done !
original formula: AX(EG(((p902!=1) * EG((p184==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((p902!=1) * EG((p184==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t51, t52, t53, t55, t58, t102, t1...457
Detected timeout of ITS tools.
[2024-06-02 18:56:16] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:56:16] [INFO ] Applying decomposition
[2024-06-02 18:56:16] [INFO ] Flatten gal took : 20 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/graph4212874864759877268.txt' '-o' '/tmp/graph4212874864759877268.bin' '-w' '/tmp/graph4212874864759877268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4212874864759877268.bin' '-l' '-1' '-v' '-w' '/tmp/graph4212874864759877268.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:56:16] [INFO ] Decomposing Gal with order
[2024-06-02 18:56:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:56:16] [INFO ] Removed a total of 164 redundant transitions.
[2024-06-02 18:56:16] [INFO ] Flatten gal took : 56 ms
[2024-06-02 18:56:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-06-02 18:56:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8752864934476364112.gal : 8 ms
[2024-06-02 18:56:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12556167238061597036.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8752864934476364112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12556167238061597036.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.51877e+08,0.183024,10896,650,94,11551,2763,905,19073,90,12601,0


Converting to forward existential form...Done !
original formula: AX(EG(((i20.u161.p902!=1) * EG((i3.u16.p184==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((i20.u161.p902!=1) * EG((i3.u16.p184==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t48, t58, t102, t271, t283, t297, t387, t418, t428, t459, t468, t495, t496, i1.t398, i1....697
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,29.7769,800808,1,0,1.08853e+06,4106,6681,4.73833e+06,503,22058,1020033
FORMULA CO4-PT-18-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Graph (trivial) has 553 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 816 edges and 542 vertex of which 536 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 270 place count 535 transition count 381
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 272 rules applied. Total rules applied 542 place count 267 transition count 377
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 547 place count 266 transition count 373
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 551 place count 262 transition count 373
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 551 place count 262 transition count 339
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 619 place count 228 transition count 339
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 631 place count 216 transition count 327
Iterating global reduction 4 with 12 rules applied. Total rules applied 643 place count 216 transition count 327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 645 place count 216 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 646 place count 215 transition count 325
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 646 place count 215 transition count 322
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 652 place count 212 transition count 322
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 656 place count 208 transition count 318
Iterating global reduction 6 with 4 rules applied. Total rules applied 660 place count 208 transition count 318
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 718 place count 179 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 721 place count 179 transition count 285
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 726 place count 174 transition count 280
Iterating global reduction 7 with 5 rules applied. Total rules applied 731 place count 174 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 733 place count 173 transition count 279
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 734 place count 172 transition count 278
Iterating global reduction 7 with 1 rules applied. Total rules applied 735 place count 172 transition count 278
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 736 place count 171 transition count 276
Iterating global reduction 7 with 1 rules applied. Total rules applied 737 place count 171 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 738 place count 171 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 754 place count 171 transition count 259
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 10 rules applied. Total rules applied 764 place count 171 transition count 249
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 774 place count 161 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 774 place count 161 transition count 248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 776 place count 160 transition count 248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 778 place count 159 transition count 247
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 779 place count 159 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 781 place count 157 transition count 245
Applied a total of 781 rules in 77 ms. Remains 157 /544 variables (removed 387) and now considering 245/659 (removed 414) transitions.
// Phase 1: matrix 245 rows 157 cols
[2024-06-02 18:56:47] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:56:47] [INFO ] Implicit Places using invariants in 66 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/544 places, 245/659 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 148 ms. Remains : 156/544 places, 245/659 transitions.
[2024-06-02 18:56:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:56:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:56:47] [INFO ] Input system was already deterministic with 245 transitions.
[2024-06-02 18:56:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:56:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:56:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14638855492414253571.gal : 1 ms
[2024-06-02 18:56:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8019387862751834776.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14638855492414253571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8019387862751834776.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.2832e+06,0.083405,6636,2,765,5,10286,6,0,859,11653,0


Converting to forward existential form...Done !
original formula: AG((((p192==1) + ((EG((p827==0)) * (p122==0)) * ((p237==0)&&((p594==0)||(p964==0))))) + ((p643==0)&&(p647==0))))
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !(((p643==0)&&(p647==0)))) * !((p192==1))) * !(EG((p827==0))))] = FALSE * [(((FwdU(Init,...350
(forward)formula 0,0,0.087868,6900,1,0,14,10286,13,6,886,11653,3
FORMULA CO4-PT-18-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 498 transition count 613
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 498 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 498 transition count 612
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 127 place count 464 transition count 578
Iterating global reduction 1 with 34 rules applied. Total rules applied 161 place count 464 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 162 place count 464 transition count 577
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 454 transition count 567
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 454 transition count 567
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 186 place count 450 transition count 563
Iterating global reduction 2 with 4 rules applied. Total rules applied 190 place count 450 transition count 563
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 448 transition count 561
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 448 transition count 561
Applied a total of 194 rules in 37 ms. Remains 448 /544 variables (removed 96) and now considering 561/659 (removed 98) transitions.
// Phase 1: matrix 561 rows 448 cols
[2024-06-02 18:56:47] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:56:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 18:56:47] [INFO ] Invariant cache hit.
[2024-06-02 18:56:47] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 560 sub problems to find dead transitions.
[2024-06-02 18:56:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (OVERLAPS) 561/1009 variables, 448/453 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-02 18:57:04] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 4 ms to minimize.
[2024-06-02 18:57:04] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1009 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 455 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (OVERLAPS) 561/1009 variables, 448/455 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 560/1015 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 1015 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 2/2 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 448/544 places, 561/659 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60452 ms. Remains : 448/544 places, 561/659 transitions.
[2024-06-02 18:57:47] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:57:47] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:57:47] [INFO ] Input system was already deterministic with 561 transitions.
[2024-06-02 18:57:47] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:57:47] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:57:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10544689561425550108.gal : 2 ms
[2024-06-02 18:57:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16718323589029732450.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10544689561425550108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16718323589029732450.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.53616e+08,1.20167,43432,2,6007,5,125302,6,0,2351,213647,0


Converting to forward existential form...Done !
original formula: A(EF((!(((p938!=1) + A((p582==1) U (p489==1)))) * EG((p661==1)))) U ((A(!((((((p8==1)&&(p428==1))&&((p437==1)&&(p861==1)))&&(((p870==1)&&...383
=> equivalent forward existential formula: [((Init * !(EG(!(((!((E(!(E((p596==1) U !((E(!(((p785==1)&&(p964==1))) U (!((p469==1)) * !(((p785==1)&&(p964==1)...2215
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t33, t38, t47, t48, t50, t51, t52, t53, t56, t57, t59...478
Detected timeout of ITS tools.
[2024-06-02 18:58:17] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:58:17] [INFO ] Applying decomposition
[2024-06-02 18:58:17] [INFO ] Flatten gal took : 10 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/graph7222080732167426642.txt' '-o' '/tmp/graph7222080732167426642.bin' '-w' '/tmp/graph7222080732167426642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7222080732167426642.bin' '-l' '-1' '-v' '-w' '/tmp/graph7222080732167426642.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:58:17] [INFO ] Decomposing Gal with order
[2024-06-02 18:58:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:58:17] [INFO ] Removed a total of 169 redundant transitions.
[2024-06-02 18:58:17] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-06-02 18:58:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4937711237218987910.gal : 4 ms
[2024-06-02 18:58:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12517618994175532743.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4937711237218987910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12517618994175532743.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.53616e+08,0.312719,16344,696,113,23012,3917,1004,47208,100,14920,0


Converting to forward existential form...Done !
original formula: A(EF((!(((i17.u165.p938!=1) + A((i10.u98.p582==1) U (i8.u76.p489==1)))) * EG((i13.u115.p661==1)))) U ((A(!((((((i18.u3.p8==1)&&(i5.i0.i1....603
=> equivalent forward existential formula: [((Init * !(EG(!(((!((E(!(E((i10.u101.p596==1) U !((E(!(((i8.u143.p785==1)&&(i17.u165.p964==1))) U (!((i6.u72.p4...3327
Reverse transition relation is NOT exact ! Due to transitions t18, t50, t62, t106, t190, t276, t288, t302, t347, t393, t464, t473, t500, t502, t549, i0.t45...792
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 496 transition count 611
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 496 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 496 transition count 610
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 133 place count 460 transition count 574
Iterating global reduction 1 with 36 rules applied. Total rules applied 169 place count 460 transition count 574
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 171 place count 460 transition count 572
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 184 place count 447 transition count 559
Iterating global reduction 2 with 13 rules applied. Total rules applied 197 place count 447 transition count 559
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 444 transition count 556
Iterating global reduction 2 with 3 rules applied. Total rules applied 203 place count 444 transition count 556
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 204 place count 443 transition count 555
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 443 transition count 555
Applied a total of 205 rules in 43 ms. Remains 443 /544 variables (removed 101) and now considering 555/659 (removed 104) transitions.
// Phase 1: matrix 555 rows 443 cols
[2024-06-02 18:58:48] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:58:48] [INFO ] Implicit Places using invariants in 98 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/544 places, 555/659 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 442/544 places, 555/659 transitions.
[2024-06-02 18:58:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:58:48] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:58:48] [INFO ] Input system was already deterministic with 555 transitions.
[2024-06-02 18:58:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:58:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:58:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8357149426214530217.gal : 2 ms
[2024-06-02 18:58:48] [INFO ] Time to serialize properties into /tmp/CTLFireability4140323817901335596.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8357149426214530217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4140323817901335596.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.40209e+08,1.1828,43300,2,5708,5,121638,6,0,2321,212422,0


Converting to forward existential form...Done !
original formula: EF((((p743==1)||(p739==1)) + ((p590==1) * (EX(((p653==1)&&(p964==1))) + (AF((p126==1)) * (p376==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p743==1)||(p739==1)))] != FALSE + ([(EY((FwdU(Init,TRUE) * (p590==1))) * ((p653==1)&&(p96...255
(forward)formula 0,1,1.18609,43300,1,0,7,121638,8,1,2327,212422,1
FORMULA CO4-PT-18-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Graph (trivial) has 561 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 816 edges and 542 vertex of which 536 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 277 place count 535 transition count 374
Reduce places removed 275 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 556 place count 260 transition count 370
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 558 place count 259 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 258 transition count 369
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 559 place count 258 transition count 336
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 625 place count 225 transition count 336
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 638 place count 212 transition count 323
Iterating global reduction 4 with 13 rules applied. Total rules applied 651 place count 212 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 653 place count 212 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 654 place count 211 transition count 321
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 654 place count 211 transition count 317
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 662 place count 207 transition count 317
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 667 place count 202 transition count 312
Iterating global reduction 6 with 5 rules applied. Total rules applied 672 place count 202 transition count 312
Performed 30 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 732 place count 172 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 734 place count 172 transition count 278
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 739 place count 167 transition count 273
Iterating global reduction 7 with 5 rules applied. Total rules applied 744 place count 167 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 746 place count 166 transition count 272
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 747 place count 165 transition count 271
Iterating global reduction 7 with 1 rules applied. Total rules applied 748 place count 165 transition count 271
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 749 place count 164 transition count 269
Iterating global reduction 7 with 1 rules applied. Total rules applied 750 place count 164 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 751 place count 164 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 766 place count 164 transition count 253
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 8 with 7 rules applied. Total rules applied 773 place count 164 transition count 246
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 8 rules applied. Total rules applied 781 place count 157 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 782 place count 156 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 782 place count 156 transition count 244
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 784 place count 155 transition count 244
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 786 place count 154 transition count 243
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 788 place count 152 transition count 241
Applied a total of 788 rules in 48 ms. Remains 152 /544 variables (removed 392) and now considering 241/659 (removed 418) transitions.
// Phase 1: matrix 241 rows 152 cols
[2024-06-02 18:58:49] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:58:49] [INFO ] Implicit Places using invariants in 58 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 151/544 places, 241/659 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 110 ms. Remains : 151/544 places, 241/659 transitions.
[2024-06-02 18:58:49] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:58:49] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:58:49] [INFO ] Input system was already deterministic with 241 transitions.
[2024-06-02 18:58:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:58:49] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:58:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4783265239540016898.gal : 1 ms
[2024-06-02 18:58:49] [INFO ] Time to serialize properties into /tmp/CTLFireability877575583793750888.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4783265239540016898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability877575583793750888.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.96e+06,0.102767,7400,2,786,5,13221,6,0,835,14984,0


Converting to forward existential form...Done !
original formula: EG(EF(((AG((p479==1)) * (p907==1)) * E((p856==1) U ((p429==1)&&(p435==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(E(TRUE U !((p479==1)))) * (p907==1)) * E((p856==1) U ((p429==1)&&(p435==1))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t24, t42, t72, t87, t92, t147, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,0,0.803832,35836,1,0,335,175696,515,179,5344,121441,539
FORMULA CO4-PT-18-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 494 transition count 609
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 494 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 494 transition count 608
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 140 place count 455 transition count 569
Iterating global reduction 1 with 39 rules applied. Total rules applied 179 place count 455 transition count 569
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 181 place count 455 transition count 567
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 195 place count 441 transition count 553
Iterating global reduction 2 with 14 rules applied. Total rules applied 209 place count 441 transition count 553
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 437 transition count 549
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 437 transition count 549
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 219 place count 435 transition count 547
Iterating global reduction 2 with 2 rules applied. Total rules applied 221 place count 435 transition count 547
Applied a total of 221 rules in 33 ms. Remains 435 /544 variables (removed 109) and now considering 547/659 (removed 112) transitions.
// Phase 1: matrix 547 rows 435 cols
[2024-06-02 18:58:50] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 18:58:50] [INFO ] Implicit Places using invariants in 89 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 434/544 places, 547/659 transitions.
Applied a total of 0 rules in 5 ms. Remains 434 /434 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 434/544 places, 547/659 transitions.
[2024-06-02 18:58:50] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:58:50] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:58:50] [INFO ] Input system was already deterministic with 547 transitions.
[2024-06-02 18:58:50] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:58:50] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:58:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15644729316006947549.gal : 3 ms
[2024-06-02 18:58:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11617536768519905855.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15644729316006947549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11617536768519905855.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.18111e+08,1.01817,40356,2,5674,5,113837,6,0,2281,195825,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,1.08314,40356,1,0,6,113837,7,1,2756,195825,1
FORMULA CO4-PT-18-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 495 transition count 610
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 495 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 495 transition count 609
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 137 place count 457 transition count 571
Iterating global reduction 1 with 38 rules applied. Total rules applied 175 place count 457 transition count 571
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 177 place count 457 transition count 569
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 191 place count 443 transition count 555
Iterating global reduction 2 with 14 rules applied. Total rules applied 205 place count 443 transition count 555
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 439 transition count 551
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 439 transition count 551
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 437 transition count 549
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 437 transition count 549
Applied a total of 217 rules in 34 ms. Remains 437 /544 variables (removed 107) and now considering 549/659 (removed 110) transitions.
// Phase 1: matrix 549 rows 437 cols
[2024-06-02 18:58:51] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:58:51] [INFO ] Implicit Places using invariants in 93 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/544 places, 549/659 transitions.
Applied a total of 0 rules in 5 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 436/544 places, 549/659 transitions.
[2024-06-02 18:58:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:58:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:58:51] [INFO ] Input system was already deterministic with 549 transitions.
[2024-06-02 18:58:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:58:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:58:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13765508980892777346.gal : 2 ms
[2024-06-02 18:58:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4684835626166742252.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13765508980892777346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4684835626166742252.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.25979e+08,1.05963,41160,2,5653,5,115783,6,0,2291,200158,0


Converting to forward existential form...Done !
original formula: AG((EX((EG((p658==0)) * ((p402==0)||(p862==0)))) + (p9==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p9==0))) * !(EX((EG((p658==0)) * ((p402==0)||(p862==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
Detected timeout of ITS tools.
[2024-06-02 18:59:21] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:59:21] [INFO ] Applying decomposition
[2024-06-02 18:59:21] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2670686635480177113.txt' '-o' '/tmp/graph2670686635480177113.bin' '-w' '/tmp/graph2670686635480177113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2670686635480177113.bin' '-l' '-1' '-v' '-w' '/tmp/graph2670686635480177113.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:59:22] [INFO ] Decomposing Gal with order
[2024-06-02 18:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:59:22] [INFO ] Removed a total of 170 redundant transitions.
[2024-06-02 18:59:22] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:59:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-06-02 18:59:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12222308447908771524.gal : 4 ms
[2024-06-02 18:59:22] [INFO ] Time to serialize properties into /tmp/CTLFireability8558250473088210470.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12222308447908771524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8558250473088210470.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.25979e+08,0.173941,10428,638,93,11084,2567,910,17263,90,10449,0


Converting to forward existential form...Done !
original formula: AG((EX((EG((i14.u114.p658==0)) * ((i5.u59.p402==0)||(i9.u90.p862==0)))) + (i0.u3.p9==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i0.u3.p9==0))) * !(EX((EG((i14.u114.p658==0)) * ((i5.u59.p402==0)||(i9.u90.p862==0))))))...164
Reverse transition relation is NOT exact ! Due to transitions t17, t47, t56, t100, t281, t295, t386, t417, t466, t493, t494, i2.i0.t426, i2.i0.i0.t448, i2....739
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,15.0414,468204,1,0,655604,3970,6317,2.85614e+06,480,19990,660310
FORMULA CO4-PT-18-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 496 transition count 611
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 496 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 496 transition count 610
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 134 place count 459 transition count 573
Iterating global reduction 1 with 37 rules applied. Total rules applied 171 place count 459 transition count 573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 459 transition count 571
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 185 place count 447 transition count 559
Iterating global reduction 2 with 12 rules applied. Total rules applied 197 place count 447 transition count 559
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 443 transition count 555
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 443 transition count 555
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 207 place count 441 transition count 553
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 441 transition count 553
Applied a total of 209 rules in 45 ms. Remains 441 /544 variables (removed 103) and now considering 553/659 (removed 106) transitions.
// Phase 1: matrix 553 rows 441 cols
[2024-06-02 18:59:37] [INFO ] Computed 5 invariants in 12 ms
[2024-06-02 18:59:37] [INFO ] Implicit Places using invariants in 96 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 440/544 places, 553/659 transitions.
Applied a total of 0 rules in 4 ms. Remains 440 /440 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 440/544 places, 553/659 transitions.
[2024-06-02 18:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:59:37] [INFO ] Input system was already deterministic with 553 transitions.
[2024-06-02 18:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:59:37] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:59:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6476993657350804946.gal : 2 ms
[2024-06-02 18:59:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7125761248134771440.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6476993657350804946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7125761248134771440.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.58718e+08,1.10775,41972,2,5755,5,118328,6,0,2311,204604,0


Converting to forward existential form...Done !
original formula: AX((AG(!(A(EX((p347==1)) U (p370==1)))) + EX(A(((p873==1)&&(p939==1)) U (p473==1)))))
=> equivalent forward existential formula: [((FwdU((EY(Init) * !(EX(!((E(!((p473==1)) U (!(((p873==1)&&(p939==1))) * !((p473==1)))) + EG(!((p473==1))))))))...251
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t24, t29, t38, t47, t49, t50, t51, t52, t53, t55, t58, t102, t1...463
Detected timeout of ITS tools.
[2024-06-02 19:00:07] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:00:07] [INFO ] Applying decomposition
[2024-06-02 19:00:07] [INFO ] Flatten gal took : 8 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/graph13271084567426702973.txt' '-o' '/tmp/graph13271084567426702973.bin' '-w' '/tmp/graph13271084567426702973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13271084567426702973.bin' '-l' '-1' '-v' '-w' '/tmp/graph13271084567426702973.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:00:07] [INFO ] Decomposing Gal with order
[2024-06-02 19:00:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:00:07] [INFO ] Removed a total of 162 redundant transitions.
[2024-06-02 19:00:07] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:00:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-06-02 19:00:07] [INFO ] Time to serialize gal into /tmp/CTLFireability7474776763604093439.gal : 4 ms
[2024-06-02 19:00:07] [INFO ] Time to serialize properties into /tmp/CTLFireability922770040982390344.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7474776763604093439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability922770040982390344.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.58718e+08,0.215903,12148,580,86,15442,1733,1014,28442,94,6412,0


Converting to forward existential form...Done !
original formula: AX((AG(!(A(EX((i5.u49.p347==1)) U (i1.i1.i1.u55.p370==1)))) + EX(A(((i6.u157.p873==1)&&(i18.u165.p939==1)) U (i14.u76.p473==1)))))
=> equivalent forward existential formula: [((FwdU((EY(Init) * !(EX(!((E(!((i14.u76.p473==1)) U (!(((i6.u157.p873==1)&&(i18.u165.p939==1))) * !((i14.u76.p4...338
Reverse transition relation is NOT exact ! Due to transitions t49, t58, t102, t186, t271, t297, t388, t397, t459, t468, t496, t497, i0.i0.i1.t450, i1.i0.t4...720
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,25.2615,677524,1,0,968062,5953,8116,3.84069e+06,527,29073,705130
FORMULA CO4-PT-18-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 496 transition count 611
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 496 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 496 transition count 610
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 134 place count 459 transition count 573
Iterating global reduction 1 with 37 rules applied. Total rules applied 171 place count 459 transition count 573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 459 transition count 571
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 186 place count 446 transition count 558
Iterating global reduction 2 with 13 rules applied. Total rules applied 199 place count 446 transition count 558
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 202 place count 443 transition count 555
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 443 transition count 555
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 207 place count 441 transition count 553
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 441 transition count 553
Applied a total of 209 rules in 43 ms. Remains 441 /544 variables (removed 103) and now considering 553/659 (removed 106) transitions.
// Phase 1: matrix 553 rows 441 cols
[2024-06-02 19:00:33] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 19:00:33] [INFO ] Implicit Places using invariants in 92 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 440/544 places, 553/659 transitions.
Applied a total of 0 rules in 4 ms. Remains 440 /440 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 440/544 places, 553/659 transitions.
[2024-06-02 19:00:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:33] [INFO ] Input system was already deterministic with 553 transitions.
[2024-06-02 19:00:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9323247291509440154.gal : 2 ms
[2024-06-02 19:00:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9839407066178026768.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9323247291509440154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9839407066178026768.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.39512e+08,1.07696,41176,2,5693,5,115861,6,0,2311,199600,0


Converting to forward existential form...Done !
original formula: AX(AF((EF((p733==1)) + AX(EX((p144==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((E(TRUE U (p733==1)) + !(EX(!(EX((p144==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t52, t54, t57, t101, t1...457
(forward)formula 0,1,20.6358,585652,1,0,744,3.418e+06,1134,491,13436,2.25553e+06,1169
FORMULA CO4-PT-18-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 500 transition count 615
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 500 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 500 transition count 614
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 124 place count 465 transition count 579
Iterating global reduction 1 with 35 rules applied. Total rules applied 159 place count 465 transition count 579
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 161 place count 465 transition count 577
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 173 place count 453 transition count 565
Iterating global reduction 2 with 12 rules applied. Total rules applied 185 place count 453 transition count 565
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 188 place count 450 transition count 562
Iterating global reduction 2 with 3 rules applied. Total rules applied 191 place count 450 transition count 562
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 192 place count 449 transition count 561
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 449 transition count 561
Applied a total of 193 rules in 44 ms. Remains 449 /544 variables (removed 95) and now considering 561/659 (removed 98) transitions.
// Phase 1: matrix 561 rows 449 cols
[2024-06-02 19:00:54] [INFO ] Computed 5 invariants in 9 ms
[2024-06-02 19:00:54] [INFO ] Implicit Places using invariants in 99 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 448/544 places, 561/659 transitions.
Applied a total of 0 rules in 5 ms. Remains 448 /448 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 448/544 places, 561/659 transitions.
[2024-06-02 19:00:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:54] [INFO ] Input system was already deterministic with 561 transitions.
[2024-06-02 19:00:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:00:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12163340800140555270.gal : 2 ms
[2024-06-02 19:00:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12615500275647725790.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12163340800140555270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12615500275647725790.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.5111e+08,1.27787,46004,2,5796,5,131793,6,0,2351,233104,0


Converting to forward existential form...Done !
original formula: ((AX(EG(AX((EX((p586==1)) + EG((p561==1)))))) + !(E(EX((p534==1)) U !((((p634==1)||(p745==1)) * AG((p901==1))))))) + EG((EG((p937==1)) * ...175
=> equivalent forward existential formula: ([(FwdU(((Init * !(EG((EG((p937==1)) * E(TRUE U EG((p337==0))))))) * !(!(EX(!(EG(!(EX(!((EX((p586==1)) + EG((p56...406
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t34, t39, t48, t50, t51, t54, t55, t56, t58, t61, t10...462
Detected timeout of ITS tools.
[2024-06-02 19:01:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:01:24] [INFO ] Applying decomposition
[2024-06-02 19:01:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10982757582806521510.txt' '-o' '/tmp/graph10982757582806521510.bin' '-w' '/tmp/graph10982757582806521510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10982757582806521510.bin' '-l' '-1' '-v' '-w' '/tmp/graph10982757582806521510.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:01:24] [INFO ] Decomposing Gal with order
[2024-06-02 19:01:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:01:24] [INFO ] Removed a total of 162 redundant transitions.
[2024-06-02 19:01:24] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-02 19:01:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11800322893913537113.gal : 3 ms
[2024-06-02 19:01:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13151188035764947875.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11800322893913537113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13151188035764947875.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.5111e+08,0.238739,13564,693,86,17093,3152,873,31425,95,14356,0


Converting to forward existential form...Done !
original formula: ((AX(EG(AX((EX((i11.u96.p586==1)) + EG((i10.u89.p561==1)))))) + !(E(EX((i9.u82.p534==1)) U !((((i13.u106.p634==1)||(i16.u129.p745==1)) * ...241
=> equivalent forward existential formula: ([(FwdU(((Init * !(EG((EG((i19.u163.p937==1)) * E(TRUE U EG((i1.u40.p337==0))))))) * !(!(EX(!(EG(!(EX(!((EX((i11...511
Reverse transition relation is NOT exact ! Due to transitions t18, t61, t190, t306, t350, t396, t427, t439, t467, t476, t503, t505, i0.t458, i1.t436, i1.u1...708
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,21.2085,628684,1,0,977108,6504,7797,3.35166e+06,580,30148,1014049
FORMULA CO4-PT-18-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Graph (trivial) has 543 edges and 544 vertex of which 3 / 544 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 816 edges and 542 vertex of which 536 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 535 transition count 392
Reduce places removed 257 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 260 rules applied. Total rules applied 519 place count 278 transition count 389
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 525 place count 277 transition count 384
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 530 place count 272 transition count 384
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 530 place count 272 transition count 349
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 600 place count 237 transition count 349
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 613 place count 224 transition count 336
Iterating global reduction 4 with 13 rules applied. Total rules applied 626 place count 224 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 628 place count 224 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 629 place count 223 transition count 334
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 629 place count 223 transition count 330
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 637 place count 219 transition count 330
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 642 place count 214 transition count 325
Iterating global reduction 6 with 5 rules applied. Total rules applied 647 place count 214 transition count 325
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 703 place count 186 transition count 296
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 706 place count 186 transition count 293
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 711 place count 181 transition count 288
Iterating global reduction 7 with 5 rules applied. Total rules applied 716 place count 181 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 718 place count 180 transition count 287
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 719 place count 179 transition count 286
Iterating global reduction 7 with 1 rules applied. Total rules applied 720 place count 179 transition count 286
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 721 place count 178 transition count 284
Iterating global reduction 7 with 1 rules applied. Total rules applied 722 place count 178 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 723 place count 178 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 736 place count 178 transition count 270
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 8 rules applied. Total rules applied 744 place count 178 transition count 262
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 752 place count 170 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 754 place count 169 transition count 261
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 755 place count 169 transition count 261
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 757 place count 167 transition count 259
Applied a total of 757 rules in 52 ms. Remains 167 /544 variables (removed 377) and now considering 259/659 (removed 400) transitions.
// Phase 1: matrix 259 rows 167 cols
[2024-06-02 19:01:45] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:01:45] [INFO ] Implicit Places using invariants in 52 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 166/544 places, 259/659 transitions.
Applied a total of 0 rules in 4 ms. Remains 166 /166 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 110 ms. Remains : 166/544 places, 259/659 transitions.
[2024-06-02 19:01:45] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:01:45] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:01:45] [INFO ] Input system was already deterministic with 259 transitions.
[2024-06-02 19:01:45] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:01:45] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:01:45] [INFO ] Time to serialize gal into /tmp/CTLFireability11484592367840146394.gal : 1 ms
[2024-06-02 19:01:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6005637631610002424.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11484592367840146394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6005637631610002424.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61448e+06,0.113645,8072,2,855,5,14851,6,0,913,20677,0


Converting to forward existential form...Done !
original formula: ((EF(((((p475==1)&&(p892!=1))||(p646==0)) * AG((p449!=1)))) + EG((((p720==1)||((p316==0)&&(p297==0)))||(p656==0)))) + EF(((!(A((p418==1) ...226
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (((p475==1)&&(p892!=1))||(p646==0))) * !(E(TRUE U !((p449!=1)))))] != FALSE + [FwdG(Init,...380
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t26, t45, t78, t94, t99, t161, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,1,0.852007,36728,1,0,313,180833,540,175,5448,108613,528
FORMULA CO4-PT-18-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 495 transition count 610
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 495 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 495 transition count 609
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 137 place count 457 transition count 571
Iterating global reduction 1 with 38 rules applied. Total rules applied 175 place count 457 transition count 571
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 177 place count 457 transition count 569
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 191 place count 443 transition count 555
Iterating global reduction 2 with 14 rules applied. Total rules applied 205 place count 443 transition count 555
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 439 transition count 551
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 439 transition count 551
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 437 transition count 549
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 437 transition count 549
Applied a total of 217 rules in 34 ms. Remains 437 /544 variables (removed 107) and now considering 549/659 (removed 110) transitions.
// Phase 1: matrix 549 rows 437 cols
[2024-06-02 19:01:46] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:01:46] [INFO ] Implicit Places using invariants in 101 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/544 places, 549/659 transitions.
Applied a total of 0 rules in 5 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 436/544 places, 549/659 transitions.
[2024-06-02 19:01:46] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:01:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:01:46] [INFO ] Input system was already deterministic with 549 transitions.
[2024-06-02 19:01:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:01:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:01:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1579644110952558880.gal : 2 ms
[2024-06-02 19:01:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7402537319783356595.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1579644110952558880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7402537319783356595.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.25979e+08,1.12671,41164,2,5630,5,114937,6,0,2291,199569,0


Converting to forward existential form...Done !
original formula: EF(EX(EG((p228==0))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),(p228==0))] != FALSE
Hit Full ! (commute/partial/dont) 547/0/2
(forward)formula 0,1,6.59639,191756,1,0,28,1.02792e+06,19,4,10471,366724,27
FORMULA CO4-PT-18-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 496 transition count 611
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 496 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 496 transition count 610
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 134 place count 459 transition count 573
Iterating global reduction 1 with 37 rules applied. Total rules applied 171 place count 459 transition count 573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 459 transition count 571
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 187 place count 445 transition count 557
Iterating global reduction 2 with 14 rules applied. Total rules applied 201 place count 445 transition count 557
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 441 transition count 553
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 441 transition count 553
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 211 place count 439 transition count 551
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 439 transition count 551
Applied a total of 213 rules in 45 ms. Remains 439 /544 variables (removed 105) and now considering 551/659 (removed 108) transitions.
// Phase 1: matrix 551 rows 439 cols
[2024-06-02 19:01:53] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 19:01:53] [INFO ] Implicit Places using invariants in 96 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 438/544 places, 551/659 transitions.
Applied a total of 0 rules in 4 ms. Remains 438 /438 variables (removed 0) and now considering 551/551 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 438/544 places, 551/659 transitions.
[2024-06-02 19:01:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:01:53] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:01:53] [INFO ] Input system was already deterministic with 551 transitions.
[2024-06-02 19:01:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:01:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:01:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1122154895193618598.gal : 2 ms
[2024-06-02 19:01:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10527961555657190777.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1122154895193618598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10527961555657190777.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.31561e+08,1.08732,41428,2,5652,5,115895,6,0,2301,202082,0


Converting to forward existential form...Done !
original formula: EF((((AG((p400==1)) + EG((A((p529==1) U (p524==1)) * EX((p635==1))))) + (EF(EX((p202==1))) + (p296==1))) + (p546==1)))
=> equivalent forward existential formula: ((([(FwdU(Init,TRUE) * !(E(TRUE U !((p400==1)))))] != FALSE + [FwdG(FwdU(Init,TRUE),(!((E(!((p524==1)) U (!((p52...376
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
Detected timeout of ITS tools.
[2024-06-02 19:02:23] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:02:23] [INFO ] Applying decomposition
[2024-06-02 19:02:23] [INFO ] Flatten gal took : 8 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/graph16544693471926954721.txt' '-o' '/tmp/graph16544693471926954721.bin' '-w' '/tmp/graph16544693471926954721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16544693471926954721.bin' '-l' '-1' '-v' '-w' '/tmp/graph16544693471926954721.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:02:23] [INFO ] Decomposing Gal with order
[2024-06-02 19:02:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:02:23] [INFO ] Removed a total of 162 redundant transitions.
[2024-06-02 19:02:23] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:02:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-06-02 19:02:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10112402127650755054.gal : 4 ms
[2024-06-02 19:02:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16691576941255862042.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10112402127650755054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16691576941255862042.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.31561e+08,0.205157,12172,722,95,13700,3304,1023,24977,94,13137,0


Converting to forward existential form...Done !
original formula: EF((((AG((i6.i0.i2.u59.p400==1)) + EG((A((i8.u82.p529==1) U (i14.u81.p524==1)) * EX((i8.u105.p635==1))))) + (EF(EX((i16.u43.p202==1))) + ...194
=> equivalent forward existential formula: ((([(FwdU(Init,TRUE) * !(E(TRUE U !((i6.i0.i2.u59.p400==1)))))] != FALSE + [FwdG(FwdU(Init,TRUE),(!((E(!((i14.u8...450
Reverse transition relation is NOT exact ! Due to transitions t17, t47, t56, t184, t240, t297, t341, t375, t389, t469, t496, t497, i1.i0.t429, i1.i0.i1.u18...745
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,19.6537,538676,1,0,725672,5872,8230,3.62482e+06,533,26922,628890
FORMULA CO4-PT-18-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 498 transition count 613
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 498 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 498 transition count 612
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 129 place count 462 transition count 576
Iterating global reduction 1 with 36 rules applied. Total rules applied 165 place count 462 transition count 576
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 167 place count 462 transition count 574
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 179 place count 450 transition count 562
Iterating global reduction 2 with 12 rules applied. Total rules applied 191 place count 450 transition count 562
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 446 transition count 558
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 446 transition count 558
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 201 place count 444 transition count 556
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 444 transition count 556
Applied a total of 203 rules in 41 ms. Remains 444 /544 variables (removed 100) and now considering 556/659 (removed 103) transitions.
// Phase 1: matrix 556 rows 444 cols
[2024-06-02 19:02:43] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:02:43] [INFO ] Implicit Places using invariants in 89 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/544 places, 556/659 transitions.
Applied a total of 0 rules in 5 ms. Remains 443 /443 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 443/544 places, 556/659 transitions.
[2024-06-02 19:02:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:02:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:02:43] [INFO ] Input system was already deterministic with 556 transitions.
[2024-06-02 19:02:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:02:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:02:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17372668937911102771.gal : 2 ms
[2024-06-02 19:02:43] [INFO ] Time to serialize properties into /tmp/CTLFireability2522481706176905678.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17372668937911102771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2522481706176905678.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.53975e+08,1.28895,46816,2,6216,5,131813,6,0,2326,234067,0


Converting to forward existential form...Done !
original formula: A((((EX(EG((p966==1))) * EX(((p941!=1) + AX((p795==1))))) * (p329==1)) + (!(EG((p667==1))) * (p660==1))) U (EG(!(EF((p460==1)))) + ((p735...173
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!(E(TRUE U (p460==1)))) + ((p735==1)&&(p964==1))))))) * !(E(!((EG(!(E(TRUE U (p460==1)))) +...368
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t26, t29, t38, t49, t53, t59, t104, t138, t150, t168, t189...479
Detected timeout of ITS tools.
[2024-06-02 19:03:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:03:13] [INFO ] Applying decomposition
[2024-06-02 19:03:13] [INFO ] Flatten gal took : 8 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/graph801541781066512041.txt' '-o' '/tmp/graph801541781066512041.bin' '-w' '/tmp/graph801541781066512041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph801541781066512041.bin' '-l' '-1' '-v' '-w' '/tmp/graph801541781066512041.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:03:13] [INFO ] Decomposing Gal with order
[2024-06-02 19:03:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:03:13] [INFO ] Removed a total of 158 redundant transitions.
[2024-06-02 19:03:13] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:03:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-06-02 19:03:14] [INFO ] Time to serialize gal into /tmp/CTLFireability607758595400607013.gal : 3 ms
[2024-06-02 19:03:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14127325303388998935.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability607758595400607013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14127325303388998935.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.53975e+08,0.187906,11340,785,94,13543,1744,982,22741,96,6295,0


Converting to forward existential form...Done !
original formula: A((((EX(EG((i19.u166.p966==1))) * EX(((i19.u165.p941!=1) + AX((i17.u144.p795==1))))) * (i2.u42.p329==1)) + (!(EG((i14.u115.p667==1))) * (...249
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!(E(TRUE U (i7.u71.p460==1)))) + ((i15.u128.p735==1)&&(i19.u162.p964==1))))))) * !(E(!((EG(...494
Reverse transition relation is NOT exact ! Due to transitions t49, t59, t104, t138, t150, t233, t274, t300, t380, t423, t472, t499, t500, i0.t454, i1.i0.t4...763
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 659/659 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 498 transition count 613
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 498 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 498 transition count 612
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 130 place count 461 transition count 575
Iterating global reduction 1 with 37 rules applied. Total rules applied 167 place count 461 transition count 575
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 169 place count 461 transition count 573
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 181 place count 449 transition count 561
Iterating global reduction 2 with 12 rules applied. Total rules applied 193 place count 449 transition count 561
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 445 transition count 557
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 445 transition count 557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 203 place count 443 transition count 555
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 443 transition count 555
Applied a total of 205 rules in 64 ms. Remains 443 /544 variables (removed 101) and now considering 555/659 (removed 104) transitions.
// Phase 1: matrix 555 rows 443 cols
[2024-06-02 19:03:44] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 19:03:44] [INFO ] Implicit Places using invariants in 93 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/544 places, 555/659 transitions.
Applied a total of 0 rules in 4 ms. Remains 442 /442 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 442/544 places, 555/659 transitions.
[2024-06-02 19:03:44] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:03:44] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:03:44] [INFO ] Input system was already deterministic with 555 transitions.
[2024-06-02 19:03:44] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:03:44] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2448185803664533489.gal : 1 ms
[2024-06-02 19:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7621760813710775270.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2448185803664533489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7621760813710775270.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.41479e+08,1.09795,41452,2,5528,5,113894,6,0,2321,208136,0


Converting to forward existential form...Done !
original formula: !(E(EX((p462==1)) U E(EF(((p301==1)&&(p487!=1))) U AF(EX((p845==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX((p462==1))),E(TRUE U ((p301==1)&&(p487!=1)))) * !(EG(!(EX((p845==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t24, t29, t38, t47, t49, t50, t51, t52, t53, t55, t58, t103, t1...457
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 19:04:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:04:14] [INFO ] Applying decomposition
[2024-06-02 19:04:14] [INFO ] Flatten gal took : 8 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/graph11584512633186258189.txt' '-o' '/tmp/graph11584512633186258189.bin' '-w' '/tmp/graph11584512633186258189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11584512633186258189.bin' '-l' '-1' '-v' '-w' '/tmp/graph11584512633186258189.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:04:14] [INFO ] Decomposing Gal with order
[2024-06-02 19:04:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:04:14] [INFO ] Removed a total of 168 redundant transitions.
[2024-06-02 19:04:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:04:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-06-02 19:04:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13439708262551044881.gal : 3 ms
[2024-06-02 19:04:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9289927857736074115.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13439708262551044881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9289927857736074115.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.41479e+08,0.142647,9216,556,90,8815,1449,1018,13729,98,4871,0


Converting to forward existential form...Done !
original formula: !(E(EX((i8.u73.p462==1)) U E(EF(((i4.u35.p301==1)&&(i9.u74.p487!=1))) U AF(EX((i17.u154.p845==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX((i8.u73.p462==1))),E(TRUE U ((i4.u35.p301==1)&&(i9.u74.p487!=1)))) * !(EG(!(EX((i17.u154.p84...174
Reverse transition relation is NOT exact ! Due to transitions t49, t58, t103, t187, t285, t299, t343, t390, t461, t470, t497, t498, i1.t452, i2.t401, i2.i0...732
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
[2024-06-02 19:04:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:04:44] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:04:44] [INFO ] Applying decomposition
[2024-06-02 19:04:44] [INFO ] Flatten gal took : 10 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/graph5845782146649154451.txt' '-o' '/tmp/graph5845782146649154451.bin' '-w' '/tmp/graph5845782146649154451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5845782146649154451.bin' '-l' '-1' '-v' '-w' '/tmp/graph5845782146649154451.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:04:44] [INFO ] Decomposing Gal with order
[2024-06-02 19:04:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:04:44] [INFO ] Removed a total of 180 redundant transitions.
[2024-06-02 19:04:44] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:04:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-06-02 19:04:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2417076029925665718.gal : 4 ms
[2024-06-02 19:04:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5013071024246669738.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2417076029925665718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5013071024246669738.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31646e+09,0.226531,12588,880,91,15616,1644,1172,27117,103,5424,0


Converting to forward existential form...Done !
original formula: A(EF((!(((i23.u206.p938!=1) + A((i13.u121.p582==1) U (i10.u96.p489==1)))) * EG((i19.u142.p661==1)))) U ((A(!((((((i0.u3.p8==1)&&(i3.u85.p...619
=> equivalent forward existential formula: [((Init * !(EG(!(((!((E(!(E((i13.u126.p596==1) U !((E(!(((i20.i1.i1.u174.p785==1)&&(i23.u208.p964==1))) U (!((i2...3583
Reverse transition relation is NOT exact ! Due to transitions t68, t86, t171, t186, t208, t282, t329, t359, t406, t444, t490, t548, t576, t578, i1.i0.t538,...850
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,0,68.7416,1872568,1,0,2.41734e+06,6063,8565,1.35335e+07,555,34508,1853617
FORMULA CO4-PT-18-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A((((EX(EG((i23.u209.p966==1))) * EX(((i23.u207.p941!=1) + AX((i20.i0.i0.u188.p795==1))))) * (i5.u56.p329==1)) + (!(EG((i19.u144.p667==1)...257
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!(E(TRUE U (i11.u90.p460==1)))) + ((i17.u160.p735==1)&&(i23.u208.p964==1))))))) * !(E(!((EG...504
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 1,0,124.776,2203888,1,0,2.86056e+06,6211,4206,1.58547e+07,298,36081,1111311
FORMULA CO4-PT-18-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(E(EX((i11.u95.p462==1)) U E(EF(((i1.i1.i1.u47.p301==1)&&(i10.u96.p487!=1))) U AF(EX((i22.u189.p845==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX((i11.u95.p462==1))),E(TRUE U ((i1.i1.i1.u47.p301==1)&&(i10.u96.p487!=1)))) * !(EG(!(EX((i22....182
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 2,0,213.122,2435084,1,0,3.35736e+06,6343,2445,1.72579e+07,199,36451,583115
FORMULA CO4-PT-18-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 826904 ms.

BK_STOP 1717355298251

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-18, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898600138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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