Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620506200620.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 CloudDeployment-PT-7a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620506200620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 420K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716333488069

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-7a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:18:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:18:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:18:09] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-21 23:18:09] [INFO ] Transformed 264 places.
[2024-05-21 23:18:09] [INFO ] Transformed 1174 transitions.
[2024-05-21 23:18:09] [INFO ] Found NUPN structural information;
[2024-05-21 23:18:09] [INFO ] Parsed PT model containing 264 places and 1174 transitions and 7331 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 154 transitions
Reduce redundant transitions removed 154 transitions.
FORMULA CloudDeployment-PT-7a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 1020/1020 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 250 transition count 1020
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 247 transition count 1017
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 247 transition count 1017
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 244 transition count 1014
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 244 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 242 transition count 1012
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 242 transition count 1012
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 241 transition count 1011
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 241 transition count 1011
Drop transitions (Redundant composition of simpler transitions.) removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 1 with 98 rules applied. Total rules applied 130 place count 241 transition count 913
Applied a total of 130 rules in 141 ms. Remains 241 /264 variables (removed 23) and now considering 913/1020 (removed 107) transitions.
[2024-05-21 23:18:09] [INFO ] Flow matrix only has 466 transitions (discarded 447 similar events)
// Phase 1: matrix 466 rows 241 cols
[2024-05-21 23:18:09] [INFO ] Computed 28 invariants in 13 ms
[2024-05-21 23:18:10] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-21 23:18:10] [INFO ] Flow matrix only has 466 transitions (discarded 447 similar events)
[2024-05-21 23:18:10] [INFO ] Invariant cache hit.
[2024-05-21 23:18:10] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-21 23:18:10] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Running 912 sub problems to find dead transitions.
[2024-05-21 23:18:10] [INFO ] Flow matrix only has 466 transitions (discarded 447 similar events)
[2024-05-21 23:18:10] [INFO ] Invariant cache hit.
[2024-05-21 23:18:10] [INFO ] State equation strengthened by 231 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (OVERLAPS) 465/705 variables, 240/268 constraints. Problems are: Problem set: 0 solved, 912 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 230/498 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 5 (OVERLAPS) 1/706 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/707 variables, and 499 constraints, problems are : Problem set: 0 solved, 912 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, ReadFeed: 230/231 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 912 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (OVERLAPS) 465/705 variables, 240/268 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 230/498 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 912/1410 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/707 variables, and 1410 constraints, problems are : Problem set: 0 solved, 912 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 240/241 constraints, ReadFeed: 230/231 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 0/0 constraints]
After SMT, in 61942ms problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 61969ms
Starting structural reductions in LTL mode, iteration 1 : 241/264 places, 913/1020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62941 ms. Remains : 241/264 places, 913/1020 transitions.
Support contains 44 out of 241 places after structural reductions.
[2024-05-21 23:19:13] [INFO ] Flatten gal took : 158 ms
[2024-05-21 23:19:13] [INFO ] Flatten gal took : 85 ms
[2024-05-21 23:19:13] [INFO ] Input system was already deterministic with 913 transitions.
Support contains 43 out of 241 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (392 resets) in 2054 ms. (19 steps per ms) remains 7/34 properties
BEST_FIRST walk for 40004 steps (23 resets) in 146 ms. (272 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (25 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
[2024-05-21 23:19:14] [INFO ] Flow matrix only has 466 transitions (discarded 447 similar events)
[2024-05-21 23:19:14] [INFO ] Invariant cache hit.
[2024-05-21 23:19:14] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 233/240 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 465/705 variables, 240/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 230/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/706 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/706 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/707 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/707 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, ReadFeed: 231/231 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 233/240 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 465/705 variables, 240/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 230/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Int declared 706/707 variables, and 500 constraints, problems are : Problem set: 1 solved, 0 unsolved in 296 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, ReadFeed: 230/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 719ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CloudDeployment-PT-7a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 122 stabilizing places and 675 stable transitions
Graph (complete) has 2503 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(X(p0))) U p1))))'
Support contains 5 out of 241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 28 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:19:15] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2024-05-21 23:19:15] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 23:19:15] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 23:19:15] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:19:15] [INFO ] Invariant cache hit.
[2024-05-21 23:19:16] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:19:16] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:19:16] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:19:16] [INFO ] Invariant cache hit.
[2024-05-21 23:19:16] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 5 (OVERLAPS) 1/694 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/695 variables, and 487 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 235/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 906/1392 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/695 variables, and 1392 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 234/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
After SMT, in 61580ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61591ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62254 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-00 finished in 62530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 27 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:20:18] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:20:18] [INFO ] Invariant cache hit.
[2024-05-21 23:20:18] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 23:20:18] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:20:18] [INFO ] Invariant cache hit.
[2024-05-21 23:20:18] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:20:18] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:20:18] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:20:18] [INFO ] Invariant cache hit.
[2024-05-21 23:20:18] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 5 (OVERLAPS) 1/694 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/695 variables, and 487 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 235/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 906/1392 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/695 variables, and 1392 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 234/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
After SMT, in 61601ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61610ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62137 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-01 finished in 62300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((X(G(p1))&&F(p0))))))'
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 23 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:21:20] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:21:20] [INFO ] Invariant cache hit.
[2024-05-21 23:21:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 23:21:20] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:21:20] [INFO ] Invariant cache hit.
[2024-05-21 23:21:20] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:21:21] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:21:21] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:21:21] [INFO ] Invariant cache hit.
[2024-05-21 23:21:21] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 5 (OVERLAPS) 1/694 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/695 variables, and 487 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 235/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 906/1392 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/695 variables, and 1392 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 234/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
After SMT, in 61890ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61902ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62409 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (398 resets) in 331 ms. (120 steps per ms) remains 2/3 properties
BEST_FIRST walk for 17872 steps (5 resets) in 59 ms. (297 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 267 edges and 235 vertex of which 62 / 235 are part of one of the 19 SCC in 3 ms
Free SCC test removed 43 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 187 transition count 741
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 187 transition count 741
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 53 place count 166 transition count 832
Drop transitions (Redundant composition of simpler transitions.) removed 142 transitions
Redundant transition composition rules discarded 142 transitions
Iterating global reduction 0 with 142 rules applied. Total rules applied 195 place count 166 transition count 690
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 199 place count 164 transition count 688
Applied a total of 199 rules in 157 ms. Remains 164 /235 variables (removed 71) and now considering 688/907 (removed 219) transitions.
[2024-05-21 23:22:24] [INFO ] Flow matrix only has 274 transitions (discarded 414 similar events)
// Phase 1: matrix 274 rows 164 cols
[2024-05-21 23:22:24] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 23:22:24] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 23:22:24] [INFO ] Flow matrix only has 274 transitions (discarded 414 similar events)
[2024-05-21 23:22:24] [INFO ] Invariant cache hit.
[2024-05-21 23:22:24] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-05-21 23:22:24] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-21 23:22:25] [INFO ] Redundant transitions in 441 ms returned []
Running 687 sub problems to find dead transitions.
[2024-05-21 23:22:25] [INFO ] Flow matrix only has 274 transitions (discarded 414 similar events)
[2024-05-21 23:22:25] [INFO ] Invariant cache hit.
[2024-05-21 23:22:25] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 2 (OVERLAPS) 273/436 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 687 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 5 (OVERLAPS) 1/437 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 7 (OVERLAPS) 1/438 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 375 constraints, problems are : Problem set: 0 solved, 687 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 164/164 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 2 (OVERLAPS) 273/436 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 687/1060 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 6 (OVERLAPS) 1/437 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/438 variables, and 1061 constraints, problems are : Problem set: 0 solved, 687 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 164/164 constraints, ReadFeed: 182/183 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 0/0 constraints]
After SMT, in 61045ms problems are : Problem set: 0 solved, 687 unsolved
Search for dead transitions found 0 dead transitions in 61051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/235 places, 688/907 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62111 ms. Remains : 164/235 places, 688/907 transitions.
Computed a total of 95 stabilizing places and 550 stable transitions
Graph (complete) has 2115 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 95 stabilizing places and 550 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (523 resets) in 290 ms. (137 steps per ms) remains 1/3 properties
BEST_FIRST walk for 16449 steps (4 resets) in 22 ms. (715 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 104 ms.
Built C files in :
/tmp/ltsmin13497175898554005428
[2024-05-21 23:23:27] [INFO ] Computing symmetric may disable matrix : 688 transitions.
[2024-05-21 23:23:27] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:23:27] [INFO ] Computing symmetric may enable matrix : 688 transitions.
[2024-05-21 23:23:27] [INFO ] Computation of Complete enable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:23:27] [INFO ] Computing Do-Not-Accords matrix : 688 transitions.
[2024-05-21 23:23:27] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:23:28] [INFO ] Built C files in 285ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13497175898554005428
Running compilation step : cd /tmp/ltsmin13497175898554005428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2743 ms.
Running link step : cd /tmp/ltsmin13497175898554005428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin13497175898554005428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4867308670664222778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 688/688 transitions.
Applied a total of 0 rules in 35 ms. Remains 164 /164 variables (removed 0) and now considering 688/688 (removed 0) transitions.
[2024-05-21 23:23:42] [INFO ] Flow matrix only has 274 transitions (discarded 414 similar events)
[2024-05-21 23:23:42] [INFO ] Invariant cache hit.
[2024-05-21 23:23:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:23:42] [INFO ] Flow matrix only has 274 transitions (discarded 414 similar events)
[2024-05-21 23:23:42] [INFO ] Invariant cache hit.
[2024-05-21 23:23:42] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-05-21 23:23:43] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-21 23:23:43] [INFO ] Redundant transitions in 495 ms returned []
Running 687 sub problems to find dead transitions.
[2024-05-21 23:23:43] [INFO ] Flow matrix only has 274 transitions (discarded 414 similar events)
[2024-05-21 23:23:43] [INFO ] Invariant cache hit.
[2024-05-21 23:23:43] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 2 (OVERLAPS) 273/436 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 687 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 5 (OVERLAPS) 1/437 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 7 (OVERLAPS) 1/438 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 375 constraints, problems are : Problem set: 0 solved, 687 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 164/164 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 2 (OVERLAPS) 273/436 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 687/1060 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 6 (OVERLAPS) 1/437 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/438 variables, and 1061 constraints, problems are : Problem set: 0 solved, 687 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 164/164 constraints, ReadFeed: 182/183 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 0/0 constraints]
After SMT, in 60909ms problems are : Problem set: 0 solved, 687 unsolved
Search for dead transitions found 0 dead transitions in 60915ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61836 ms. Remains : 164/164 places, 688/688 transitions.
Built C files in :
/tmp/ltsmin14314496483167653491
[2024-05-21 23:24:44] [INFO ] Computing symmetric may disable matrix : 688 transitions.
[2024-05-21 23:24:44] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:44] [INFO ] Computing symmetric may enable matrix : 688 transitions.
[2024-05-21 23:24:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:44] [INFO ] Computing Do-Not-Accords matrix : 688 transitions.
[2024-05-21 23:24:44] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:24:44] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14314496483167653491
Running compilation step : cd /tmp/ltsmin14314496483167653491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2363 ms.
Running link step : cd /tmp/ltsmin14314496483167653491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14314496483167653491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2303261807842661128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:24:59] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:24:59] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:24:59] [INFO ] Time to serialize gal into /tmp/LTL12291462386872065974.gal : 11 ms
[2024-05-21 23:24:59] [INFO ] Time to serialize properties into /tmp/LTL7299841310720252815.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12291462386872065974.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16443458013427381173.hoa' '-atoms' '/tmp/LTL7299841310720252815.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7299841310720252815.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16443458013427381173.hoa
Detected timeout of ITS tools.
[2024-05-21 23:25:14] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:25:14] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:25:14] [INFO ] Time to serialize gal into /tmp/LTL2077794439747667369.gal : 7 ms
[2024-05-21 23:25:14] [INFO ] Time to serialize properties into /tmp/LTL14319448477784087466.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2077794439747667369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14319448477784087466.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(p131==0)"))||(F((X(G("((((p30==0)||(p32==0))||((p47==0)||(p247==0)))||(p262==0))")))&&(F("(p131==0)")))))))
Formula 0 simplified : X(F!"(p131==0)" & G(XF!"((((p30==0)||(p32==0))||((p47==0)||(p247==0)))||(p262==0))" | G!"(p131==0)"))
Detected timeout of ITS tools.
[2024-05-21 23:25:29] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:25:29] [INFO ] Applying decomposition
[2024-05-21 23:25:30] [INFO ] Flatten gal took : 28 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/graph2666536329984447903.txt' '-o' '/tmp/graph2666536329984447903.bin' '-w' '/tmp/graph2666536329984447903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2666536329984447903.bin' '-l' '-1' '-v' '-w' '/tmp/graph2666536329984447903.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:25:30] [INFO ] Decomposing Gal with order
[2024-05-21 23:25:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:25:30] [INFO ] Removed a total of 1171 redundant transitions.
[2024-05-21 23:25:30] [INFO ] Flatten gal took : 185 ms
[2024-05-21 23:25:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 21 ms.
[2024-05-21 23:25:30] [INFO ] Time to serialize gal into /tmp/LTL659697892355570700.gal : 7 ms
[2024-05-21 23:25:30] [INFO ] Time to serialize properties into /tmp/LTL714476654785713737.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL659697892355570700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL714476654785713737.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !((X((G("(i3.u28.p131==0)"))||(F((X(G("((((u61.p30==0)||(u61.p32==0))||((i1.i0.u10.p47==0)||(u61.p247==0)))||(u61.p262==0))")))&&(F("(...178
Formula 0 simplified : X(F!"(i3.u28.p131==0)" & G(XF!"((((u61.p30==0)||(u61.p32==0))||((i1.i0.u10.p47==0)||(u61.p247==0)))||(u61.p262==0))" | G!"(i3.u28.p1...164
Reverse transition relation is NOT exact ! Due to transitions t248, t782, t795, u61.t2, i0.t242, i0.i0.t239, i0.i0.u0.t218.t243, i0.i0.u3.t234, i1.i0.t191,...572
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
51 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.551883,39232,1,0,48060,1137,5027,84209,1306,3821,122848
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-7a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-7a-LTLFireability-02 finished in 250546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Graph (trivial) has 277 edges and 241 vertex of which 69 / 241 are part of one of the 21 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 185 transition count 719
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 185 transition count 719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 184 transition count 718
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 184 transition count 718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 183 transition count 717
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 183 transition count 717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 182 transition count 716
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 182 transition count 716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 181 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 181 transition count 715
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 67 place count 160 transition count 806
Drop transitions (Redundant composition of simpler transitions.) removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 0 with 140 rules applied. Total rules applied 207 place count 160 transition count 666
Applied a total of 207 rules in 95 ms. Remains 160 /241 variables (removed 81) and now considering 666/913 (removed 247) transitions.
[2024-05-21 23:25:31] [INFO ] Flow matrix only has 253 transitions (discarded 413 similar events)
// Phase 1: matrix 253 rows 160 cols
[2024-05-21 23:25:31] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 23:25:31] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 23:25:31] [INFO ] Flow matrix only has 253 transitions (discarded 413 similar events)
[2024-05-21 23:25:31] [INFO ] Invariant cache hit.
[2024-05-21 23:25:31] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-21 23:25:31] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-21 23:25:31] [INFO ] Redundant transitions in 365 ms returned []
Running 665 sub problems to find dead transitions.
[2024-05-21 23:25:31] [INFO ] Flow matrix only has 253 transitions (discarded 413 similar events)
[2024-05-21 23:25:31] [INFO ] Invariant cache hit.
[2024-05-21 23:25:31] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 252/411 variables, 159/187 constraints. Problems are: Problem set: 0 solved, 665 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 168/355 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (OVERLAPS) 1/412 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/413 variables, and 357 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 160/160 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 252/411 variables, 159/187 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 168/355 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 665/1020 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 6 (OVERLAPS) 1/412 variables, 1/1021 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/413 variables, and 1021 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 160/160 constraints, ReadFeed: 168/169 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60782ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/241 places, 666/913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61605 ms. Remains : 160/241 places, 666/913 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-03 finished in 61664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(((X(p1)||(X(p2)&&p1))&&p0))) U p3))'
Support contains 10 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 22 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:26:32] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2024-05-21 23:26:32] [INFO ] Computed 28 invariants in 6 ms
[2024-05-21 23:26:32] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 23:26:32] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:26:32] [INFO ] Invariant cache hit.
[2024-05-21 23:26:33] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:26:33] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:26:33] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:26:33] [INFO ] Invariant cache hit.
[2024-05-21 23:26:33] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 5 (OVERLAPS) 1/694 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/695 variables, and 487 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 235/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 906/1392 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/695 variables, and 1392 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 234/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
After SMT, in 61490ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61501ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62023 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p3), (OR (NOT p3) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-04 finished in 62295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Graph (trivial) has 281 edges and 241 vertex of which 70 / 241 are part of one of the 21 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 184 transition count 702
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 184 transition count 702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 183 transition count 701
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 183 transition count 701
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 182 transition count 700
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 182 transition count 700
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 181 transition count 699
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 181 transition count 699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 180 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 180 transition count 698
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 67 place count 159 transition count 789
Drop transitions (Redundant composition of simpler transitions.) removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 0 with 140 rules applied. Total rules applied 207 place count 159 transition count 649
Applied a total of 207 rules in 116 ms. Remains 159 /241 variables (removed 82) and now considering 649/913 (removed 264) transitions.
[2024-05-21 23:27:35] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
// Phase 1: matrix 251 rows 159 cols
[2024-05-21 23:27:35] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 23:27:35] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-21 23:27:35] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2024-05-21 23:27:35] [INFO ] Invariant cache hit.
[2024-05-21 23:27:35] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-21 23:27:36] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2024-05-21 23:27:36] [INFO ] Redundant transitions in 360 ms returned []
Running 648 sub problems to find dead transitions.
[2024-05-21 23:27:36] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2024-05-21 23:27:36] [INFO ] Invariant cache hit.
[2024-05-21 23:27:36] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 2 (OVERLAPS) 250/408 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 648 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 169/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 5 (OVERLAPS) 1/409 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 357 constraints, problems are : Problem set: 0 solved, 648 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 159/159 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 648 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 2 (OVERLAPS) 250/408 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 169/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 648/1003 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 6 (OVERLAPS) 1/409 variables, 1/1004 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 1004 constraints, problems are : Problem set: 0 solved, 648 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 159/159 constraints, ReadFeed: 169/170 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 0/0 constraints]
After SMT, in 60769ms problems are : Problem set: 0 solved, 648 unsolved
Search for dead transitions found 0 dead transitions in 60776ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/241 places, 649/913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62281 ms. Remains : 159/241 places, 649/913 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Computed a total of 96 stabilizing places and 523 stable transitions
Graph (complete) has 2055 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 96 stabilizing places and 523 stable transitions
Detected a total of 96/159 stabilizing places and 523/649 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
RANDOM walk for 13976 steps (200 resets) in 114 ms. (121 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 649/649 transitions.
Applied a total of 0 rules in 13 ms. Remains 159 /159 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-05-21 23:28:38] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2024-05-21 23:28:38] [INFO ] Invariant cache hit.
[2024-05-21 23:28:38] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 23:28:38] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2024-05-21 23:28:38] [INFO ] Invariant cache hit.
[2024-05-21 23:28:38] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-21 23:28:38] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2024-05-21 23:28:39] [INFO ] Redundant transitions in 397 ms returned []
Running 648 sub problems to find dead transitions.
[2024-05-21 23:28:39] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2024-05-21 23:28:39] [INFO ] Invariant cache hit.
[2024-05-21 23:28:39] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 2 (OVERLAPS) 250/408 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 648 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 169/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 5 (OVERLAPS) 1/409 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 357 constraints, problems are : Problem set: 0 solved, 648 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 159/159 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 648 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 2 (OVERLAPS) 250/408 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 169/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 648/1003 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 6 (OVERLAPS) 1/409 variables, 1/1004 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 1004 constraints, problems are : Problem set: 0 solved, 648 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 159/159 constraints, ReadFeed: 169/170 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 0/0 constraints]
After SMT, in 60736ms problems are : Problem set: 0 solved, 648 unsolved
Search for dead transitions found 0 dead transitions in 60743ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61669 ms. Remains : 159/159 places, 649/649 transitions.
Computed a total of 96 stabilizing places and 523 stable transitions
Graph (complete) has 2055 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 96 stabilizing places and 523 stable transitions
Detected a total of 96/159 stabilizing places and 523/649 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 11175 steps (157 resets) in 50 ms. (219 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Built C files in :
/tmp/ltsmin14154629987359539649
[2024-05-21 23:29:40] [INFO ] Computing symmetric may disable matrix : 649 transitions.
[2024-05-21 23:29:40] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:40] [INFO ] Computing symmetric may enable matrix : 649 transitions.
[2024-05-21 23:29:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:40] [INFO ] Computing Do-Not-Accords matrix : 649 transitions.
[2024-05-21 23:29:40] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:29:40] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14154629987359539649
Running compilation step : cd /tmp/ltsmin14154629987359539649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2204 ms.
Running link step : cd /tmp/ltsmin14154629987359539649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14154629987359539649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7315105188010217376.hoa' '--buchi-type=spotba'
LTSmin run took 5458 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-7a-LTLFireability-05 finished in 133167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||G(p2)||X(X(X(G(p3)))))))'
Support contains 11 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 11 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:29:48] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2024-05-21 23:29:48] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 23:29:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 23:29:48] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:29:48] [INFO ] Invariant cache hit.
[2024-05-21 23:29:48] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:29:48] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:29:48] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:29:48] [INFO ] Invariant cache hit.
[2024-05-21 23:29:48] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 5 (OVERLAPS) 1/694 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/695 variables, and 487 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 235/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 906/1392 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/695 variables, and 1392 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 234/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
After SMT, in 61671ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61681ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62147 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 2631 ms.
Product exploration explored 100000 steps with 50000 reset in 2579 ms.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Detected a total of 116/235 stabilizing places and 669/907 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 10 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-7a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-7a-LTLFireability-06 finished in 67823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 8 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 17 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:30:56] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:30:56] [INFO ] Invariant cache hit.
[2024-05-21 23:30:56] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 23:30:56] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:30:56] [INFO ] Invariant cache hit.
[2024-05-21 23:30:56] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:30:56] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:30:56] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:30:56] [INFO ] Invariant cache hit.
[2024-05-21 23:30:56] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 5 (OVERLAPS) 1/694 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/695 variables, and 487 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 235/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 906/1392 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/695 variables, and 1392 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 234/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
After SMT, in 61584ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61599ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62096 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-07 finished in 62254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Graph (trivial) has 281 edges and 241 vertex of which 70 / 241 are part of one of the 21 SCC in 2 ms
Free SCC test removed 49 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 183 transition count 701
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 183 transition count 701
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 182 transition count 700
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 182 transition count 700
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 181 transition count 699
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 181 transition count 699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 180 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 180 transition count 698
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 67 place count 159 transition count 789
Drop transitions (Redundant composition of simpler transitions.) removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 0 with 140 rules applied. Total rules applied 207 place count 159 transition count 649
Applied a total of 207 rules in 53 ms. Remains 159 /241 variables (removed 82) and now considering 649/913 (removed 264) transitions.
[2024-05-21 23:31:58] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
// Phase 1: matrix 251 rows 159 cols
[2024-05-21 23:31:58] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 23:31:58] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:31:58] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2024-05-21 23:31:58] [INFO ] Invariant cache hit.
[2024-05-21 23:31:58] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-21 23:31:58] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-21 23:31:59] [INFO ] Redundant transitions in 416 ms returned []
Running 648 sub problems to find dead transitions.
[2024-05-21 23:31:59] [INFO ] Flow matrix only has 251 transitions (discarded 398 similar events)
[2024-05-21 23:31:59] [INFO ] Invariant cache hit.
[2024-05-21 23:31:59] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 2 (OVERLAPS) 250/408 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 648 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 169/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 5 (OVERLAPS) 1/409 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 357 constraints, problems are : Problem set: 0 solved, 648 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 159/159 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 648 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 2 (OVERLAPS) 250/408 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 169/355 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 648/1003 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 6 (OVERLAPS) 1/409 variables, 1/1004 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 1004 constraints, problems are : Problem set: 0 solved, 648 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 159/159 constraints, ReadFeed: 169/170 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 0/0 constraints]
After SMT, in 60754ms problems are : Problem set: 0 solved, 648 unsolved
Search for dead transitions found 0 dead transitions in 60759ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/241 places, 649/913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61632 ms. Remains : 159/241 places, 649/913 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-08 finished in 61727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(p0))))||X(G(p1))))'
Support contains 8 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 19 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:33:00] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2024-05-21 23:33:00] [INFO ] Computed 28 invariants in 6 ms
[2024-05-21 23:33:00] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 23:33:00] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:33:00] [INFO ] Invariant cache hit.
[2024-05-21 23:33:00] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:33:00] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:33:00] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:33:00] [INFO ] Invariant cache hit.
[2024-05-21 23:33:00] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 5 (OVERLAPS) 1/694 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/695 variables, and 487 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 235/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 906/1392 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/695 variables, and 1392 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 234/235 constraints, ReadFeed: 224/225 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 0/0 constraints]
After SMT, in 61468ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61477ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62122 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 716 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 94 ms.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 112 ms. Reduced automaton from 19 states, 35 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (393 resets) in 380 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 35648 steps (16 resets) in 231 ms. (153 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 247 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 8 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2024-05-21 23:34:04] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:34:04] [INFO ] Invariant cache hit.
[2024-05-21 23:34:04] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:34:04] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:34:04] [INFO ] Invariant cache hit.
[2024-05-21 23:34:04] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:34:04] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:34:04] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:34:04] [INFO ] Invariant cache hit.
[2024-05-21 23:34:04] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
SMT process timed out in 31503ms, After SMT, problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 31511ms
Finished structural reductions in LTL mode , in 1 iterations and 32273 ms. Remains : 235/235 places, 907/907 transitions.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (378 resets) in 806 ms. (49 steps per ms) remains 1/4 properties
BEST_FIRST walk for 28539 steps (15 resets) in 73 ms. (385 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 321 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 8 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Graph (trivial) has 270 edges and 235 vertex of which 70 / 235 are part of one of the 21 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 179 transition count 697
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 179 transition count 697
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -140
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 36 place count 179 transition count 837
Deduced a syphon composed of 21 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 161 transitions
Redundant transition composition rules discarded 161 transitions
Iterating global reduction 0 with 161 rules applied. Total rules applied 197 place count 179 transition count 676
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 197 rules in 72 ms. Remains 179 /235 variables (removed 56) and now considering 676/907 (removed 231) transitions.
[2024-05-21 23:34:39] [INFO ] Redundant transitions in 936 ms returned []
Running 675 sub problems to find dead transitions.
[2024-05-21 23:34:39] [INFO ] Flow matrix only has 278 transitions (discarded 398 similar events)
// Phase 1: matrix 278 rows 179 cols
[2024-05-21 23:34:39] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 23:34:39] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 2 (OVERLAPS) 277/455 variables, 178/206 constraints. Problems are: Problem set: 28 solved, 647 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 168/374 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/374 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 5 (OVERLAPS) 1/456 variables, 1/375 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/375 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 7 (OVERLAPS) 1/457 variables, 1/376 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/376 constraints. Problems are: Problem set: 28 solved, 647 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/457 variables, and 376 constraints, problems are : Problem set: 28 solved, 647 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 179/179 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 647 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 21/21 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 2 (OVERLAPS) 21/178 variables, 7/28 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/28 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 4 (OVERLAPS) 277/455 variables, 178/206 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 168/374 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 647/1021 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/1021 constraints. Problems are: Problem set: 28 solved, 647 unsolved
At refinement iteration 8 (OVERLAPS) 1/456 variables, 1/1022 constraints. Problems are: Problem set: 28 solved, 647 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/457 variables, and 1022 constraints, problems are : Problem set: 28 solved, 647 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 179/179 constraints, ReadFeed: 168/169 constraints, PredecessorRefiner: 647/675 constraints, Known Traps: 0/0 constraints]
After SMT, in 60755ms problems are : Problem set: 28 solved, 647 unsolved
Search for dead transitions found 28 dead transitions in 60761ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/235 places, 648/907 transitions.
Graph (complete) has 2053 edges and 179 vertex of which 158 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 158 /179 variables (removed 21) and now considering 648/648 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/235 places, 648/907 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61800 ms. Remains : 158/235 places, 648/907 transitions.
Built C files in :
/tmp/ltsmin5550100348140839730
[2024-05-21 23:35:40] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5550100348140839730
Running compilation step : cd /tmp/ltsmin5550100348140839730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1910 ms.
Running link step : cd /tmp/ltsmin5550100348140839730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5550100348140839730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12746537260051992707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 907/907 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2024-05-21 23:35:55] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2024-05-21 23:35:55] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 23:35:55] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:35:55] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:35:55] [INFO ] Invariant cache hit.
[2024-05-21 23:35:55] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:35:55] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:35:56] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:35:56] [INFO ] Invariant cache hit.
[2024-05-21 23:35:56] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
SMT process timed out in 31574ms, After SMT, problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 31585ms
Finished structural reductions in LTL mode , in 1 iterations and 32112 ms. Remains : 235/235 places, 907/907 transitions.
Built C files in :
/tmp/ltsmin12809429843133165361
[2024-05-21 23:36:27] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12809429843133165361
Running compilation step : cd /tmp/ltsmin12809429843133165361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1956 ms.
Running link step : cd /tmp/ltsmin12809429843133165361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12809429843133165361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2488169235886175940.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:36:42] [INFO ] Flatten gal took : 54 ms
[2024-05-21 23:36:42] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:36:42] [INFO ] Time to serialize gal into /tmp/LTL14524812547217233844.gal : 4 ms
[2024-05-21 23:36:42] [INFO ] Time to serialize properties into /tmp/LTL4428717206561471983.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14524812547217233844.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3459619413645234855.hoa' '-atoms' '/tmp/LTL4428717206561471983.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4428717206561471983.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3459619413645234855.hoa
Detected timeout of ITS tools.
[2024-05-21 23:36:57] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:36:57] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:36:57] [INFO ] Time to serialize gal into /tmp/LTL16071636413518445693.gal : 4 ms
[2024-05-21 23:36:57] [INFO ] Time to serialize properties into /tmp/LTL15280373677553322596.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16071636413518445693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15280373677553322596.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("((((p30==1)&&(p32==1))&&((p36==1)&&(p247==1)))&&(p262==1))")U(X(X(X("((((p30==1)&&(p32==1))&&((p36==1)&&(p247==1)))&&(p262==1))"...235
Formula 0 simplified : (!"((((p30==1)&&(p32==1))&&((p36==1)&&(p247==1)))&&(p262==1))" R XXX!"((((p30==1)&&(p32==1))&&((p36==1)&&(p247==1)))&&(p262==1))") &...222
Detected timeout of ITS tools.
[2024-05-21 23:37:13] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:37:13] [INFO ] Applying decomposition
[2024-05-21 23:37:13] [INFO ] Flatten gal took : 29 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/graph4060763884274400560.txt' '-o' '/tmp/graph4060763884274400560.bin' '-w' '/tmp/graph4060763884274400560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4060763884274400560.bin' '-l' '-1' '-v' '-w' '/tmp/graph4060763884274400560.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:37:13] [INFO ] Decomposing Gal with order
[2024-05-21 23:37:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:37:13] [INFO ] Removed a total of 1111 redundant transitions.
[2024-05-21 23:37:13] [INFO ] Flatten gal took : 98 ms
[2024-05-21 23:37:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 27 ms.
[2024-05-21 23:37:13] [INFO ] Time to serialize gal into /tmp/LTL2587128322758542695.gal : 18 ms
[2024-05-21 23:37:13] [INFO ] Time to serialize properties into /tmp/LTL7669547617901133662.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2587128322758542695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7669547617901133662.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((("((((i9.u65.p30==1)&&(i9.u65.p32==1))&&((i1.i1.u8.p36==1)&&(i9.u65.p247==1)))&&(i9.u65.p262==1))")U(X(X(X("((((i9.u65.p30==1)&&(i...347
Formula 0 simplified : (!"((((i9.u65.p30==1)&&(i9.u65.p32==1))&&((i1.i1.u8.p36==1)&&(i9.u65.p247==1)))&&(i9.u65.p262==1))" R XXX!"((((i9.u65.p30==1)&&(i9.u...334
Reverse transition relation is NOT exact ! Due to transitions t248, t782, t795, i0.t242, i0.t219, i0.i0.t226, i0.i0.t234, i0.i0.t239, i0.i0.u3.t748, i0.i1....849
Computing Next relation with stutter on 2 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
497 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.03307,208612,1,0,315023,5678,5256,531582,1753,45159,321402
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-7a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-7a-LTLFireability-09 finished in 259367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p0||G(p1))))&&(p2||X(p3)))))'
Support contains 9 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 21 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:37:19] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:37:19] [INFO ] Invariant cache hit.
[2024-05-21 23:37:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 23:37:19] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:37:19] [INFO ] Invariant cache hit.
[2024-05-21 23:37:19] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:37:19] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:37:19] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:37:19] [INFO ] Invariant cache hit.
[2024-05-21 23:37:19] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
SMT process timed out in 31967ms, After SMT, problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 31979ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32566 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-10 finished in 32855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U p1)&&F(G(!p1))) U (p2||G(p0))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Graph (trivial) has 273 edges and 241 vertex of which 68 / 241 are part of one of the 21 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 187 transition count 730
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 187 transition count 730
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 186 transition count 729
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 186 transition count 729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 185 transition count 728
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 185 transition count 728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 184 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 184 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 183 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 183 transition count 726
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 63 place count 163 transition count 816
Drop transitions (Redundant composition of simpler transitions.) removed 138 transitions
Redundant transition composition rules discarded 138 transitions
Iterating global reduction 0 with 138 rules applied. Total rules applied 201 place count 163 transition count 678
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 163 transition count 678
Applied a total of 202 rules in 68 ms. Remains 163 /241 variables (removed 78) and now considering 678/913 (removed 235) transitions.
[2024-05-21 23:37:52] [INFO ] Flow matrix only has 257 transitions (discarded 421 similar events)
// Phase 1: matrix 257 rows 163 cols
[2024-05-21 23:37:52] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 23:37:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:37:52] [INFO ] Flow matrix only has 257 transitions (discarded 421 similar events)
[2024-05-21 23:37:52] [INFO ] Invariant cache hit.
[2024-05-21 23:37:52] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-21 23:37:52] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-21 23:37:53] [INFO ] Redundant transitions in 442 ms returned []
Running 677 sub problems to find dead transitions.
[2024-05-21 23:37:53] [INFO ] Flow matrix only has 257 transitions (discarded 421 similar events)
[2024-05-21 23:37:53] [INFO ] Invariant cache hit.
[2024-05-21 23:37:53] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 2 (OVERLAPS) 256/418 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 677 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 168/358 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 5 (OVERLAPS) 1/419 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 7 (OVERLAPS) 1/420 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 360 constraints, problems are : Problem set: 0 solved, 677 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 163/163 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 677/677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 677 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 2 (OVERLAPS) 256/418 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 168/358 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 677/1035 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 677 unsolved
SMT process timed out in 61022ms, After SMT, problems are : Problem set: 0 solved, 677 unsolved
Search for dead transitions found 0 dead transitions in 61028ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/241 places, 678/913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61952 ms. Remains : 163/241 places, 678/913 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p1), p1, (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 163 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7a-LTLFireability-11 finished in 62382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0))&&X(p1)) U p2)))'
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 19 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:38:54] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
// Phase 1: matrix 460 rows 235 cols
[2024-05-21 23:38:54] [INFO ] Computed 28 invariants in 5 ms
[2024-05-21 23:38:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:38:54] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:38:54] [INFO ] Invariant cache hit.
[2024-05-21 23:38:54] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:38:55] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:38:55] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:38:55] [INFO ] Invariant cache hit.
[2024-05-21 23:38:55] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
SMT process timed out in 31713ms, After SMT, problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 31722ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32242 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p0), true, (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 2598 ms.
Product exploration explored 100000 steps with 50000 reset in 2542 ms.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Detected a total of 116/235 stabilizing places and 669/907 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-7a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-7a-LTLFireability-14 finished in 37622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 239 transition count 911
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 239 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 237 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 237 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 236 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 236 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 235 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 235 transition count 907
Applied a total of 12 rules in 19 ms. Remains 235 /241 variables (removed 6) and now considering 907/913 (removed 6) transitions.
[2024-05-21 23:39:32] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:39:32] [INFO ] Invariant cache hit.
[2024-05-21 23:39:32] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 23:39:32] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:39:32] [INFO ] Invariant cache hit.
[2024-05-21 23:39:32] [INFO ] State equation strengthened by 225 read => feed constraints.
[2024-05-21 23:39:32] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 906 sub problems to find dead transitions.
[2024-05-21 23:39:32] [INFO ] Flow matrix only has 460 transitions (discarded 447 similar events)
[2024-05-21 23:39:32] [INFO ] Invariant cache hit.
[2024-05-21 23:39:32] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 459/693 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 906 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 224/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 906 unsolved
SMT process timed out in 31706ms, After SMT, problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 31719ms
Starting structural reductions in LTL mode, iteration 1 : 235/241 places, 907/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32273 ms. Remains : 235/241 places, 907/913 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7a-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 2544 ms.
Product exploration explored 100000 steps with 50000 reset in 2541 ms.
Computed a total of 116 stabilizing places and 669 stable transitions
Graph (complete) has 2487 edges and 235 vertex of which 234 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 116 stabilizing places and 669 stable transitions
Detected a total of 116/235 stabilizing places and 669/907 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-7a-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-7a-LTLFireability-15 finished in 37490 ms.
All properties solved by simple procedures.
Total runtime 1320488 ms.

BK_STOP 1716334809783

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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