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.r153-tall-171631151700363.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 gold2023
Input is DoubleExponent-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151700363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 7.3K 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.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.5M 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 DoubleExponent-PT-200-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716433029884

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-200
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 02:57:11] [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-23 02:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:57:11] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2024-05-23 02:57:11] [INFO ] Transformed 10604 places.
[2024-05-23 02:57:11] [INFO ] Transformed 9998 transitions.
[2024-05-23 02:57:11] [INFO ] Parsed PT model containing 10604 places and 9998 transitions and 28194 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-200-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 10604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10600 transition count 9998
Applied a total of 4 rules in 3873 ms. Remains 10600 /10604 variables (removed 4) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 02:57:19] [INFO ] Invariants computation overflowed in 329 ms
[2024-05-23 02:57:20] [INFO ] Implicit Places using invariants in 1246 ms returned []
Implicit Place search using SMT only with invariants took 1269 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 02:57:20] [INFO ] Invariants computation overflowed in 265 ms
[2024-05-23 02:57:21] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10600/10604 places, 9998/9998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6273 ms. Remains : 10600/10604 places, 9998/9998 transitions.
Support contains 42 out of 10600 places after structural reductions.
[2024-05-23 02:57:24] [INFO ] Flatten gal took : 489 ms
[2024-05-23 02:57:24] [INFO ] Flatten gal took : 334 ms
[2024-05-23 02:57:24] [INFO ] Input system was already deterministic with 9998 transitions.
Support contains 41 out of 10600 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 333 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 30855 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 30855 steps, saw 15432 distinct states, run finished after 3004 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 02:57:32] [INFO ] Invariants computation overflowed in 248 ms
[2024-05-23 02:57:57] [INFO ] After 17209ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27
[2024-05-23 02:57:57] [INFO ] After 17221ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 02:57:57] [INFO ] After 25066ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :27
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2346 transitions
Trivial Post-agglo rules discarded 2346 transitions
Performed 2346 trivial Post agglomeration. Transition count delta: 2346
Iterating post reduction 0 with 2349 rules applied. Total rules applied 2350 place count 10597 transition count 7650
Reduce places removed 2346 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 2364 rules applied. Total rules applied 4714 place count 8251 transition count 7632
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 4732 place count 8233 transition count 7632
Performed 404 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 404 Pre rules applied. Total rules applied 4732 place count 8233 transition count 7228
Deduced a syphon composed of 404 places in 788 ms
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 3 with 808 rules applied. Total rules applied 5540 place count 7829 transition count 7228
Performed 1781 Post agglomeration using F-continuation condition.Transition count delta: 1781
Deduced a syphon composed of 1781 places in 356 ms
Reduce places removed 1781 places and 0 transitions.
Iterating global reduction 3 with 3562 rules applied. Total rules applied 9102 place count 6048 transition count 5447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 243 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9304 place count 5947 transition count 5447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 213 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9506 place count 5846 transition count 5447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 267 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9708 place count 5745 transition count 5447
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 202 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 9882 place count 5658 transition count 5447
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9883 place count 5658 transition count 5446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9884 place count 5657 transition count 5446
Free-agglomeration rule (complex) applied 815 times.
Iterating global reduction 4 with 815 rules applied. Total rules applied 10699 place count 5657 transition count 4631
Reduce places removed 815 places and 0 transitions.
Iterating post reduction 4 with 815 rules applied. Total rules applied 11514 place count 4842 transition count 4631
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 808 times.
Drop transitions removed 808 transitions
Iterating global reduction 5 with 808 rules applied. Total rules applied 12322 place count 4842 transition count 4631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12323 place count 4841 transition count 4630
Applied a total of 12323 rules in 9676 ms. Remains 4841 /10600 variables (removed 5759) and now considering 4630/9998 (removed 5368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9684 ms. Remains : 4841/10600 places, 4630/9998 transitions.
Incomplete random walk after 10000 steps, including 1299 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 61113 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61113 steps, saw 30572 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 4630 rows 4841 cols
[2024-05-23 02:58:11] [INFO ] Invariants computation overflowed in 92 ms
[2024-05-23 02:58:37] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2024-05-23 02:59:02] [INFO ] After 21344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2024-05-23 02:59:02] [INFO ] State equation strengthened by 785 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:59:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:59:02] [INFO ] After 25095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 4841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4841/4841 places, 4630/4630 transitions.
Applied a total of 0 rules in 1026 ms. Remains 4841 /4841 variables (removed 0) and now considering 4630/4630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1026 ms. Remains : 4841/4841 places, 4630/4630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4841/4841 places, 4630/4630 transitions.
Applied a total of 0 rules in 1020 ms. Remains 4841 /4841 variables (removed 0) and now considering 4630/4630 (removed 0) transitions.
// Phase 1: matrix 4630 rows 4841 cols
[2024-05-23 02:59:04] [INFO ] Invariants computation overflowed in 137 ms
[2024-05-23 02:59:35] [INFO ] Performed 1291/4841 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:00:05] [INFO ] Performed 2372/4841 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:00:35] [INFO ] Performed 3737/4841 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:00:48] [INFO ] Implicit Places using invariants in 104499 ms returned []
// Phase 1: matrix 4630 rows 4841 cols
[2024-05-23 03:00:48] [INFO ] Invariants computation overflowed in 81 ms
[2024-05-23 03:00:49] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 105488 ms to find 0 implicit places.
[2024-05-23 03:00:50] [INFO ] Redundant transitions in 611 ms returned []
// Phase 1: matrix 4630 rows 4841 cols
[2024-05-23 03:00:50] [INFO ] Invariants computation overflowed in 80 ms
[2024-05-23 03:00:54] [INFO ] Dead Transitions using invariants and state equation in 4639 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111765 ms. Remains : 4841/4841 places, 4630/4630 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.46 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 10599 transition count 7597
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7197
Deduced a syphon composed of 400 places in 752 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 5600 place count 7799 transition count 7197
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 284 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 2 with 3604 rules applied. Total rules applied 9204 place count 5997 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 244 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9406 place count 5896 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 212 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9608 place count 5795 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 207 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9810 place count 5694 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 190 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 10000 place count 5599 transition count 5395
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10001 place count 5599 transition count 5395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10002 place count 5598 transition count 5394
Applied a total of 10002 rules in 6524 ms. Remains 5598 /10600 variables (removed 5002) and now considering 5394/9998 (removed 4604) transitions.
// Phase 1: matrix 5394 rows 5598 cols
[2024-05-23 03:01:02] [INFO ] Invariants computation overflowed in 132 ms
[2024-05-23 03:01:05] [INFO ] Implicit Places using invariants in 3706 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2024-05-23 03:01:06] [INFO ] Invariants computation overflowed in 132 ms
[2024-05-23 03:01:07] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 4788 ms to find 0 implicit places.
[2024-05-23 03:01:07] [INFO ] Redundant transitions in 400 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2024-05-23 03:01:07] [INFO ] Invariants computation overflowed in 125 ms
[2024-05-23 03:01:11] [INFO ] Dead Transitions using invariants and state equation in 3726 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5598/10600 places, 5394/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15455 ms. Remains : 5598/10600 places, 5394/9998 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5410 1) (GEQ s5425 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-00 finished in 15919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3210 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:01:14] [INFO ] Invariants computation overflowed in 226 ms
[2024-05-23 03:01:15] [INFO ] Implicit Places using invariants in 1034 ms returned []
Implicit Place search using SMT only with invariants took 1038 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:01:16] [INFO ] Invariants computation overflowed in 223 ms
[2024-05-23 03:01:16] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5271 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s1850 1) (LT s1955 1)) (OR (LT s4383 1) (LT s4390 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3341 reset in 497 ms.
Product exploration explored 100000 steps with 3319 reset in 422 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 31298 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 31298 steps, saw 15655 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:01:26] [INFO ] Invariants computation overflowed in 229 ms
[2024-05-23 03:01:45] [INFO ] After 19078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2392 transitions
Trivial Post-agglo rules discarded 2392 transitions
Performed 2392 trivial Post agglomeration. Transition count delta: 2392
Iterating post reduction 0 with 2395 rules applied. Total rules applied 2396 place count 10597 transition count 7604
Reduce places removed 2392 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4792 place count 8205 transition count 7600
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 4796 place count 8201 transition count 7600
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4796 place count 8201 transition count 7198
Deduced a syphon composed of 402 places in 729 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5600 place count 7799 transition count 7198
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 270 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9202 place count 5998 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 222 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9404 place count 5897 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 208 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9606 place count 5796 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 201 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9808 place count 5695 transition count 5397
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 202 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9998 place count 5600 transition count 5397
Free-agglomeration rule (complex) applied 800 times.
Iterating global reduction 3 with 800 rules applied. Total rules applied 10798 place count 5600 transition count 4597
Reduce places removed 800 places and 0 transitions.
Iterating post reduction 3 with 800 rules applied. Total rules applied 11598 place count 4800 transition count 4597
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 4 with 801 rules applied. Total rules applied 12399 place count 4800 transition count 4597
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12400 place count 4799 transition count 4596
Applied a total of 12400 rules in 8454 ms. Remains 4799 /10600 variables (removed 5801) and now considering 4596/9998 (removed 5402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8454 ms. Remains : 4799/10600 places, 4596/9998 transitions.
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68962 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68962 steps, saw 34497 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4596 rows 4799 cols
[2024-05-23 03:01:57] [INFO ] Invariants computation overflowed in 76 ms
[2024-05-23 03:01:57] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 03:02:11] [INFO ] After 13082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1067 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 4799/4799 places, 4596/4596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1065 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2024-05-23 03:02:13] [INFO ] Invariants computation overflowed in 76 ms
[2024-05-23 03:02:43] [INFO ] Performed 1074/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:03:14] [INFO ] Performed 1981/4799 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:03:44] [INFO ] Performed 2965/4799 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:04:14] [INFO ] Performed 4221/4799 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:04:14] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:04:14] [INFO ] Implicit Places using invariants in 121065 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2024-05-23 03:04:14] [INFO ] Invariants computation overflowed in 73 ms
[2024-05-23 03:04:15] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 121972 ms to find 0 implicit places.
[2024-05-23 03:04:15] [INFO ] Redundant transitions in 532 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2024-05-23 03:04:15] [INFO ] Invariants computation overflowed in 79 ms
[2024-05-23 03:04:20] [INFO ] Dead Transitions using invariants and state equation in 4765 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128345 ms. Remains : 4799/4799 places, 4596/4596 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2391 transitions
Trivial Post-agglo rules discarded 2391 transitions
Performed 2391 trivial Post agglomeration. Transition count delta: 2391
Iterating post reduction 0 with 2391 rules applied. Total rules applied 2391 place count 10599 transition count 7606
Reduce places removed 2391 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 2395 rules applied. Total rules applied 4786 place count 8208 transition count 7602
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 4790 place count 8204 transition count 7602
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4790 place count 8204 transition count 7200
Deduced a syphon composed of 402 places in 754 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 285 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 3 with 3598 rules applied. Total rules applied 9192 place count 6003 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 231 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9394 place count 5902 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 219 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9596 place count 5801 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 204 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9798 place count 5700 transition count 5401
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 204 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9988 place count 5605 transition count 5401
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 9990 place count 5605 transition count 5401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9991 place count 5604 transition count 5400
Applied a total of 9991 rules in 6121 ms. Remains 5604 /10600 variables (removed 4996) and now considering 5400/9998 (removed 4598) transitions.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:04:27] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-23 03:04:31] [INFO ] Implicit Places using invariants in 3953 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:04:31] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-23 03:04:32] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 5022 ms to find 0 implicit places.
[2024-05-23 03:04:32] [INFO ] Redundant transitions in 332 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:04:32] [INFO ] Invariants computation overflowed in 113 ms
[2024-05-23 03:04:36] [INFO ] Dead Transitions using invariants and state equation in 3684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5604/10600 places, 5400/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15171 ms. Remains : 5604/10600 places, 5400/9998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17770 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 56862 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56862 steps, saw 28444 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:04:40] [INFO ] Invariants computation overflowed in 114 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:05:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:05:05] [INFO ] After 25046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Graph (complete) has 16974 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5602 transition count 5398
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5602 transition count 5397
Deduced a syphon composed of 1 places in 187 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5601 transition count 5397
Free-agglomeration rule (complex) applied 799 times.
Iterating global reduction 1 with 799 rules applied. Total rules applied 804 place count 5601 transition count 4598
Reduce places removed 799 places and 0 transitions.
Iterating post reduction 1 with 799 rules applied. Total rules applied 1603 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 2 with 800 rules applied. Total rules applied 2403 place count 4802 transition count 4598
Applied a total of 2403 rules in 2961 ms. Remains 4802 /5604 variables (removed 802) and now considering 4598/5400 (removed 802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2962 ms. Remains : 4802/5604 places, 4598/5400 transitions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68971 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68971 steps, saw 34501 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:05:12] [INFO ] Invariants computation overflowed in 83 ms
[2024-05-23 03:05:12] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 03:05:25] [INFO ] After 12662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1068 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1068 ms. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1059 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:05:27] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 03:05:58] [INFO ] Performed 1077/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:06:28] [INFO ] Performed 1984/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:06:58] [INFO ] Performed 2973/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:07:28] [INFO ] Performed 4249/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:07:28] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:07:28] [INFO ] Implicit Places using invariants in 121410 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:07:28] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 03:07:29] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 122334 ms to find 0 implicit places.
[2024-05-23 03:07:30] [INFO ] Redundant transitions in 523 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:07:30] [INFO ] Invariants computation overflowed in 84 ms
[2024-05-23 03:07:34] [INFO ] Dead Transitions using invariants and state equation in 4670 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128593 ms. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13899 reset in 264 ms.
Product exploration explored 100000 steps with 13812 reset in 275 ms.
Built C files in :
/tmp/ltsmin4703764544756111499
[2024-05-23 03:07:36] [INFO ] Too many transitions (5400) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:07:36] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4703764544756111499
Running compilation step : cd /tmp/ltsmin4703764544756111499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4703764544756111499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4703764544756111499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Applied a total of 0 rules in 487 ms. Remains 5604 /5604 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:07:40] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-23 03:07:43] [INFO ] Implicit Places using invariants in 3704 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:07:43] [INFO ] Invariants computation overflowed in 102 ms
[2024-05-23 03:07:44] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 4762 ms to find 0 implicit places.
[2024-05-23 03:07:45] [INFO ] Redundant transitions in 341 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:07:45] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-23 03:07:48] [INFO ] Dead Transitions using invariants and state equation in 3494 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9092 ms. Remains : 5604/5604 places, 5400/5400 transitions.
Built C files in :
/tmp/ltsmin14541041266699806819
[2024-05-23 03:07:48] [INFO ] Too many transitions (5400) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:07:48] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14541041266699806819
Running compilation step : cd /tmp/ltsmin14541041266699806819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14541041266699806819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14541041266699806819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 03:07:52] [INFO ] Flatten gal took : 190 ms
[2024-05-23 03:07:52] [INFO ] Flatten gal took : 172 ms
[2024-05-23 03:07:52] [INFO ] Time to serialize gal into /tmp/LTL1191303414531479952.gal : 60 ms
[2024-05-23 03:07:52] [INFO ] Time to serialize properties into /tmp/LTL7315888473662668424.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1191303414531479952.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9349017740969311953.hoa' '-atoms' '/tmp/LTL7315888473662668424.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7315888473662668424.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9349017740969311953.hoa
Detected timeout of ITS tools.
[2024-05-23 03:08:08] [INFO ] Flatten gal took : 155 ms
[2024-05-23 03:08:08] [INFO ] Flatten gal took : 176 ms
[2024-05-23 03:08:08] [INFO ] Time to serialize gal into /tmp/LTL10144025552357128488.gal : 27 ms
[2024-05-23 03:08:08] [INFO ] Time to serialize properties into /tmp/LTL18408559455293828832.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10144025552357128488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18408559455293828832.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p2122<1)||(p2217<1))&&((p4402<1)||(p4409<1)))"))))
Formula 0 simplified : XF!"(((p2122<1)||(p2217<1))&&((p4402<1)||(p4409<1)))"
Detected timeout of ITS tools.
[2024-05-23 03:08:23] [INFO ] Flatten gal took : 149 ms
[2024-05-23 03:08:23] [INFO ] Applying decomposition
[2024-05-23 03:08:24] [INFO ] Flatten gal took : 156 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph935305851765387838.txt' '-o' '/tmp/graph935305851765387838.bin' '-w' '/tmp/graph935305851765387838.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph935305851765387838.bin' '-l' '-1' '-v' '-w' '/tmp/graph935305851765387838.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:08:24] [INFO ] Decomposing Gal with order
[2024-05-23 03:08:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:08:26] [INFO ] Removed a total of 4231 redundant transitions.
[2024-05-23 03:08:27] [INFO ] Flatten gal took : 464 ms
[2024-05-23 03:08:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 170 ms.
[2024-05-23 03:08:27] [INFO ] Time to serialize gal into /tmp/LTL6272406137451677557.gal : 80 ms
[2024-05-23 03:08:27] [INFO ] Time to serialize properties into /tmp/LTL9899626600025036497.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6272406137451677557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9899626600025036497.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i7.u375.p2122<1)||(i8.i0.i0.u389.p2217<1))&&((i14.i0.i0.u875.p4402<1)||(i14.i0.i0.u877.p4409<1)))"))))
Formula 0 simplified : XF!"(((i7.u375.p2122<1)||(i8.i0.i0.u389.p2217<1))&&((i14.i0.i0.u875.p4402<1)||(i14.i0.i0.u877.p4409<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5117249261852727488
[2024-05-23 03:08:42] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5117249261852727488
Running compilation step : cd /tmp/ltsmin5117249261852727488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5117249261852727488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5117249261852727488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-200-LTLFireability-01 finished in 454097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||(p1 U (G(p1)||(p1&&G(p0)))))))))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3299 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:08:49] [INFO ] Invariants computation overflowed in 227 ms
[2024-05-23 03:08:50] [INFO ] Implicit Places using invariants in 1241 ms returned []
Implicit Place search using SMT only with invariants took 1243 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:08:50] [INFO ] Invariants computation overflowed in 223 ms
[2024-05-23 03:08:51] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5608 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(LT s9624 1), p0:(GEQ s2707 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3325 reset in 400 ms.
Product exploration explored 100000 steps with 3320 reset in 420 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 334 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 271 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 28374 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 28374 steps, saw 14197 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:09:02] [INFO ] Invariants computation overflowed in 224 ms
[2024-05-23 03:09:27] [INFO ] After 22964ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-23 03:09:27] [INFO ] After 22976ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 03:09:27] [INFO ] After 25044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:3
[2024-05-23 03:09:52] [INFO ] After 22732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 03:09:52] [INFO ] After 22733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 03:09:52] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2009 ms.
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2403 rules applied. Total rules applied 2404 place count 10597 transition count 7596
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4804 place count 8197 transition count 7596
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 4804 place count 8197 transition count 7197
Deduced a syphon composed of 399 places in 749 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 5602 place count 7798 transition count 7197
Performed 1805 Post agglomeration using F-continuation condition.Transition count delta: 1805
Deduced a syphon composed of 1805 places in 283 ms
Reduce places removed 1805 places and 0 transitions.
Iterating global reduction 2 with 3610 rules applied. Total rules applied 9212 place count 5993 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 226 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9414 place count 5892 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 228 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9616 place count 5791 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 205 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9818 place count 5690 transition count 5392
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 195 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 10006 place count 5596 transition count 5392
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 10803 place count 5596 transition count 4595
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 11600 place count 4799 transition count 4595
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 3 with 801 rules applied. Total rules applied 12401 place count 4799 transition count 4595
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12402 place count 4798 transition count 4594
Applied a total of 12402 rules in 8868 ms. Remains 4798 /10600 variables (removed 5802) and now considering 4594/9998 (removed 5404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8868 ms. Remains : 4798/10600 places, 4594/9998 transitions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 57427 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57427 steps, saw 28721 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 4594 rows 4798 cols
[2024-05-23 03:10:07] [INFO ] Invariants computation overflowed in 64 ms
[2024-05-23 03:10:33] [INFO ] After 23921ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-23 03:10:33] [INFO ] State equation strengthened by 798 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:10:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:10:33] [INFO ] After 25073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 4798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4594/4594 transitions.
Applied a total of 0 rules in 1074 ms. Remains 4798 /4798 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1074 ms. Remains : 4798/4798 places, 4594/4594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4594/4594 transitions.
Applied a total of 0 rules in 1080 ms. Remains 4798 /4798 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
// Phase 1: matrix 4594 rows 4798 cols
[2024-05-23 03:10:37] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-23 03:11:07] [INFO ] Performed 1072/4798 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:11:37] [INFO ] Performed 1980/4798 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:12:08] [INFO ] Performed 2968/4798 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:12:38] [INFO ] Performed 4219/4798 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:12:38] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:12:38] [INFO ] Implicit Places using invariants in 121019 ms returned []
// Phase 1: matrix 4594 rows 4798 cols
[2024-05-23 03:12:38] [INFO ] Invariants computation overflowed in 64 ms
[2024-05-23 03:12:39] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 121988 ms to find 0 implicit places.
[2024-05-23 03:12:39] [INFO ] Redundant transitions in 520 ms returned []
// Phase 1: matrix 4594 rows 4798 cols
[2024-05-23 03:12:39] [INFO ] Invariants computation overflowed in 64 ms
[2024-05-23 03:12:44] [INFO ] Dead Transitions using invariants and state equation in 4813 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128411 ms. Remains : 4798/4798 places, 4594/4594 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (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)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3188 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:12:49] [INFO ] Invariants computation overflowed in 234 ms
[2024-05-23 03:12:50] [INFO ] Implicit Places using invariants in 1076 ms returned []
Implicit Place search using SMT only with invariants took 1079 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:12:50] [INFO ] Invariants computation overflowed in 219 ms
[2024-05-23 03:12:51] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5294 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 339 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 271 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 28552 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 28552 steps, saw 14285 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:13:00] [INFO ] Invariants computation overflowed in 225 ms
[2024-05-23 03:13:25] [INFO ] After 22899ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-23 03:13:25] [INFO ] After 22914ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 03:13:25] [INFO ] After 25051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:3
[2024-05-23 03:13:50] [INFO ] After 22679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 03:13:50] [INFO ] After 22680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-23 03:13:50] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2004 ms.
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2403 rules applied. Total rules applied 2404 place count 10597 transition count 7596
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4804 place count 8197 transition count 7596
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 4804 place count 8197 transition count 7197
Deduced a syphon composed of 399 places in 723 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 5602 place count 7798 transition count 7197
Performed 1805 Post agglomeration using F-continuation condition.Transition count delta: 1805
Deduced a syphon composed of 1805 places in 282 ms
Reduce places removed 1805 places and 0 transitions.
Iterating global reduction 2 with 3610 rules applied. Total rules applied 9212 place count 5993 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 264 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9414 place count 5892 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 210 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9616 place count 5791 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 202 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9818 place count 5690 transition count 5392
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 198 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 10006 place count 5596 transition count 5392
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 10803 place count 5596 transition count 4595
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 11600 place count 4799 transition count 4595
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 3 with 801 rules applied. Total rules applied 12401 place count 4799 transition count 4595
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12402 place count 4798 transition count 4594
Applied a total of 12402 rules in 8467 ms. Remains 4798 /10600 variables (removed 5802) and now considering 4594/9998 (removed 5404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8468 ms. Remains : 4798/10600 places, 4594/9998 transitions.
Incomplete random walk after 10000 steps, including 1286 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 58015 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58015 steps, saw 29015 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 4594 rows 4798 cols
[2024-05-23 03:14:05] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-23 03:14:30] [INFO ] After 24048ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-23 03:14:30] [INFO ] State equation strengthened by 798 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:14:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:14:30] [INFO ] After 25074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 4798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4594/4594 transitions.
Applied a total of 0 rules in 1224 ms. Remains 4798 /4798 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1225 ms. Remains : 4798/4798 places, 4594/4594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4798/4798 places, 4594/4594 transitions.
Applied a total of 0 rules in 1225 ms. Remains 4798 /4798 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
// Phase 1: matrix 4594 rows 4798 cols
[2024-05-23 03:14:34] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-23 03:15:05] [INFO ] Performed 1072/4798 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:15:35] [INFO ] Performed 1980/4798 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:16:06] [INFO ] Performed 2968/4798 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:16:36] [INFO ] Performed 4213/4798 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:16:36] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:16:36] [INFO ] Implicit Places using invariants in 121213 ms returned []
// Phase 1: matrix 4594 rows 4798 cols
[2024-05-23 03:16:36] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-23 03:16:37] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 122220 ms to find 0 implicit places.
[2024-05-23 03:16:37] [INFO ] Redundant transitions in 531 ms returned []
// Phase 1: matrix 4594 rows 4798 cols
[2024-05-23 03:16:37] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-23 03:16:42] [INFO ] Dead Transitions using invariants and state equation in 5289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129273 ms. Remains : 4798/4798 places, 4594/4594 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 378 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 382 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3347 reset in 654 ms.
Product exploration explored 100000 steps with 3326 reset in 652 ms.
Applying partial POR strategy [true, true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10600 transition count 9998
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 2398 place count 10600 transition count 10397
Deduced a syphon composed of 2798 places in 958 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 2798 place count 10600 transition count 10397
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2800 place count 10598 transition count 10395
Deduced a syphon composed of 2796 places in 906 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2802 place count 10598 transition count 10395
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: -400
Deduced a syphon composed of 4598 places in 640 ms
Iterating global reduction 1 with 1802 rules applied. Total rules applied 4604 place count 10598 transition count 10795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4605 place count 10597 transition count 10794
Deduced a syphon composed of 4597 places in 580 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4606 place count 10597 transition count 10794
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -656
Deduced a syphon composed of 4698 places in 584 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4707 place count 10597 transition count 11450
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4808 place count 10496 transition count 11248
Deduced a syphon composed of 4597 places in 564 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4909 place count 10496 transition count 11248
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -654
Deduced a syphon composed of 4698 places in 572 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5010 place count 10496 transition count 11902
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5111 place count 10395 transition count 11700
Deduced a syphon composed of 4597 places in 546 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5212 place count 10395 transition count 11700
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -659
Deduced a syphon composed of 4698 places in 580 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5313 place count 10395 transition count 12359
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5414 place count 10294 transition count 12157
Deduced a syphon composed of 4597 places in 550 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5515 place count 10294 transition count 12157
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -618
Deduced a syphon composed of 4693 places in 582 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 5611 place count 10294 transition count 12775
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 5707 place count 10198 transition count 12583
Deduced a syphon composed of 4597 places in 554 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 5803 place count 10198 transition count 12583
Deduced a syphon composed of 4597 places in 557 ms
Applied a total of 5803 rules in 22496 ms. Remains 10198 /10600 variables (removed 402) and now considering 12583/9998 (removed -2585) transitions.
// Phase 1: matrix 12583 rows 10198 cols
[2024-05-23 03:17:09] [INFO ] Invariants computation overflowed in 266 ms
[2024-05-23 03:17:10] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10198/10600 places, 12583/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23667 ms. Remains : 10198/10600 places, 12583/9998 transitions.
Built C files in :
/tmp/ltsmin9742619368608154935
[2024-05-23 03:17:10] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9742619368608154935
Running compilation step : cd /tmp/ltsmin9742619368608154935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9742619368608154935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9742619368608154935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3247 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:17:16] [INFO ] Invariants computation overflowed in 247 ms
[2024-05-23 03:17:17] [INFO ] Implicit Places using invariants in 1140 ms returned []
Implicit Place search using SMT only with invariants took 1141 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:17:18] [INFO ] Invariants computation overflowed in 252 ms
[2024-05-23 03:17:18] [INFO ] Dead Transitions using invariants and state equation in 1062 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5452 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Built C files in :
/tmp/ltsmin18114644398674750060
[2024-05-23 03:17:20] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18114644398674750060
Running compilation step : cd /tmp/ltsmin18114644398674750060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18114644398674750060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18114644398674750060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 03:17:24] [INFO ] Flatten gal took : 302 ms
[2024-05-23 03:17:24] [INFO ] Flatten gal took : 265 ms
[2024-05-23 03:17:24] [INFO ] Time to serialize gal into /tmp/LTL13229281803263958944.gal : 41 ms
[2024-05-23 03:17:24] [INFO ] Time to serialize properties into /tmp/LTL9756062338658379151.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13229281803263958944.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18234392351116321790.hoa' '-atoms' '/tmp/LTL9756062338658379151.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9756062338658379151.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18234392351116321790.hoa
Detected timeout of ITS tools.
[2024-05-23 03:17:43] [INFO ] Flatten gal took : 274 ms
[2024-05-23 03:17:43] [INFO ] Flatten gal took : 263 ms
[2024-05-23 03:17:43] [INFO ] Time to serialize gal into /tmp/LTL2747493944367169840.gal : 42 ms
[2024-05-23 03:17:43] [INFO ] Time to serialize properties into /tmp/LTL5094002570086757320.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2747493944367169840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5094002570086757320.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(p2895>=1)")||(("(p912<1)")U((G("(p912<1)"))||(("(p912<1)")&&(G("(p2895>=1)"))))))))))
Formula 0 simplified : XXX(!"(p2895>=1)" & (F!"(p2895>=1)" U !"(p912<1)"))
Detected timeout of ITS tools.
[2024-05-23 03:17:58] [INFO ] Flatten gal took : 237 ms
[2024-05-23 03:17:58] [INFO ] Applying decomposition
[2024-05-23 03:17:58] [INFO ] Flatten gal took : 246 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4431167492849994078.txt' '-o' '/tmp/graph4431167492849994078.bin' '-w' '/tmp/graph4431167492849994078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4431167492849994078.bin' '-l' '-1' '-v' '-w' '/tmp/graph4431167492849994078.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:17:59] [INFO ] Decomposing Gal with order
[2024-05-23 03:18:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:18:06] [INFO ] Removed a total of 2852 redundant transitions.
[2024-05-23 03:18:06] [INFO ] Flatten gal took : 405 ms
[2024-05-23 03:18:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 187 ms.
[2024-05-23 03:18:07] [INFO ] Time to serialize gal into /tmp/LTL2675640610883450547.gal : 108 ms
[2024-05-23 03:18:07] [INFO ] Time to serialize properties into /tmp/LTL502083849199637833.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2675640610883450547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL502083849199637833.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(i12.i0.i4.i4.u1162.p2895>=1)")||(("(i35.i1.i2.i5.u4108.p912<1)")U((G("(i35.i1.i2.i5.u4108.p912<1)"))||(("(i35.i1.i2.i5.u41...213
Formula 0 simplified : XXX(!"(i12.i0.i4.i4.u1162.p2895>=1)" & (F!"(i12.i0.i4.i4.u1162.p2895>=1)" U !"(i35.i1.i2.i5.u4108.p912<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9133481979407356192
[2024-05-23 03:18:22] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9133481979407356192
Running compilation step : cd /tmp/ltsmin9133481979407356192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9133481979407356192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9133481979407356192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-200-LTLFireability-02 finished in 579572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(!p1&&X((!p1 U (!p2||G(!p1))))))))'
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2392 transitions
Trivial Post-agglo rules discarded 2392 transitions
Performed 2392 trivial Post agglomeration. Transition count delta: 2392
Iterating post reduction 0 with 2392 rules applied. Total rules applied 2392 place count 10599 transition count 7605
Reduce places removed 2392 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2395 rules applied. Total rules applied 4787 place count 8207 transition count 7602
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4790 place count 8204 transition count 7602
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4790 place count 8204 transition count 7202
Deduced a syphon composed of 400 places in 677 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5590 place count 7804 transition count 7202
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 280 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9192 place count 6003 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 226 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9394 place count 5902 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 214 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9596 place count 5801 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 220 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9798 place count 5700 transition count 5401
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 222 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 9984 place count 5607 transition count 5401
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9985 place count 5607 transition count 5401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9986 place count 5606 transition count 5400
Applied a total of 9986 rules in 6267 ms. Remains 5606 /10600 variables (removed 4994) and now considering 5400/9998 (removed 4598) transitions.
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:18:31] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-23 03:18:35] [INFO ] Implicit Places using invariants in 4125 ms returned []
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:18:35] [INFO ] Invariants computation overflowed in 123 ms
[2024-05-23 03:18:36] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 5387 ms to find 0 implicit places.
[2024-05-23 03:18:37] [INFO ] Redundant transitions in 352 ms returned []
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:18:37] [INFO ] Invariants computation overflowed in 125 ms
[2024-05-23 03:18:40] [INFO ] Dead Transitions using invariants and state equation in 3663 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5606/10600 places, 5400/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15676 ms. Remains : 5606/10600 places, 5400/9998 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1555 1), p1:(AND (GEQ s3470 1) (GEQ s3530 1)), p2:(AND (GEQ s4311 1) (GEQ s4322 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13918 reset in 477 ms.
Product exploration explored 100000 steps with 13799 reset in 447 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17769 edges and 5606 vertex of which 5604 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 141 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 793 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 49411 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49411 steps, saw 24715 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:18:46] [INFO ] Invariants computation overflowed in 120 ms
[2024-05-23 03:19:11] [INFO ] After 23903ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-23 03:19:11] [INFO ] State equation strengthened by 397 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:19:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:19:11] [INFO ] After 25050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 5606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5606/5606 places, 5400/5400 transitions.
Graph (complete) has 16971 edges and 5606 vertex of which 5604 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5604 transition count 5398
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5604 transition count 5397
Deduced a syphon composed of 1 places in 200 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5603 transition count 5397
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 5603 transition count 5396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 5602 transition count 5396
Free-agglomeration rule (complex) applied 800 times.
Iterating global reduction 2 with 800 rules applied. Total rules applied 807 place count 5602 transition count 4596
Reduce places removed 800 places and 0 transitions.
Iterating post reduction 2 with 800 rules applied. Total rules applied 1607 place count 4802 transition count 4596
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 3 with 799 rules applied. Total rules applied 2406 place count 4802 transition count 4596
Applied a total of 2406 rules in 3813 ms. Remains 4802 /5606 variables (removed 804) and now considering 4596/5400 (removed 804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3814 ms. Remains : 4802/5606 places, 4596/5400 transitions.
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 56972 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56972 steps, saw 28496 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 4596 rows 4802 cols
[2024-05-23 03:19:20] [INFO ] Invariants computation overflowed in 92 ms
[2024-05-23 03:19:45] [INFO ] After 24094ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-23 03:19:45] [INFO ] State equation strengthened by 797 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:19:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:19:45] [INFO ] After 25076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 4802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4596/4596 transitions.
Applied a total of 0 rules in 1198 ms. Remains 4802 /4802 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1199 ms. Remains : 4802/4802 places, 4596/4596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4596/4596 transitions.
Applied a total of 0 rules in 1162 ms. Remains 4802 /4802 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4802 cols
[2024-05-23 03:19:47] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-23 03:20:18] [INFO ] Performed 1049/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:20:48] [INFO ] Performed 1953/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:21:18] [INFO ] Performed 2918/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:21:48] [INFO ] Performed 4166/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:21:48] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:21:48] [INFO ] Implicit Places using invariants in 120993 ms returned []
// Phase 1: matrix 4596 rows 4802 cols
[2024-05-23 03:21:48] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-23 03:21:49] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 121987 ms to find 0 implicit places.
[2024-05-23 03:21:50] [INFO ] Redundant transitions in 537 ms returned []
// Phase 1: matrix 4596 rows 4802 cols
[2024-05-23 03:21:50] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 03:21:54] [INFO ] Dead Transitions using invariants and state equation in 4577 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128274 ms. Remains : 4802/4802 places, 4596/4596 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 151 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Support contains 5 out of 5606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5606/5606 places, 5400/5400 transitions.
Applied a total of 0 rules in 487 ms. Remains 5606 /5606 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:21:56] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-23 03:22:00] [INFO ] Implicit Places using invariants in 4089 ms returned []
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:22:00] [INFO ] Invariants computation overflowed in 106 ms
[2024-05-23 03:22:01] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 5165 ms to find 0 implicit places.
[2024-05-23 03:22:01] [INFO ] Redundant transitions in 351 ms returned []
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:22:02] [INFO ] Invariants computation overflowed in 114 ms
[2024-05-23 03:22:05] [INFO ] Dead Transitions using invariants and state equation in 3500 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9521 ms. Remains : 5606/5606 places, 5400/5400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17769 edges and 5606 vertex of which 5604 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 126 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 1364 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 802 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 809 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 52244 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52244 steps, saw 26128 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:22:09] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 03:22:34] [INFO ] After 23986ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-23 03:22:34] [INFO ] State equation strengthened by 397 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:22:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:22:34] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 5606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5606/5606 places, 5400/5400 transitions.
Graph (complete) has 16971 edges and 5606 vertex of which 5604 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5604 transition count 5398
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5604 transition count 5397
Deduced a syphon composed of 1 places in 192 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5603 transition count 5397
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 5603 transition count 5396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 5602 transition count 5396
Free-agglomeration rule (complex) applied 800 times.
Iterating global reduction 2 with 800 rules applied. Total rules applied 807 place count 5602 transition count 4596
Reduce places removed 800 places and 0 transitions.
Iterating post reduction 2 with 800 rules applied. Total rules applied 1607 place count 4802 transition count 4596
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 3 with 799 rules applied. Total rules applied 2406 place count 4802 transition count 4596
Applied a total of 2406 rules in 3458 ms. Remains 4802 /5606 variables (removed 804) and now considering 4596/5400 (removed 804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3458 ms. Remains : 4802/5606 places, 4596/5400 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 57779 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57779 steps, saw 28901 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 4596 rows 4802 cols
[2024-05-23 03:22:42] [INFO ] Invariants computation overflowed in 84 ms
[2024-05-23 03:23:07] [INFO ] After 24104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-23 03:23:08] [INFO ] State equation strengthened by 797 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:23:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:23:08] [INFO ] After 25067ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 4802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4596/4596 transitions.
Applied a total of 0 rules in 1081 ms. Remains 4802 /4802 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1081 ms. Remains : 4802/4802 places, 4596/4596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4596/4596 transitions.
Applied a total of 0 rules in 1085 ms. Remains 4802 /4802 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4802 cols
[2024-05-23 03:23:10] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 03:23:40] [INFO ] Performed 1090/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:24:10] [INFO ] Performed 2004/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:24:40] [INFO ] Performed 2996/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:25:10] [INFO ] Performed 4298/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:25:10] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:25:10] [INFO ] Implicit Places using invariants in 120776 ms returned []
// Phase 1: matrix 4596 rows 4802 cols
[2024-05-23 03:25:11] [INFO ] Invariants computation overflowed in 80 ms
[2024-05-23 03:25:11] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 121736 ms to find 0 implicit places.
[2024-05-23 03:25:12] [INFO ] Redundant transitions in 521 ms returned []
// Phase 1: matrix 4596 rows 4802 cols
[2024-05-23 03:25:12] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-23 03:25:17] [INFO ] Dead Transitions using invariants and state equation in 4718 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128069 ms. Remains : 4802/4802 places, 4596/4596 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 127 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2))]
Product exploration explored 100000 steps with 13902 reset in 294 ms.
Product exploration explored 100000 steps with 13923 reset in 309 ms.
Built C files in :
/tmp/ltsmin17776367001543228809
[2024-05-23 03:25:18] [INFO ] Too many transitions (5400) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:25:18] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17776367001543228809
Running compilation step : cd /tmp/ltsmin17776367001543228809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17776367001543228809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17776367001543228809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 5606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5606/5606 places, 5400/5400 transitions.
Applied a total of 0 rules in 480 ms. Remains 5606 /5606 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:25:22] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 03:25:26] [INFO ] Implicit Places using invariants in 3837 ms returned []
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:25:26] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-23 03:25:27] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 4857 ms to find 0 implicit places.
[2024-05-23 03:25:27] [INFO ] Redundant transitions in 328 ms returned []
// Phase 1: matrix 5400 rows 5606 cols
[2024-05-23 03:25:27] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 03:25:31] [INFO ] Dead Transitions using invariants and state equation in 3659 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9330 ms. Remains : 5606/5606 places, 5400/5400 transitions.
Built C files in :
/tmp/ltsmin1613753403717982356
[2024-05-23 03:25:31] [INFO ] Too many transitions (5400) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:25:31] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1613753403717982356
Running compilation step : cd /tmp/ltsmin1613753403717982356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1613753403717982356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1613753403717982356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 03:25:34] [INFO ] Flatten gal took : 136 ms
[2024-05-23 03:25:34] [INFO ] Flatten gal took : 141 ms
[2024-05-23 03:25:34] [INFO ] Time to serialize gal into /tmp/LTL2225094290309764053.gal : 22 ms
[2024-05-23 03:25:34] [INFO ] Time to serialize properties into /tmp/LTL392381087010276090.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2225094290309764053.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7276872825679795826.hoa' '-atoms' '/tmp/LTL392381087010276090.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL392381087010276090.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7276872825679795826.hoa
Detected timeout of ITS tools.
[2024-05-23 03:25:50] [INFO ] Flatten gal took : 138 ms
[2024-05-23 03:25:50] [INFO ] Flatten gal took : 145 ms
[2024-05-23 03:25:50] [INFO ] Time to serialize gal into /tmp/LTL15213295731198030313.gal : 23 ms
[2024-05-23 03:25:50] [INFO ] Time to serialize properties into /tmp/LTL463099756233611222.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15213295731198030313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL463099756233611222.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(p3107>=1)")||((X((!("((p6363>=1)&&(p6459>=1))"))U((!("((p7797>=1)&&(p7816>=1))"))||(G(!("((p6363>=1)&&(p6459>=1))"))))))&&("((...181
Formula 0 simplified : F(!"(p3107>=1)" & (!"((p6363<1)||(p6459<1))" | X("((p6363>=1)&&(p6459>=1))" M "((p7797>=1)&&(p7816>=1))")))
Detected timeout of ITS tools.
[2024-05-23 03:26:05] [INFO ] Flatten gal took : 152 ms
[2024-05-23 03:26:05] [INFO ] Applying decomposition
[2024-05-23 03:26:06] [INFO ] Flatten gal took : 140 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9493966990262777896.txt' '-o' '/tmp/graph9493966990262777896.bin' '-w' '/tmp/graph9493966990262777896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9493966990262777896.bin' '-l' '-1' '-v' '-w' '/tmp/graph9493966990262777896.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:26:06] [INFO ] Decomposing Gal with order
[2024-05-23 03:26:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:26:07] [INFO ] Removed a total of 4253 redundant transitions.
[2024-05-23 03:26:08] [INFO ] Flatten gal took : 256 ms
[2024-05-23 03:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 99 ms.
[2024-05-23 03:26:08] [INFO ] Time to serialize gal into /tmp/LTL7215648272139523156.gal : 129 ms
[2024-05-23 03:26:08] [INFO ] Time to serialize properties into /tmp/LTL5377932811958936924.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7215648272139523156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5377932811958936924.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(i10.i0.i1.u571.p3107>=1)")||((X((!("((i19.u1298.p6363>=1)&&(i19.u1323.p6459>=1))"))U((!("((i24.u1640.p7797>=1)&&(i24.u1622.p78...276
Formula 0 simplified : F(!"(i10.i0.i1.u571.p3107>=1)" & (!"((i19.u1298.p6363<1)||(i19.u1323.p6459<1))" | X("((i19.u1298.p6363>=1)&&(i19.u1323.p6459>=1))" M...205
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4695053627345810670
[2024-05-23 03:26:23] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4695053627345810670
Running compilation step : cd /tmp/ltsmin4695053627345810670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4695053627345810670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4695053627345810670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-200-LTLFireability-03 finished in 481290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U G(p1)))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2392 transitions
Trivial Post-agglo rules discarded 2392 transitions
Performed 2392 trivial Post agglomeration. Transition count delta: 2392
Iterating post reduction 0 with 2392 rules applied. Total rules applied 2392 place count 10599 transition count 7605
Reduce places removed 2392 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2395 rules applied. Total rules applied 4787 place count 8207 transition count 7602
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4790 place count 8204 transition count 7602
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4790 place count 8204 transition count 7201
Deduced a syphon composed of 401 places in 747 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5592 place count 7803 transition count 7201
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 277 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9196 place count 6001 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 224 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9398 place count 5900 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 223 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9600 place count 5799 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 202 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9802 place count 5698 transition count 5399
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 190 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9992 place count 5603 transition count 5399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9993 place count 5602 transition count 5398
Applied a total of 9993 rules in 5687 ms. Remains 5602 /10600 variables (removed 4998) and now considering 5398/9998 (removed 4600) transitions.
// Phase 1: matrix 5398 rows 5602 cols
[2024-05-23 03:26:32] [INFO ] Invariants computation overflowed in 113 ms
[2024-05-23 03:26:35] [INFO ] Implicit Places using invariants in 3563 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2024-05-23 03:26:35] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-23 03:26:36] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 4549 ms to find 0 implicit places.
[2024-05-23 03:26:37] [INFO ] Redundant transitions in 332 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2024-05-23 03:26:37] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-23 03:26:40] [INFO ] Dead Transitions using invariants and state equation in 3608 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5602/10600 places, 5398/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14181 ms. Remains : 5602/10600 places, 5398/9998 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3974 1) (GEQ s3984 1)), p0:(AND (GEQ s1227 1) (GEQ s1235 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-04 finished in 14500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(p1 U G(!p2)))))))'
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3158 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:26:44] [INFO ] Invariants computation overflowed in 228 ms
[2024-05-23 03:26:45] [INFO ] Implicit Places using invariants in 1091 ms returned []
Implicit Place search using SMT only with invariants took 1092 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:26:45] [INFO ] Invariants computation overflowed in 224 ms
[2024-05-23 03:26:46] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5244 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), true, p2, p2]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s4003 1), p2:(AND (GEQ s3204 1) (GEQ s3239 1)), p1:(AND (GEQ s4617 1) (GEQ s4722 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3326 reset in 434 ms.
Product exploration explored 100000 steps with 3322 reset in 475 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, p2, p2, p2, p2]
Incomplete random walk after 10000 steps, including 330 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 30852 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 30852 steps, saw 15431 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:26:55] [INFO ] Invariants computation overflowed in 226 ms
[2024-05-23 03:27:20] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2401 place count 10597 transition count 7599
Reduce places removed 2397 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4800 place count 8200 transition count 7597
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4802 place count 8198 transition count 7597
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4802 place count 8198 transition count 7196
Deduced a syphon composed of 401 places in 743 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5604 place count 7797 transition count 7196
Performed 1804 Post agglomeration using F-continuation condition.Transition count delta: 1804
Deduced a syphon composed of 1804 places in 281 ms
Reduce places removed 1804 places and 0 transitions.
Iterating global reduction 3 with 3608 rules applied. Total rules applied 9212 place count 5993 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 238 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9414 place count 5892 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 210 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9616 place count 5791 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 208 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9818 place count 5690 transition count 5392
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 192 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 10006 place count 5596 transition count 5392
Free-agglomeration rule (complex) applied 798 times.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10804 place count 5596 transition count 4594
Reduce places removed 798 places and 0 transitions.
Iterating post reduction 3 with 798 rules applied. Total rules applied 11602 place count 4798 transition count 4594
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 4 with 800 rules applied. Total rules applied 12402 place count 4798 transition count 4594
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12403 place count 4797 transition count 4593
Applied a total of 12403 rules in 8388 ms. Remains 4797 /10600 variables (removed 5803) and now considering 4593/9998 (removed 5405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8389 ms. Remains : 4797/10600 places, 4593/9998 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68251 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68251 steps, saw 34137 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4593 rows 4797 cols
[2024-05-23 03:27:32] [INFO ] Invariants computation overflowed in 98 ms
[2024-05-23 03:27:57] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 4797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4593/4593 transitions.
Applied a total of 0 rules in 1066 ms. Remains 4797 /4797 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1066 ms. Remains : 4797/4797 places, 4593/4593 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4593/4593 transitions.
Applied a total of 0 rules in 1064 ms. Remains 4797 /4797 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
// Phase 1: matrix 4593 rows 4797 cols
[2024-05-23 03:28:00] [INFO ] Invariants computation overflowed in 97 ms
[2024-05-23 03:28:30] [INFO ] Performed 1098/4797 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:29:00] [INFO ] Performed 2048/4797 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:29:30] [INFO ] Performed 3048/4797 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:30:01] [INFO ] Performed 4350/4797 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:30:01] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:30:01] [INFO ] Implicit Places using invariants in 121072 ms returned []
// Phase 1: matrix 4593 rows 4797 cols
[2024-05-23 03:30:01] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-23 03:30:01] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 122001 ms to find 0 implicit places.
[2024-05-23 03:30:02] [INFO ] Redundant transitions in 525 ms returned []
// Phase 1: matrix 4593 rows 4797 cols
[2024-05-23 03:30:02] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-23 03:30:07] [INFO ] Dead Transitions using invariants and state equation in 4645 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128249 ms. Remains : 4797/4797 places, 4593/4593 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, p2, p2, p2, p2]
Stuttering acceptance computed with spot in 249 ms :[true, p2, p2, p2, p2]
Support contains 2 out of 10600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3186 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:30:11] [INFO ] Invariants computation overflowed in 222 ms
[2024-05-23 03:30:12] [INFO ] Implicit Places using invariants in 1056 ms returned []
Implicit Place search using SMT only with invariants took 1057 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:30:12] [INFO ] Invariants computation overflowed in 220 ms
[2024-05-23 03:30:13] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5258 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, p2, p2, p2, p2]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 32356 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32356 steps, saw 16184 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:30:21] [INFO ] Invariants computation overflowed in 239 ms
[2024-05-23 03:30:46] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2401 place count 10597 transition count 7599
Reduce places removed 2397 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4800 place count 8200 transition count 7597
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4802 place count 8198 transition count 7597
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4802 place count 8198 transition count 7196
Deduced a syphon composed of 401 places in 732 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5604 place count 7797 transition count 7196
Performed 1804 Post agglomeration using F-continuation condition.Transition count delta: 1804
Deduced a syphon composed of 1804 places in 277 ms
Reduce places removed 1804 places and 0 transitions.
Iterating global reduction 3 with 3608 rules applied. Total rules applied 9212 place count 5993 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 219 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9414 place count 5892 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 211 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9616 place count 5791 transition count 5392
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 202 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9818 place count 5690 transition count 5392
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 200 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 10006 place count 5596 transition count 5392
Free-agglomeration rule (complex) applied 798 times.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10804 place count 5596 transition count 4594
Reduce places removed 798 places and 0 transitions.
Iterating post reduction 3 with 798 rules applied. Total rules applied 11602 place count 4798 transition count 4594
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 4 with 800 rules applied. Total rules applied 12402 place count 4798 transition count 4594
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12403 place count 4797 transition count 4593
Applied a total of 12403 rules in 8418 ms. Remains 4797 /10600 variables (removed 5803) and now considering 4593/9998 (removed 5405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8418 ms. Remains : 4797/10600 places, 4593/9998 transitions.
Incomplete random walk after 10000 steps, including 1309 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68704 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68704 steps, saw 34370 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4593 rows 4797 cols
[2024-05-23 03:30:59] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-23 03:31:24] [INFO ] After 25044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 4797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4593/4593 transitions.
Applied a total of 0 rules in 1063 ms. Remains 4797 /4797 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 4797/4797 places, 4593/4593 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4593/4593 transitions.
Applied a total of 0 rules in 1080 ms. Remains 4797 /4797 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
// Phase 1: matrix 4593 rows 4797 cols
[2024-05-23 03:31:26] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-23 03:31:56] [INFO ] Performed 1072/4797 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:32:26] [INFO ] Performed 1993/4797 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:32:56] [INFO ] Performed 2968/4797 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:33:27] [INFO ] Performed 4244/4797 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:33:27] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:33:27] [INFO ] Implicit Places using invariants in 120918 ms returned []
// Phase 1: matrix 4593 rows 4797 cols
[2024-05-23 03:33:27] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-23 03:33:28] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 121891 ms to find 0 implicit places.
[2024-05-23 03:33:28] [INFO ] Redundant transitions in 520 ms returned []
// Phase 1: matrix 4593 rows 4797 cols
[2024-05-23 03:33:28] [INFO ] Invariants computation overflowed in 100 ms
[2024-05-23 03:33:33] [INFO ] Dead Transitions using invariants and state equation in 4877 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128374 ms. Remains : 4797/4797 places, 4593/4593 transitions.
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, p2, p2, p2, p2]
Stuttering acceptance computed with spot in 133 ms :[true, p2, p2, p2, p2]
Stuttering acceptance computed with spot in 169 ms :[true, p2, p2, p2, p2]
Product exploration explored 100000 steps with 3305 reset in 368 ms.
Product exploration explored 100000 steps with 3325 reset in 380 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[true, p2, p2, p2, p2]
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2397 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2397 rules applied. Total rules applied 2397 place count 10600 transition count 9998
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 402 Pre rules applied. Total rules applied 2397 place count 10600 transition count 10398
Deduced a syphon composed of 2799 places in 960 ms
Iterating global reduction 1 with 402 rules applied. Total rules applied 2799 place count 10600 transition count 10398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2801 place count 10598 transition count 10396
Deduced a syphon composed of 2797 places in 848 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2803 place count 10598 transition count 10396
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: -400
Deduced a syphon composed of 4598 places in 613 ms
Iterating global reduction 1 with 1801 rules applied. Total rules applied 4604 place count 10598 transition count 10796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4605 place count 10597 transition count 10795
Deduced a syphon composed of 4597 places in 556 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4606 place count 10597 transition count 10795
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -656
Deduced a syphon composed of 4698 places in 555 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4707 place count 10597 transition count 11451
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4808 place count 10496 transition count 11249
Deduced a syphon composed of 4597 places in 538 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4909 place count 10496 transition count 11249
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -652
Deduced a syphon composed of 4698 places in 537 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5010 place count 10496 transition count 11901
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5111 place count 10395 transition count 11699
Deduced a syphon composed of 4597 places in 521 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5212 place count 10395 transition count 11699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -659
Deduced a syphon composed of 4698 places in 530 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5313 place count 10395 transition count 12358
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5414 place count 10294 transition count 12156
Deduced a syphon composed of 4597 places in 518 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5515 place count 10294 transition count 12156
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -619
Deduced a syphon composed of 4693 places in 574 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 5611 place count 10294 transition count 12775
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 5707 place count 10198 transition count 12583
Deduced a syphon composed of 4597 places in 543 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 5803 place count 10198 transition count 12583
Deduced a syphon composed of 4597 places in 540 ms
Applied a total of 5803 rules in 20474 ms. Remains 10198 /10600 variables (removed 402) and now considering 12583/9998 (removed -2585) transitions.
// Phase 1: matrix 12583 rows 10198 cols
[2024-05-23 03:33:56] [INFO ] Invariants computation overflowed in 204 ms
[2024-05-23 03:33:57] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10198/10600 places, 12583/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21488 ms. Remains : 10198/10600 places, 12583/9998 transitions.
Built C files in :
/tmp/ltsmin14944515588459748781
[2024-05-23 03:33:57] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14944515588459748781
Running compilation step : cd /tmp/ltsmin14944515588459748781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14944515588459748781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14944515588459748781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3171 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:34:03] [INFO ] Invariants computation overflowed in 224 ms
[2024-05-23 03:34:04] [INFO ] Implicit Places using invariants in 1063 ms returned []
Implicit Place search using SMT only with invariants took 1069 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:34:04] [INFO ] Invariants computation overflowed in 234 ms
[2024-05-23 03:34:05] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5270 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Built C files in :
/tmp/ltsmin7865433061208621453
[2024-05-23 03:34:07] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7865433061208621453
Running compilation step : cd /tmp/ltsmin7865433061208621453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7865433061208621453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7865433061208621453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 03:34:10] [INFO ] Flatten gal took : 213 ms
[2024-05-23 03:34:10] [INFO ] Flatten gal took : 221 ms
[2024-05-23 03:34:10] [INFO ] Time to serialize gal into /tmp/LTL8141717476930526061.gal : 33 ms
[2024-05-23 03:34:10] [INFO ] Time to serialize properties into /tmp/LTL5400684061877976248.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8141717476930526061.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7000642261846955661.hoa' '-atoms' '/tmp/LTL5400684061877976248.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5400684061877976248.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7000642261846955661.hoa
Detected timeout of ITS tools.
[2024-05-23 03:34:29] [INFO ] Flatten gal took : 211 ms
[2024-05-23 03:34:29] [INFO ] Flatten gal took : 218 ms
[2024-05-23 03:34:29] [INFO ] Time to serialize gal into /tmp/LTL7247560844963526914.gal : 32 ms
[2024-05-23 03:34:29] [INFO ] Time to serialize properties into /tmp/LTL4401303102323533667.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7247560844963526914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4401303102323533667.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p4060>=1)")||(("((p4613>=1)&&(p4708>=1))")U(G(!("((p3341>=1)&&(p3373>=1))")))))))))
Formula 0 simplified : XXF(!"(p4060>=1)" & (!"((p4613>=1)&&(p4708>=1))" R F"((p3341>=1)&&(p3373>=1))"))
Detected timeout of ITS tools.
[2024-05-23 03:34:44] [INFO ] Flatten gal took : 223 ms
[2024-05-23 03:34:44] [INFO ] Applying decomposition
[2024-05-23 03:34:44] [INFO ] Flatten gal took : 236 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6831116571315011422.txt' '-o' '/tmp/graph6831116571315011422.bin' '-w' '/tmp/graph6831116571315011422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6831116571315011422.bin' '-l' '-1' '-v' '-w' '/tmp/graph6831116571315011422.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:34:45] [INFO ] Decomposing Gal with order
[2024-05-23 03:34:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:34:52] [INFO ] Removed a total of 2827 redundant transitions.
[2024-05-23 03:34:52] [INFO ] Flatten gal took : 377 ms
[2024-05-23 03:34:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 134 ms.
[2024-05-23 03:34:53] [INFO ] Time to serialize gal into /tmp/LTL1525979002827572199.gal : 86 ms
[2024-05-23 03:34:53] [INFO ] Time to serialize properties into /tmp/LTL13187366065271966666.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1525979002827572199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13187366065271966666.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i15.u1719.p4060>=1)")||(("((i17.i0.i1.i0.u1976.p4613>=1)&&(i17.i0.i1.i0.u1991.p4708>=1))")U(G(!("((i11.i1.i0.i1.u1390.p334...202
Formula 0 simplified : XXF(!"(i15.u1719.p4060>=1)" & (!"((i17.i0.i1.i0.u1976.p4613>=1)&&(i17.i0.i1.i0.u1991.p4708>=1))" R F"((i11.i1.i0.i1.u1390.p3341>=1)&...189
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin20783482656898649
[2024-05-23 03:35:08] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin20783482656898649
Running compilation step : cd /tmp/ltsmin20783482656898649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin20783482656898649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin20783482656898649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-200-LTLFireability-05 finished in 510488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 10599 transition count 7597
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7197
Deduced a syphon composed of 400 places in 726 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 5600 place count 7799 transition count 7197
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 273 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 2 with 3604 rules applied. Total rules applied 9204 place count 5997 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 223 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9406 place count 5896 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 208 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9608 place count 5795 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 193 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9810 place count 5694 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 192 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 10000 place count 5599 transition count 5395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10001 place count 5598 transition count 5394
Applied a total of 10001 rules in 5471 ms. Remains 5598 /10600 variables (removed 5002) and now considering 5394/9998 (removed 4604) transitions.
// Phase 1: matrix 5394 rows 5598 cols
[2024-05-23 03:35:17] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-23 03:35:20] [INFO ] Implicit Places using invariants in 3793 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2024-05-23 03:35:20] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-23 03:35:21] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 4856 ms to find 0 implicit places.
[2024-05-23 03:35:22] [INFO ] Redundant transitions in 333 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2024-05-23 03:35:22] [INFO ] Invariants computation overflowed in 113 ms
[2024-05-23 03:35:25] [INFO ] Dead Transitions using invariants and state equation in 3563 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5598/10600 places, 5394/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14228 ms. Remains : 5598/10600 places, 5394/9998 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s95 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-06 finished in 14490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 3 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2394 transitions
Trivial Post-agglo rules discarded 2394 transitions
Performed 2394 trivial Post agglomeration. Transition count delta: 2394
Iterating post reduction 0 with 2394 rules applied. Total rules applied 2394 place count 10599 transition count 7603
Reduce places removed 2394 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4790 place count 8205 transition count 7601
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4792 place count 8203 transition count 7601
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4792 place count 8203 transition count 7200
Deduced a syphon composed of 401 places in 736 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 278 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9198 place count 6000 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 219 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9400 place count 5899 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 211 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9602 place count 5798 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 197 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9804 place count 5697 transition count 5398
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 195 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9994 place count 5602 transition count 5398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9995 place count 5601 transition count 5397
Applied a total of 9995 rules in 5610 ms. Remains 5601 /10600 variables (removed 4999) and now considering 5397/9998 (removed 4601) transitions.
// Phase 1: matrix 5397 rows 5601 cols
[2024-05-23 03:35:31] [INFO ] Invariants computation overflowed in 102 ms
[2024-05-23 03:35:35] [INFO ] Implicit Places using invariants in 3550 ms returned []
// Phase 1: matrix 5397 rows 5601 cols
[2024-05-23 03:35:35] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-23 03:35:36] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 4600 ms to find 0 implicit places.
[2024-05-23 03:35:36] [INFO ] Redundant transitions in 319 ms returned []
// Phase 1: matrix 5397 rows 5601 cols
[2024-05-23 03:35:36] [INFO ] Invariants computation overflowed in 98 ms
[2024-05-23 03:35:40] [INFO ] Dead Transitions using invariants and state equation in 3627 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5601/10600 places, 5397/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14163 ms. Remains : 5601/10600 places, 5397/9998 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s571 1), p1:(AND (GEQ s795 1) (GEQ s803 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-08 finished in 14533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)))))'
Support contains 1 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3115 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:35:43] [INFO ] Invariants computation overflowed in 221 ms
[2024-05-23 03:35:44] [INFO ] Implicit Places using invariants in 1065 ms returned []
Implicit Place search using SMT only with invariants took 1067 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:35:44] [INFO ] Invariants computation overflowed in 219 ms
[2024-05-23 03:35:45] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5195 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s6123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4780 ms.
Product exploration explored 100000 steps with 33333 reset in 4662 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-200-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-200-LTLFireability-09 finished in 16397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||F(p1))))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3148 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:36:00] [INFO ] Invariants computation overflowed in 222 ms
[2024-05-23 03:36:01] [INFO ] Implicit Places using invariants in 993 ms returned []
Implicit Place search using SMT only with invariants took 997 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:36:01] [INFO ] Invariants computation overflowed in 221 ms
[2024-05-23 03:36:02] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5226 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(LT s7690 1), p0:(AND (GEQ s7690 1) (GEQ s7934 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6803 ms.
Product exploration explored 100000 steps with 50000 reset in 6814 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-200-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-200-LTLFireability-10 finished in 20669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 10599 transition count 7597
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7197
Deduced a syphon composed of 400 places in 697 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 5600 place count 7799 transition count 7197
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 278 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 2 with 3598 rules applied. Total rules applied 9198 place count 6000 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 264 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9400 place count 5899 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 212 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9602 place count 5798 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 209 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9804 place count 5697 transition count 5398
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 192 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 9994 place count 5602 transition count 5398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9995 place count 5601 transition count 5397
Applied a total of 9995 rules in 5539 ms. Remains 5601 /10600 variables (removed 4999) and now considering 5397/9998 (removed 4601) transitions.
// Phase 1: matrix 5397 rows 5601 cols
[2024-05-23 03:36:23] [INFO ] Invariants computation overflowed in 126 ms
[2024-05-23 03:36:27] [INFO ] Implicit Places using invariants in 3970 ms returned []
// Phase 1: matrix 5397 rows 5601 cols
[2024-05-23 03:36:27] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-23 03:36:28] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 5048 ms to find 0 implicit places.
[2024-05-23 03:36:28] [INFO ] Redundant transitions in 324 ms returned []
// Phase 1: matrix 5397 rows 5601 cols
[2024-05-23 03:36:28] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-23 03:36:32] [INFO ] Dead Transitions using invariants and state equation in 3611 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5601/10600 places, 5397/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14530 ms. Remains : 5601/10600 places, 5397/9998 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4719 1) (GEQ s4478 1)), p0:(LT s4719 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-11 finished in 14839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2397 rules applied. Total rules applied 2397 place count 10599 transition count 7600
Reduce places removed 2397 places and 0 transitions.
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4794 place count 8202 transition count 7600
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 4794 place count 8202 transition count 7201
Deduced a syphon composed of 399 places in 679 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 5592 place count 7803 transition count 7201
Performed 1803 Post agglomeration using F-continuation condition.Transition count delta: 1803
Deduced a syphon composed of 1803 places in 283 ms
Reduce places removed 1803 places and 0 transitions.
Iterating global reduction 2 with 3606 rules applied. Total rules applied 9198 place count 6000 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 263 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9400 place count 5899 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 208 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9602 place count 5798 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 201 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9804 place count 5697 transition count 5398
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 188 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 9992 place count 5603 transition count 5398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9993 place count 5602 transition count 5397
Applied a total of 9993 rules in 5548 ms. Remains 5602 /10600 variables (removed 4998) and now considering 5397/9998 (removed 4601) transitions.
// Phase 1: matrix 5397 rows 5602 cols
[2024-05-23 03:36:38] [INFO ] Invariants computation overflowed in 109 ms
[2024-05-23 03:36:41] [INFO ] Implicit Places using invariants in 3937 ms returned []
// Phase 1: matrix 5397 rows 5602 cols
[2024-05-23 03:36:42] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-23 03:36:42] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 4979 ms to find 0 implicit places.
[2024-05-23 03:36:43] [INFO ] Redundant transitions in 325 ms returned []
// Phase 1: matrix 5397 rows 5602 cols
[2024-05-23 03:36:43] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-23 03:36:46] [INFO ] Dead Transitions using invariants and state equation in 3669 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5602/10600 places, 5397/9998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14530 ms. Remains : 5602/10600 places, 5397/9998 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4408 1), p1:(GEQ s187 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-13 finished in 14886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((G(p1)||X(X(F(p2)))))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3201 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:36:50] [INFO ] Invariants computation overflowed in 226 ms
[2024-05-23 03:36:51] [INFO ] Implicit Places using invariants in 1012 ms returned []
Implicit Place search using SMT only with invariants took 1013 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:36:51] [INFO ] Invariants computation overflowed in 219 ms
[2024-05-23 03:36:52] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5266 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s6974 1) (GEQ s7000 1)), p2:(GEQ s10106 1), p1:(GEQ s7300 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-14 finished in 7019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||((F(p1) U G(p2)) U X(p1)))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3217 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:36:57] [INFO ] Invariants computation overflowed in 226 ms
[2024-05-23 03:36:58] [INFO ] Implicit Places using invariants in 1072 ms returned []
Implicit Place search using SMT only with invariants took 1073 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-23 03:36:58] [INFO ] Invariants computation overflowed in 218 ms
[2024-05-23 03:36:59] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5276 ms. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(GEQ s3420 1), p1:(GEQ s10018 1), p2:(AND (GEQ s10506 1) (GEQ s10527 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-15 finished in 7052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : DoubleExponent-PT-200-LTLFireability-01
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2391 transitions
Trivial Post-agglo rules discarded 2391 transitions
Performed 2391 trivial Post agglomeration. Transition count delta: 2391
Iterating post reduction 0 with 2391 rules applied. Total rules applied 2391 place count 10599 transition count 7606
Reduce places removed 2391 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 2395 rules applied. Total rules applied 4786 place count 8208 transition count 7602
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 4790 place count 8204 transition count 7602
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4790 place count 8204 transition count 7200
Deduced a syphon composed of 402 places in 723 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 280 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 3 with 3598 rules applied. Total rules applied 9192 place count 6003 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 221 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9394 place count 5902 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 211 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9596 place count 5801 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 199 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9798 place count 5700 transition count 5401
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 195 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9988 place count 5605 transition count 5401
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 9990 place count 5605 transition count 5401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9991 place count 5604 transition count 5400
Applied a total of 9991 rules in 5982 ms. Remains 5604 /10600 variables (removed 4996) and now considering 5400/9998 (removed 4598) transitions.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:37:07] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-23 03:37:11] [INFO ] Implicit Places using invariants in 3746 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:37:11] [INFO ] Invariants computation overflowed in 102 ms
[2024-05-23 03:37:12] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 4754 ms to find 0 implicit places.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:37:12] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-23 03:37:15] [INFO ] Dead Transitions using invariants and state equation in 3633 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5604/10600 places, 5400/9998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14371 ms. Remains : 5604/10600 places, 5400/9998 transitions.
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s978 1) (LT s1040 1)) (OR (LT s2320 1) (LT s2327 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13874 reset in 267 ms.
Product exploration explored 100000 steps with 13792 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17770 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 798 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 59028 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59028 steps, saw 29527 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:37:20] [INFO ] Invariants computation overflowed in 117 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:37:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:37:45] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Graph (complete) has 16974 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5602 transition count 5398
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5602 transition count 5397
Deduced a syphon composed of 1 places in 185 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5601 transition count 5397
Free-agglomeration rule (complex) applied 799 times.
Iterating global reduction 1 with 799 rules applied. Total rules applied 804 place count 5601 transition count 4598
Reduce places removed 799 places and 0 transitions.
Iterating post reduction 1 with 799 rules applied. Total rules applied 1603 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 2 with 800 rules applied. Total rules applied 2403 place count 4802 transition count 4598
Applied a total of 2403 rules in 2959 ms. Remains 4802 /5604 variables (removed 802) and now considering 4598/5400 (removed 802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2960 ms. Remains : 4802/5604 places, 4598/5400 transitions.
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 69342 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69342 steps, saw 34681 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:37:52] [INFO ] Invariants computation overflowed in 84 ms
[2024-05-23 03:37:52] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 03:38:05] [INFO ] After 13247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1098 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1100 ms. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1087 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:38:08] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-23 03:38:38] [INFO ] Performed 1077/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:39:08] [INFO ] Performed 2011/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:39:38] [INFO ] Performed 3014/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:40:09] [INFO ] Performed 4305/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:40:09] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:40:09] [INFO ] Implicit Places using invariants in 121265 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:40:09] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-23 03:40:10] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 122175 ms to find 0 implicit places.
[2024-05-23 03:40:10] [INFO ] Redundant transitions in 523 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:40:10] [INFO ] Invariants computation overflowed in 84 ms
[2024-05-23 03:40:15] [INFO ] Dead Transitions using invariants and state equation in 4696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128486 ms. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Support contains 4 out of 5604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Applied a total of 0 rules in 479 ms. Remains 5604 /5604 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:40:16] [INFO ] Invariants computation overflowed in 109 ms
[2024-05-23 03:40:20] [INFO ] Implicit Places using invariants in 3963 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:40:20] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-23 03:40:21] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 5020 ms to find 0 implicit places.
[2024-05-23 03:40:22] [INFO ] Redundant transitions in 334 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:40:22] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 03:40:25] [INFO ] Dead Transitions using invariants and state equation in 3634 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9480 ms. Remains : 5604/5604 places, 5400/5400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17770 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1388 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 58087 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58087 steps, saw 29054 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:40:29] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-23 03:40:54] [INFO ] After 25039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Graph (complete) has 16974 edges and 5604 vertex of which 5602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5602 transition count 5398
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5602 transition count 5397
Deduced a syphon composed of 1 places in 184 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5601 transition count 5397
Free-agglomeration rule (complex) applied 799 times.
Iterating global reduction 1 with 799 rules applied. Total rules applied 804 place count 5601 transition count 4598
Reduce places removed 799 places and 0 transitions.
Iterating post reduction 1 with 799 rules applied. Total rules applied 1603 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 2 with 800 rules applied. Total rules applied 2403 place count 4802 transition count 4598
Applied a total of 2403 rules in 2980 ms. Remains 4802 /5604 variables (removed 802) and now considering 4598/5400 (removed 802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2980 ms. Remains : 4802/5604 places, 4598/5400 transitions.
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 69372 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69372 steps, saw 34697 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:41:01] [INFO ] Invariants computation overflowed in 83 ms
[2024-05-23 03:41:02] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 03:41:15] [INFO ] After 13166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1061 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1061 ms. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1075 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:41:17] [INFO ] Invariants computation overflowed in 84 ms
[2024-05-23 03:41:47] [INFO ] Performed 1077/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:42:18] [INFO ] Performed 2006/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:42:48] [INFO ] Performed 2996/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:43:18] [INFO ] Performed 4277/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:43:18] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:43:18] [INFO ] Implicit Places using invariants in 121017 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:43:18] [INFO ] Invariants computation overflowed in 82 ms
[2024-05-23 03:43:19] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 121981 ms to find 0 implicit places.
[2024-05-23 03:43:19] [INFO ] Redundant transitions in 523 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2024-05-23 03:43:19] [INFO ] Invariants computation overflowed in 84 ms
[2024-05-23 03:43:24] [INFO ] Dead Transitions using invariants and state equation in 4876 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128463 ms. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13758 reset in 282 ms.
Product exploration explored 100000 steps with 13933 reset in 286 ms.
Built C files in :
/tmp/ltsmin676475719887335117
[2024-05-23 03:43:26] [INFO ] Too many transitions (5400) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:43:26] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin676475719887335117
Running compilation step : cd /tmp/ltsmin676475719887335117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin676475719887335117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin676475719887335117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5604/5604 places, 5400/5400 transitions.
Applied a total of 0 rules in 479 ms. Remains 5604 /5604 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:43:29] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-23 03:43:33] [INFO ] Implicit Places using invariants in 3926 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:43:33] [INFO ] Invariants computation overflowed in 113 ms
[2024-05-23 03:43:34] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 4964 ms to find 0 implicit places.
[2024-05-23 03:43:35] [INFO ] Redundant transitions in 326 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2024-05-23 03:43:35] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 03:43:38] [INFO ] Dead Transitions using invariants and state equation in 3755 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9530 ms. Remains : 5604/5604 places, 5400/5400 transitions.
Built C files in :
/tmp/ltsmin15366635902966203216
[2024-05-23 03:43:39] [INFO ] Too many transitions (5400) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:43:39] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15366635902966203216
Running compilation step : cd /tmp/ltsmin15366635902966203216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15366635902966203216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15366635902966203216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 03:43:42] [INFO ] Flatten gal took : 144 ms
[2024-05-23 03:43:42] [INFO ] Flatten gal took : 148 ms
[2024-05-23 03:43:42] [INFO ] Time to serialize gal into /tmp/LTL6866348680244679323.gal : 24 ms
[2024-05-23 03:43:42] [INFO ] Time to serialize properties into /tmp/LTL15591333395187769162.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6866348680244679323.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4490391527314731044.hoa' '-atoms' '/tmp/LTL15591333395187769162.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15591333395187769162.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4490391527314731044.hoa
Detected timeout of ITS tools.
[2024-05-23 03:43:58] [INFO ] Flatten gal took : 139 ms
[2024-05-23 03:43:58] [INFO ] Flatten gal took : 141 ms
[2024-05-23 03:43:58] [INFO ] Time to serialize gal into /tmp/LTL7862833832582388056.gal : 23 ms
[2024-05-23 03:43:58] [INFO ] Time to serialize properties into /tmp/LTL11030560636105077331.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7862833832582388056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11030560636105077331.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p2122<1)||(p2217<1))&&((p4402<1)||(p4409<1)))"))))
Formula 0 simplified : XF!"(((p2122<1)||(p2217<1))&&((p4402<1)||(p4409<1)))"
Detected timeout of ITS tools.
[2024-05-23 03:44:13] [INFO ] Flatten gal took : 140 ms
[2024-05-23 03:44:13] [INFO ] Applying decomposition
[2024-05-23 03:44:13] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11385216678098666758.txt' '-o' '/tmp/graph11385216678098666758.bin' '-w' '/tmp/graph11385216678098666758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11385216678098666758.bin' '-l' '-1' '-v' '-w' '/tmp/graph11385216678098666758.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:44:14] [INFO ] Decomposing Gal with order
[2024-05-23 03:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:44:15] [INFO ] Removed a total of 4167 redundant transitions.
[2024-05-23 03:44:15] [INFO ] Flatten gal took : 253 ms
[2024-05-23 03:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 92 ms.
[2024-05-23 03:44:15] [INFO ] Time to serialize gal into /tmp/LTL466375361505994150.gal : 55 ms
[2024-05-23 03:44:15] [INFO ] Time to serialize properties into /tmp/LTL16807987528237170333.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL466375361505994150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16807987528237170333.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i5.u366.p2122<1)||(i5.u379.p2217<1))&&((i12.u837.p4402<1)||(i12.u836.p4409<1)))"))))
Formula 0 simplified : XF!"(((i5.u366.p2122<1)||(i5.u379.p2217<1))&&((i12.u837.p4402<1)||(i12.u836.p4409<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9684282909199338406
[2024-05-23 03:44:30] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9684282909199338406
Running compilation step : cd /tmp/ltsmin9684282909199338406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9684282909199338406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9684282909199338406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-200-LTLFireability-01 finished in 452414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||(p1 U (G(p1)||(p1&&G(p0)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(!p1&&X((!p1 U (!p2||G(!p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(p1 U G(!p2)))))))'
Found a Lengthening insensitive property : DoubleExponent-PT-200-LTLFireability-05
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), true, p2, p2]
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2390 transitions
Trivial Post-agglo rules discarded 2390 transitions
Performed 2390 trivial Post agglomeration. Transition count delta: 2390
Iterating post reduction 0 with 2390 rules applied. Total rules applied 2390 place count 10599 transition count 7607
Reduce places removed 2390 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 2394 rules applied. Total rules applied 4784 place count 8209 transition count 7603
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 4788 place count 8205 transition count 7603
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4788 place count 8205 transition count 7202
Deduced a syphon composed of 401 places in 713 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5590 place count 7804 transition count 7202
Performed 1800 Post agglomeration using F-continuation condition.Transition count delta: 1800
Deduced a syphon composed of 1800 places in 253 ms
Reduce places removed 1800 places and 0 transitions.
Iterating global reduction 3 with 3600 rules applied. Total rules applied 9190 place count 6004 transition count 5402
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 223 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9392 place count 5903 transition count 5402
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 207 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9594 place count 5802 transition count 5402
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 202 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9796 place count 5701 transition count 5402
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 190 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 9982 place count 5608 transition count 5402
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 9984 place count 5608 transition count 5402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9985 place count 5607 transition count 5401
Applied a total of 9985 rules in 5931 ms. Remains 5607 /10600 variables (removed 4993) and now considering 5401/9998 (removed 4597) transitions.
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:44:40] [INFO ] Invariants computation overflowed in 126 ms
[2024-05-23 03:44:43] [INFO ] Implicit Places using invariants in 3826 ms returned []
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:44:44] [INFO ] Invariants computation overflowed in 139 ms
[2024-05-23 03:44:45] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 4937 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:44:45] [INFO ] Invariants computation overflowed in 125 ms
[2024-05-23 03:44:48] [INFO ] Dead Transitions using invariants and state equation in 3554 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5607/10600 places, 5401/9998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14424 ms. Remains : 5607/10600 places, 5401/9998 transitions.
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s2116 1), p2:(AND (GEQ s1693 1) (GEQ s1711 1)), p1:(AND (GEQ s2444 1) (GEQ s2502 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13860 reset in 259 ms.
Product exploration explored 100000 steps with 13962 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17767 edges and 5607 vertex of which 5605 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, p2, p2, p2, p2]
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 58267 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58267 steps, saw 29143 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:44:53] [INFO ] Invariants computation overflowed in 127 ms
[2024-05-23 03:45:18] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5607/5607 places, 5401/5401 transitions.
Graph (complete) has 16971 edges and 5607 vertex of which 5605 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 5605 transition count 5394
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 5600 transition count 5394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 5600 transition count 5393
Deduced a syphon composed of 1 places in 193 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 5599 transition count 5393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 184 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 5598 transition count 5392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 187 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 5597 transition count 5392
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 816 place count 5597 transition count 4595
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 1613 place count 4800 transition count 4595
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 3 with 799 rules applied. Total rules applied 2412 place count 4800 transition count 4595
Applied a total of 2412 rules in 3889 ms. Remains 4800 /5607 variables (removed 807) and now considering 4595/5401 (removed 806) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3890 ms. Remains : 4800/5607 places, 4595/5401 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68997 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68997 steps, saw 34511 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4595 rows 4800 cols
[2024-05-23 03:45:25] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-23 03:45:50] [INFO ] After 25039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 4800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4800/4800 places, 4595/4595 transitions.
Applied a total of 0 rules in 1077 ms. Remains 4800 /4800 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1077 ms. Remains : 4800/4800 places, 4595/4595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4800/4800 places, 4595/4595 transitions.
Applied a total of 0 rules in 1060 ms. Remains 4800 /4800 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
// Phase 1: matrix 4595 rows 4800 cols
[2024-05-23 03:45:53] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-23 03:46:23] [INFO ] Performed 1075/4800 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:46:54] [INFO ] Performed 2004/4800 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:47:24] [INFO ] Performed 2988/4800 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:47:54] [INFO ] Performed 4249/4800 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:47:54] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:47:54] [INFO ] Implicit Places using invariants in 120965 ms returned []
// Phase 1: matrix 4595 rows 4800 cols
[2024-05-23 03:47:54] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-23 03:47:55] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 121885 ms to find 0 implicit places.
[2024-05-23 03:47:55] [INFO ] Redundant transitions in 522 ms returned []
// Phase 1: matrix 4595 rows 4800 cols
[2024-05-23 03:47:55] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-23 03:48:00] [INFO ] Dead Transitions using invariants and state equation in 4513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127986 ms. Remains : 4800/4800 places, 4595/4595 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, p2, p2, p2, p2]
Stuttering acceptance computed with spot in 144 ms :[true, p2, p2, p2, p2]
Support contains 2 out of 5607 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5607/5607 places, 5401/5401 transitions.
Applied a total of 0 rules in 452 ms. Remains 5607 /5607 variables (removed 0) and now considering 5401/5401 (removed 0) transitions.
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:48:01] [INFO ] Invariants computation overflowed in 128 ms
[2024-05-23 03:48:05] [INFO ] Implicit Places using invariants in 4080 ms returned []
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:48:05] [INFO ] Invariants computation overflowed in 127 ms
[2024-05-23 03:48:06] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 5245 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:48:06] [INFO ] Invariants computation overflowed in 126 ms
[2024-05-23 03:48:10] [INFO ] Dead Transitions using invariants and state equation in 3803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9505 ms. Remains : 5607/5607 places, 5401/5401 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17767 edges and 5607 vertex of which 5605 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, p2, p2, p2, p2]
Incomplete random walk after 10000 steps, including 1408 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 792 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 58164 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58164 steps, saw 29091 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:48:14] [INFO ] Invariants computation overflowed in 129 ms
[2024-05-23 03:48:39] [INFO ] After 25050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5607/5607 places, 5401/5401 transitions.
Graph (complete) has 16971 edges and 5607 vertex of which 5605 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 5605 transition count 5394
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 5600 transition count 5394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 5600 transition count 5393
Deduced a syphon composed of 1 places in 193 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 5599 transition count 5393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 193 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 5598 transition count 5392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 181 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 5597 transition count 5392
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 2 with 797 rules applied. Total rules applied 816 place count 5597 transition count 4595
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 2 with 797 rules applied. Total rules applied 1613 place count 4800 transition count 4595
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 3 with 799 rules applied. Total rules applied 2412 place count 4800 transition count 4595
Applied a total of 2412 rules in 3888 ms. Remains 4800 /5607 variables (removed 807) and now considering 4595/5401 (removed 806) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3888 ms. Remains : 4800/5607 places, 4595/5401 transitions.
Incomplete random walk after 10000 steps, including 1250 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 808 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68765 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68765 steps, saw 34403 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4595 rows 4800 cols
[2024-05-23 03:48:47] [INFO ] Invariants computation overflowed in 74 ms
[2024-05-23 03:49:12] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 4800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4800/4800 places, 4595/4595 transitions.
Applied a total of 0 rules in 1070 ms. Remains 4800 /4800 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1071 ms. Remains : 4800/4800 places, 4595/4595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4800/4800 places, 4595/4595 transitions.
Applied a total of 0 rules in 1073 ms. Remains 4800 /4800 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
// Phase 1: matrix 4595 rows 4800 cols
[2024-05-23 03:49:14] [INFO ] Invariants computation overflowed in 73 ms
[2024-05-23 03:49:45] [INFO ] Performed 1075/4800 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-23 03:50:15] [INFO ] Performed 1983/4800 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-23 03:50:45] [INFO ] Performed 2966/4800 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-23 03:51:15] [INFO ] Performed 4222/4800 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-23 03:51:15] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-23 03:51:15] [INFO ] Implicit Places using invariants in 121021 ms returned []
// Phase 1: matrix 4595 rows 4800 cols
[2024-05-23 03:51:15] [INFO ] Invariants computation overflowed in 65 ms
[2024-05-23 03:51:16] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 121900 ms to find 0 implicit places.
[2024-05-23 03:51:16] [INFO ] Redundant transitions in 518 ms returned []
// Phase 1: matrix 4595 rows 4800 cols
[2024-05-23 03:51:17] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-23 03:51:21] [INFO ] Dead Transitions using invariants and state equation in 4905 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128409 ms. Remains : 4800/4800 places, 4595/4595 transitions.
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, p2, p2, p2, p2]
Stuttering acceptance computed with spot in 170 ms :[true, p2, p2, p2, p2]
Stuttering acceptance computed with spot in 168 ms :[true, p2, p2, p2, p2]
Product exploration explored 100000 steps with 13963 reset in 257 ms.
Product exploration explored 100000 steps with 13846 reset in 269 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 556 ms :[true, p2, p2, p2, p2]
Support contains 2 out of 5607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5607/5607 places, 5401/5401 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5607 transition count 5401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 181 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 5607 transition count 5402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 193 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 5607 transition count 5406
Deduced a syphon composed of 7 places in 183 ms
Applied a total of 7 rules in 1394 ms. Remains 5607 /5607 variables (removed 0) and now considering 5406/5401 (removed -5) transitions.
[2024-05-23 03:51:26] [INFO ] Redundant transitions in 330 ms returned []
// Phase 1: matrix 5406 rows 5607 cols
[2024-05-23 03:51:26] [INFO ] Invariants computation overflowed in 125 ms
[2024-05-23 03:51:29] [INFO ] Dead Transitions using invariants and state equation in 3490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5607/5607 places, 5406/5401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5227 ms. Remains : 5607/5607 places, 5406/5401 transitions.
Built C files in :
/tmp/ltsmin15522033450178089626
[2024-05-23 03:51:29] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15522033450178089626
Running compilation step : cd /tmp/ltsmin15522033450178089626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15522033450178089626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15522033450178089626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5607/5607 places, 5401/5401 transitions.
Applied a total of 0 rules in 441 ms. Remains 5607 /5607 variables (removed 0) and now considering 5401/5401 (removed 0) transitions.
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:51:33] [INFO ] Invariants computation overflowed in 125 ms
[2024-05-23 03:51:36] [INFO ] Implicit Places using invariants in 3674 ms returned []
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:51:36] [INFO ] Invariants computation overflowed in 119 ms
[2024-05-23 03:51:37] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 4772 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5607 cols
[2024-05-23 03:51:37] [INFO ] Invariants computation overflowed in 123 ms
[2024-05-23 03:51:41] [INFO ] Dead Transitions using invariants and state equation in 3699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8912 ms. Remains : 5607/5607 places, 5401/5401 transitions.
Built C files in :
/tmp/ltsmin1333326951152852180
[2024-05-23 03:51:41] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1333326951152852180
Running compilation step : cd /tmp/ltsmin1333326951152852180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1333326951152852180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1333326951152852180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 03:51:45] [INFO ] Flatten gal took : 148 ms
[2024-05-23 03:51:45] [INFO ] Flatten gal took : 138 ms
[2024-05-23 03:51:45] [INFO ] Time to serialize gal into /tmp/LTL11862883740910101786.gal : 21 ms
[2024-05-23 03:51:45] [INFO ] Time to serialize properties into /tmp/LTL7943275834760190019.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11862883740910101786.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8310756007883265454.hoa' '-atoms' '/tmp/LTL7943275834760190019.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7943275834760190019.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8310756007883265454.hoa
Detected timeout of ITS tools.
[2024-05-23 03:52:00] [INFO ] Flatten gal took : 140 ms
[2024-05-23 03:52:01] [INFO ] Flatten gal took : 147 ms
[2024-05-23 03:52:01] [INFO ] Time to serialize gal into /tmp/LTL10711463199277509262.gal : 23 ms
[2024-05-23 03:52:01] [INFO ] Time to serialize properties into /tmp/LTL8789333369659446899.ltl : 602 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10711463199277509262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8789333369659446899.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p4060>=1)")||(("((p4613>=1)&&(p4708>=1))")U(G(!("((p3341>=1)&&(p3373>=1))")))))))))
Formula 0 simplified : XXF(!"(p4060>=1)" & (!"((p4613>=1)&&(p4708>=1))" R F"((p3341>=1)&&(p3373>=1))"))
Detected timeout of ITS tools.
[2024-05-23 03:52:16] [INFO ] Flatten gal took : 139 ms
[2024-05-23 03:52:16] [INFO ] Applying decomposition
[2024-05-23 03:52:17] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17785778928071114401.txt' '-o' '/tmp/graph17785778928071114401.bin' '-w' '/tmp/graph17785778928071114401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17785778928071114401.bin' '-l' '-1' '-v' '-w' '/tmp/graph17785778928071114401.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:52:17] [INFO ] Decomposing Gal with order
[2024-05-23 03:52:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:52:18] [INFO ] Removed a total of 4151 redundant transitions.
[2024-05-23 03:52:18] [INFO ] Flatten gal took : 252 ms
[2024-05-23 03:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 84 ms.
[2024-05-23 03:52:19] [INFO ] Time to serialize gal into /tmp/LTL14885238207883704534.gal : 47 ms
[2024-05-23 03:52:19] [INFO ] Time to serialize properties into /tmp/LTL11353250761090048995.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14885238207883704534.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11353250761090048995.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i11.i0.i1.u763.p4060>=1)")||(("((i12.i1.i4.u879.p4613>=1)&&(i12.i1.i4.u895.p4708>=1))")U(G(!("((i9.i0.i1.u618.p3341>=1)&&(...189
Formula 0 simplified : XXF(!"(i11.i0.i1.u763.p4060>=1)" & (!"((i12.i1.i4.u879.p4613>=1)&&(i12.i1.i4.u895.p4708>=1))" R F"((i9.i0.i1.u618.p3341>=1)&&(i9.i0....176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17995842909173916397
[2024-05-23 03:52:34] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17995842909173916397
Running compilation step : cd /tmp/ltsmin17995842909173916397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17995842909173916397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17995842909173916397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-200-LTLFireability-05 finished in 483129 ms.
[2024-05-23 03:52:37] [INFO ] Flatten gal took : 217 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7427378926417528910
[2024-05-23 03:52:37] [INFO ] Too many transitions (9998) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:52:37] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7427378926417528910
Running compilation step : cd /tmp/ltsmin7427378926417528910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 03:52:37] [INFO ] Applying decomposition
[2024-05-23 03:52:37] [INFO ] Flatten gal took : 227 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15217033240036888996.txt' '-o' '/tmp/graph15217033240036888996.bin' '-w' '/tmp/graph15217033240036888996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15217033240036888996.bin' '-l' '-1' '-v' '-w' '/tmp/graph15217033240036888996.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:52:38] [INFO ] Decomposing Gal with order
[2024-05-23 03:52:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:52:45] [INFO ] Removed a total of 2837 redundant transitions.
[2024-05-23 03:52:45] [INFO ] Flatten gal took : 390 ms
[2024-05-23 03:52:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 146 ms.
[2024-05-23 03:52:46] [INFO ] Time to serialize gal into /tmp/LTLFireability4860509297724172973.gal : 109 ms
[2024-05-23 03:52:46] [INFO ] Time to serialize properties into /tmp/LTLFireability7155862758626144656.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4860509297724172973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7155862758626144656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((X(G("(((i7.i2.i1.i0.u807.p2122<1)||(i7.i2.i1.i0.u808.p2217<1))&&((i17.i1.i3.i1.u1882.p4402<1)||(i17.i1.i3.i0.u1879.p4409<1)))"))))
Formula 0 simplified : XF!"(((i7.i2.i1.i0.u807.p2122<1)||(i7.i2.i1.i0.u808.p2217<1))&&((i17.i1.i3.i1.u1882.p4402<1)||(i17.i1.i3.i0.u1879.p4409<1)))"
Compilation finished in 66243 ms.
Running link step : cd /tmp/ltsmin7427378926417528910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin7427378926417528910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7684752 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16024480 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="DoubleExponent-PT-200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is DoubleExponent-PT-200, 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 r153-tall-171631151700363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-200.tgz
mv DoubleExponent-PT-200 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 ;