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.r026-smll-171620167100148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is AutoFlight-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 134K 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 AutoFlight-PT-06b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716267518408

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 04:58:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 04:58:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:58:41] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-05-21 04:58:41] [INFO ] Transformed 574 places.
[2024-05-21 04:58:41] [INFO ] Transformed 572 transitions.
[2024-05-21 04:58:41] [INFO ] Found NUPN structural information;
[2024-05-21 04:58:41] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-06b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 503 transition count 501
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 503 transition count 501
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 154 place count 503 transition count 489
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 184 place count 473 transition count 459
Iterating global reduction 1 with 30 rules applied. Total rules applied 214 place count 473 transition count 459
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 218 place count 469 transition count 455
Iterating global reduction 1 with 4 rules applied. Total rules applied 222 place count 469 transition count 455
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 226 place count 465 transition count 451
Iterating global reduction 1 with 4 rules applied. Total rules applied 230 place count 465 transition count 451
Applied a total of 230 rules in 367 ms. Remains 465 /574 variables (removed 109) and now considering 451/572 (removed 121) transitions.
// Phase 1: matrix 451 rows 465 cols
[2024-05-21 04:58:42] [INFO ] Computed 40 invariants in 47 ms
[2024-05-21 04:58:42] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-21 04:58:42] [INFO ] Invariant cache hit.
[2024-05-21 04:58:43] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2024-05-21 04:58:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/465 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 04:58:57] [INFO ] Deduced a trap composed of 67 places in 394 ms of which 51 ms to minimize.
[2024-05-21 04:58:58] [INFO ] Deduced a trap composed of 16 places in 282 ms of which 6 ms to minimize.
[2024-05-21 04:58:58] [INFO ] Deduced a trap composed of 61 places in 354 ms of which 8 ms to minimize.
[2024-05-21 04:58:58] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 5 ms to minimize.
[2024-05-21 04:58:59] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 5 ms to minimize.
[2024-05-21 04:58:59] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 7 ms to minimize.
[2024-05-21 04:58:59] [INFO ] Deduced a trap composed of 61 places in 249 ms of which 4 ms to minimize.
[2024-05-21 04:59:00] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 4 ms to minimize.
[2024-05-21 04:59:00] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 4 ms to minimize.
[2024-05-21 04:59:00] [INFO ] Deduced a trap composed of 62 places in 291 ms of which 6 ms to minimize.
[2024-05-21 04:59:00] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 4 ms to minimize.
[2024-05-21 04:59:01] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 4 ms to minimize.
[2024-05-21 04:59:01] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 3 ms to minimize.
[2024-05-21 04:59:01] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 4 ms to minimize.
[2024-05-21 04:59:01] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 4 ms to minimize.
[2024-05-21 04:59:01] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 6 ms to minimize.
[2024-05-21 04:59:02] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 6 ms to minimize.
[2024-05-21 04:59:02] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2024-05-21 04:59:02] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-05-21 04:59:02] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 04:59:10] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 3 ms to minimize.
[2024-05-21 04:59:10] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
[2024-05-21 04:59:10] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
[2024-05-21 04:59:11] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 3 ms to minimize.
[2024-05-21 04:59:11] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 3 ms to minimize.
[2024-05-21 04:59:11] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 5 ms to minimize.
[2024-05-21 04:59:11] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 5 ms to minimize.
[2024-05-21 04:59:12] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 4 ms to minimize.
[2024-05-21 04:59:12] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 3 ms to minimize.
[2024-05-21 04:59:12] [INFO ] Deduced a trap composed of 74 places in 278 ms of which 5 ms to minimize.
[2024-05-21 04:59:13] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 5 ms to minimize.
[2024-05-21 04:59:13] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 5 ms to minimize.
[2024-05-21 04:59:13] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-05-21 04:59:13] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/916 variables, and 74 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/465 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 04:59:21] [INFO ] Deduced a trap composed of 55 places in 362 ms of which 7 ms to minimize.
[2024-05-21 04:59:21] [INFO ] Deduced a trap composed of 63 places in 316 ms of which 7 ms to minimize.
[2024-05-21 04:59:21] [INFO ] Deduced a trap composed of 85 places in 368 ms of which 6 ms to minimize.
[2024-05-21 04:59:22] [INFO ] Deduced a trap composed of 73 places in 357 ms of which 6 ms to minimize.
[2024-05-21 04:59:22] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 6 ms to minimize.
[2024-05-21 04:59:22] [INFO ] Deduced a trap composed of 69 places in 309 ms of which 6 ms to minimize.
[2024-05-21 04:59:23] [INFO ] Deduced a trap composed of 60 places in 401 ms of which 7 ms to minimize.
[2024-05-21 04:59:23] [INFO ] Deduced a trap composed of 71 places in 373 ms of which 7 ms to minimize.
[2024-05-21 04:59:24] [INFO ] Deduced a trap composed of 73 places in 374 ms of which 7 ms to minimize.
[2024-05-21 04:59:24] [INFO ] Deduced a trap composed of 78 places in 345 ms of which 6 ms to minimize.
[2024-05-21 04:59:24] [INFO ] Deduced a trap composed of 75 places in 325 ms of which 6 ms to minimize.
[2024-05-21 04:59:25] [INFO ] Deduced a trap composed of 73 places in 284 ms of which 6 ms to minimize.
[2024-05-21 04:59:25] [INFO ] Deduced a trap composed of 87 places in 270 ms of which 5 ms to minimize.
[2024-05-21 04:59:25] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 5 ms to minimize.
[2024-05-21 04:59:25] [INFO ] Deduced a trap composed of 79 places in 233 ms of which 5 ms to minimize.
[2024-05-21 04:59:26] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 5 ms to minimize.
[2024-05-21 04:59:26] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 7 ms to minimize.
[2024-05-21 04:59:26] [INFO ] Deduced a trap composed of 80 places in 277 ms of which 6 ms to minimize.
[2024-05-21 04:59:27] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 3 ms to minimize.
[2024-05-21 04:59:28] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 04:59:29] [INFO ] Deduced a trap composed of 85 places in 356 ms of which 6 ms to minimize.
[2024-05-21 04:59:29] [INFO ] Deduced a trap composed of 62 places in 351 ms of which 6 ms to minimize.
[2024-05-21 04:59:30] [INFO ] Deduced a trap composed of 64 places in 347 ms of which 7 ms to minimize.
[2024-05-21 04:59:30] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 6 ms to minimize.
[2024-05-21 04:59:30] [INFO ] Deduced a trap composed of 63 places in 334 ms of which 6 ms to minimize.
[2024-05-21 04:59:31] [INFO ] Deduced a trap composed of 65 places in 316 ms of which 6 ms to minimize.
[2024-05-21 04:59:31] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 5 ms to minimize.
[2024-05-21 04:59:31] [INFO ] Deduced a trap composed of 79 places in 303 ms of which 6 ms to minimize.
[2024-05-21 04:59:32] [INFO ] Deduced a trap composed of 79 places in 283 ms of which 6 ms to minimize.
[2024-05-21 04:59:33] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 5 ms to minimize.
[2024-05-21 04:59:33] [INFO ] Deduced a trap composed of 72 places in 263 ms of which 5 ms to minimize.
[2024-05-21 04:59:33] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 5 ms to minimize.
[2024-05-21 04:59:34] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 4 ms to minimize.
[2024-05-21 04:59:34] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 5 ms to minimize.
[2024-05-21 04:59:34] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-05-21 04:59:35] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-21 04:59:35] [INFO ] Deduced a trap composed of 75 places in 280 ms of which 6 ms to minimize.
[2024-05-21 04:59:35] [INFO ] Deduced a trap composed of 70 places in 249 ms of which 4 ms to minimize.
[2024-05-21 04:59:36] [INFO ] Deduced a trap composed of 91 places in 251 ms of which 5 ms to minimize.
[2024-05-21 04:59:36] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 04:59:37] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 5 ms to minimize.
[2024-05-21 04:59:37] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 5 ms to minimize.
[2024-05-21 04:59:39] [INFO ] Deduced a trap composed of 88 places in 201 ms of which 4 ms to minimize.
[2024-05-21 04:59:39] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 4 ms to minimize.
[2024-05-21 04:59:39] [INFO ] Deduced a trap composed of 91 places in 199 ms of which 4 ms to minimize.
[2024-05-21 04:59:39] [INFO ] Deduced a trap composed of 93 places in 205 ms of which 4 ms to minimize.
[2024-05-21 04:59:40] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 4 ms to minimize.
[2024-05-21 04:59:40] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 4 ms to minimize.
[2024-05-21 04:59:40] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 5 ms to minimize.
[2024-05-21 04:59:41] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 5 ms to minimize.
[2024-05-21 04:59:41] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 5 ms to minimize.
[2024-05-21 04:59:41] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 4 ms to minimize.
[2024-05-21 04:59:41] [INFO ] Deduced a trap composed of 77 places in 245 ms of which 5 ms to minimize.
[2024-05-21 04:59:42] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 5 ms to minimize.
[2024-05-21 04:59:42] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 4 ms to minimize.
[2024-05-21 04:59:42] [INFO ] Deduced a trap composed of 83 places in 247 ms of which 4 ms to minimize.
[2024-05-21 04:59:43] [INFO ] Deduced a trap composed of 83 places in 269 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/916 variables, and 131 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/465 constraints, PredecessorRefiner: 0/450 constraints, Known Traps: 91/91 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 450 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in LTL mode, iteration 1 : 465/574 places, 451/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62125 ms. Remains : 465/574 places, 451/572 transitions.
Support contains 26 out of 465 places after structural reductions.
[2024-05-21 04:59:44] [INFO ] Flatten gal took : 128 ms
[2024-05-21 04:59:44] [INFO ] Flatten gal took : 58 ms
[2024-05-21 04:59:44] [INFO ] Input system was already deterministic with 451 transitions.
RANDOM walk for 40000 steps (135 resets) in 1706 ms. (23 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40004 steps (12 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
[2024-05-21 04:59:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 143/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 286/433 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:59:45] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-21 04:59:45] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 32/465 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:59:45] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2024-05-21 04:59:45] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-21 04:59:46] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 4 ms to minimize.
[2024-05-21 04:59:46] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2024-05-21 04:59:46] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 5 ms to minimize.
[2024-05-21 04:59:46] [INFO ] Deduced a trap composed of 87 places in 256 ms of which 5 ms to minimize.
[2024-05-21 04:59:47] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 6 ms to minimize.
[2024-05-21 04:59:47] [INFO ] Deduced a trap composed of 87 places in 270 ms of which 6 ms to minimize.
[2024-05-21 04:59:47] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 451/916 variables, 465/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/916 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/916 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 916/916 variables, and 516 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3126 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 143/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 286/433 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 32/465 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:59:48] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-21 04:59:48] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 3 ms to minimize.
[2024-05-21 04:59:48] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 451/916 variables, 465/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/916 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:59:49] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 3 ms to minimize.
[2024-05-21 04:59:49] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:59:49] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 04:59:49] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/916 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/916 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 916/916 variables, and 527 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 4932ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 1099 ms.
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 451/451 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 465 transition count 286
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 183 rules applied. Total rules applied 348 place count 300 transition count 268
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 288 transition count 268
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 360 place count 288 transition count 212
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 472 place count 232 transition count 212
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 478 place count 226 transition count 206
Iterating global reduction 3 with 6 rules applied. Total rules applied 484 place count 226 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 484 place count 226 transition count 203
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 490 place count 223 transition count 203
Performed 87 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 664 place count 136 transition count 104
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 688 place count 136 transition count 80
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 712 place count 112 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 713 place count 111 transition count 79
Reduce places removed 28 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 72 rules applied. Total rules applied 785 place count 83 transition count 35
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 829 place count 39 transition count 35
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 829 place count 39 transition count 24
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 851 place count 28 transition count 24
Applied a total of 851 rules in 119 ms. Remains 28 /465 variables (removed 437) and now considering 24/451 (removed 427) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 28/465 places, 24/451 transitions.
RANDOM walk for 86 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-06b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 121 stabilizing places and 121 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))||F(G((p0||F(p2))))))'
Support contains 3 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 464 transition count 289
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 179 rules applied. Total rules applied 340 place count 303 transition count 271
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 352 place count 291 transition count 271
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 352 place count 291 transition count 215
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 464 place count 235 transition count 215
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 469 place count 230 transition count 210
Iterating global reduction 3 with 5 rules applied. Total rules applied 474 place count 230 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 474 place count 230 transition count 208
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 478 place count 228 transition count 208
Performed 89 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 656 place count 139 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 657 place count 138 transition count 106
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 673 place count 127 transition count 101
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 678 place count 122 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 678 place count 122 transition count 95
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 690 place count 116 transition count 95
Applied a total of 690 rules in 63 ms. Remains 116 /465 variables (removed 349) and now considering 95/451 (removed 356) transitions.
// Phase 1: matrix 95 rows 116 cols
[2024-05-21 04:59:51] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 04:59:51] [INFO ] Implicit Places using invariants in 110 ms returned [49, 69, 89, 93, 97, 101, 105, 110, 115]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 115 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/465 places, 95/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 87
Applied a total of 16 rules in 11 ms. Remains 99 /107 variables (removed 8) and now considering 87/95 (removed 8) transitions.
// Phase 1: matrix 87 rows 99 cols
[2024-05-21 04:59:51] [INFO ] Computed 20 invariants in 0 ms
[2024-05-21 04:59:52] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 04:59:52] [INFO ] Invariant cache hit.
[2024-05-21 04:59:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 04:59:52] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/465 places, 87/451 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 99/465 places, 87/451 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-01
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-01 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 464 transition count 285
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 183 rules applied. Total rules applied 348 place count 299 transition count 267
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 287 transition count 267
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 360 place count 287 transition count 211
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 472 place count 231 transition count 211
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 479 place count 224 transition count 204
Iterating global reduction 3 with 7 rules applied. Total rules applied 486 place count 224 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 486 place count 224 transition count 200
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 494 place count 220 transition count 200
Performed 84 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 662 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 663 place count 135 transition count 103
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 673 place count 128 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 676 place count 125 transition count 100
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 676 place count 125 transition count 96
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 684 place count 121 transition count 96
Applied a total of 684 rules in 49 ms. Remains 121 /465 variables (removed 344) and now considering 96/451 (removed 355) transitions.
// Phase 1: matrix 96 rows 121 cols
[2024-05-21 04:59:52] [INFO ] Computed 33 invariants in 1 ms
[2024-05-21 04:59:52] [INFO ] Implicit Places using invariants in 118 ms returned [50, 70, 90, 96, 102, 106, 110, 115, 120]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 119 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/465 places, 96/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 104 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 104 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 103 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 103 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 102 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 102 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 101 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 101 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 100 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 100 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 99 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 99 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 98 transition count 82
Applied a total of 28 rules in 18 ms. Remains 98 /112 variables (removed 14) and now considering 82/96 (removed 14) transitions.
// Phase 1: matrix 82 rows 98 cols
[2024-05-21 04:59:52] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 04:59:52] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 04:59:52] [INFO ] Invariant cache hit.
[2024-05-21 04:59:52] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 04:59:52] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 271 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/465 places, 82/451 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 97 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 81
Applied a total of 2 rules in 6 ms. Remains 96 /97 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-21 04:59:52] [INFO ] Computed 23 invariants in 3 ms
[2024-05-21 04:59:52] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 04:59:52] [INFO ] Invariant cache hit.
[2024-05-21 04:59:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 04:59:53] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 96/465 places, 81/451 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 777 ms. Remains : 96/465 places, 81/451 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 3734 reset in 504 ms.
Product exploration explored 100000 steps with 3720 reset in 349 ms.
Computed a total of 7 stabilizing places and 3 stable transitions
Computed a total of 7 stabilizing places and 3 stable transitions
Detected a total of 7/96 stabilizing places and 3/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 275 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-21 04:59:54] [INFO ] Invariant cache hit.
[2024-05-21 04:59:54] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 04:59:54] [INFO ] Invariant cache hit.
[2024-05-21 04:59:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 04:59:55] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-21 04:59:55] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-21 04:59:55] [INFO ] Invariant cache hit.
[2024-05-21 04:59:55] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-21 04:59:56] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
[2024-05-21 04:59:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 143 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2510 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 96/96 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 72/215 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 215 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3726 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 96/96 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
After SMT, in 6260ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 6263ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6712 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 7 stabilizing places and 3 stable transitions
Computed a total of 7 stabilizing places and 3 stable transitions
Detected a total of 7/96 stabilizing places and 3/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3718 reset in 290 ms.
Product exploration explored 100000 steps with 3730 reset in 326 ms.
Built C files in :
/tmp/ltsmin1641811993329252252
[2024-05-21 05:00:02] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-21 05:00:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:00:02] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-21 05:00:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:00:02] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-21 05:00:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:00:02] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1641811993329252252
Running compilation step : cd /tmp/ltsmin1641811993329252252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 823 ms.
Running link step : cd /tmp/ltsmin1641811993329252252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin1641811993329252252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5282917775532596248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-21 05:00:17] [INFO ] Invariant cache hit.
[2024-05-21 05:00:17] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 05:00:17] [INFO ] Invariant cache hit.
[2024-05-21 05:00:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 05:00:18] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-21 05:00:18] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-21 05:00:18] [INFO ] Invariant cache hit.
[2024-05-21 05:00:18] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-21 05:00:18] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
[2024-05-21 05:00:18] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 143 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3095 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 96/96 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/96 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 81/177 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 72/215 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 215 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3808 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 96/96 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
After SMT, in 6920ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 6922ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7284 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin10637176700253597719
[2024-05-21 05:00:25] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-21 05:00:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:00:25] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-21 05:00:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:00:25] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-21 05:00:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:00:25] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10637176700253597719
Running compilation step : cd /tmp/ltsmin10637176700253597719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin10637176700253597719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10637176700253597719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12633614516065592709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 05:00:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 05:00:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 05:00:40] [INFO ] Time to serialize gal into /tmp/LTL15486850237747798150.gal : 3 ms
[2024-05-21 05:00:40] [INFO ] Time to serialize properties into /tmp/LTL397086645455060824.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15486850237747798150.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9741794107695984334.hoa' '-atoms' '/tmp/LTL397086645455060824.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL397086645455060824.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9741794107695984334.hoa
Reverse transition relation is NOT exact ! Due to transitions t188, t191.t203.t206.t216.t224.t231.t238.t250.t258.t265.t273.t280.t287.t299.t306.t313.t321.t3...464
Computing Next relation with stutter on 2944 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
84 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.877059,36056,1,0,364,112503,192,279,2672,134264,588
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-06b-LTLFireability-02 finished in 48782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 51 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 05:00:41] [INFO ] Computed 40 invariants in 7 ms
[2024-05-21 05:00:41] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 05:00:41] [INFO ] Invariant cache hit.
[2024-05-21 05:00:42] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 05:00:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:00:54] [INFO ] Deduced a trap composed of 23 places in 401 ms of which 8 ms to minimize.
[2024-05-21 05:00:54] [INFO ] Deduced a trap composed of 74 places in 386 ms of which 6 ms to minimize.
[2024-05-21 05:00:55] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 6 ms to minimize.
[2024-05-21 05:00:55] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 6 ms to minimize.
[2024-05-21 05:00:55] [INFO ] Deduced a trap composed of 17 places in 361 ms of which 6 ms to minimize.
[2024-05-21 05:00:56] [INFO ] Deduced a trap composed of 70 places in 375 ms of which 6 ms to minimize.
[2024-05-21 05:00:56] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 6 ms to minimize.
[2024-05-21 05:00:57] [INFO ] Deduced a trap composed of 60 places in 348 ms of which 7 ms to minimize.
[2024-05-21 05:00:57] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 6 ms to minimize.
[2024-05-21 05:00:57] [INFO ] Deduced a trap composed of 69 places in 342 ms of which 6 ms to minimize.
[2024-05-21 05:00:58] [INFO ] Deduced a trap composed of 68 places in 353 ms of which 6 ms to minimize.
[2024-05-21 05:00:58] [INFO ] Deduced a trap composed of 65 places in 358 ms of which 6 ms to minimize.
[2024-05-21 05:00:59] [INFO ] Deduced a trap composed of 26 places in 342 ms of which 6 ms to minimize.
[2024-05-21 05:00:59] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 4 ms to minimize.
[2024-05-21 05:00:59] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 4 ms to minimize.
[2024-05-21 05:01:00] [INFO ] Deduced a trap composed of 20 places in 356 ms of which 6 ms to minimize.
[2024-05-21 05:01:00] [INFO ] Deduced a trap composed of 26 places in 323 ms of which 5 ms to minimize.
[2024-05-21 05:01:00] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 6 ms to minimize.
[2024-05-21 05:01:01] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 5 ms to minimize.
[2024-05-21 05:01:01] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:01:08] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 5 ms to minimize.
[2024-05-21 05:01:08] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 5 ms to minimize.
[2024-05-21 05:01:09] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 5 ms to minimize.
[2024-05-21 05:01:09] [INFO ] Deduced a trap composed of 72 places in 277 ms of which 5 ms to minimize.
[2024-05-21 05:01:09] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 5 ms to minimize.
[2024-05-21 05:01:10] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 5 ms to minimize.
[2024-05-21 05:01:10] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 5 ms to minimize.
[2024-05-21 05:01:10] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 5 ms to minimize.
[2024-05-21 05:01:10] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 5 ms to minimize.
[2024-05-21 05:01:11] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 5 ms to minimize.
[2024-05-21 05:01:11] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 6 ms to minimize.
[2024-05-21 05:01:11] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 5 ms to minimize.
[2024-05-21 05:01:12] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 5 ms to minimize.
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 30128ms
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30962 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-04
Product exploration explored 100000 steps with 3192 reset in 358 ms.
Product exploration explored 100000 steps with 3262 reset in 281 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/446 stabilizing places and 108/432 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 280 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 05:01:13] [INFO ] Invariant cache hit.
[2024-05-21 05:01:14] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2024-05-21 05:01:14] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 05:01:14] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-21 05:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 05:01:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 30 ms returned sat
[2024-05-21 05:01:15] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 05:01:15] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-05-21 05:01:16] [INFO ] Computed and/alt/rep : 431/615/431 causal constraints (skipped 0 transitions) in 52 ms.
[2024-05-21 05:01:20] [INFO ] Added : 411 causal constraints over 83 iterations in 4897 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 432/432 transitions.
Applied a total of 0 rules in 14 ms. Remains 446 /446 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2024-05-21 05:01:20] [INFO ] Invariant cache hit.
[2024-05-21 05:01:21] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-21 05:01:21] [INFO ] Invariant cache hit.
[2024-05-21 05:01:21] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 05:01:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:01:33] [INFO ] Deduced a trap composed of 23 places in 462 ms of which 8 ms to minimize.
[2024-05-21 05:01:33] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 7 ms to minimize.
[2024-05-21 05:01:34] [INFO ] Deduced a trap composed of 20 places in 372 ms of which 7 ms to minimize.
[2024-05-21 05:01:34] [INFO ] Deduced a trap composed of 17 places in 352 ms of which 6 ms to minimize.
[2024-05-21 05:01:34] [INFO ] Deduced a trap composed of 17 places in 371 ms of which 7 ms to minimize.
[2024-05-21 05:01:35] [INFO ] Deduced a trap composed of 70 places in 354 ms of which 7 ms to minimize.
[2024-05-21 05:01:35] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 6 ms to minimize.
[2024-05-21 05:01:35] [INFO ] Deduced a trap composed of 60 places in 341 ms of which 6 ms to minimize.
[2024-05-21 05:01:36] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 6 ms to minimize.
[2024-05-21 05:01:36] [INFO ] Deduced a trap composed of 69 places in 347 ms of which 6 ms to minimize.
[2024-05-21 05:01:36] [INFO ] Deduced a trap composed of 68 places in 328 ms of which 6 ms to minimize.
[2024-05-21 05:01:37] [INFO ] Deduced a trap composed of 65 places in 363 ms of which 7 ms to minimize.
[2024-05-21 05:01:37] [INFO ] Deduced a trap composed of 26 places in 368 ms of which 7 ms to minimize.
[2024-05-21 05:01:38] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 5 ms to minimize.
[2024-05-21 05:01:38] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 4 ms to minimize.
[2024-05-21 05:01:38] [INFO ] Deduced a trap composed of 20 places in 337 ms of which 6 ms to minimize.
[2024-05-21 05:01:39] [INFO ] Deduced a trap composed of 26 places in 331 ms of which 6 ms to minimize.
[2024-05-21 05:01:39] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 6 ms to minimize.
[2024-05-21 05:01:39] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 5 ms to minimize.
[2024-05-21 05:01:40] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:01:47] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 5 ms to minimize.
[2024-05-21 05:01:47] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 6 ms to minimize.
[2024-05-21 05:01:47] [INFO ] Deduced a trap composed of 69 places in 305 ms of which 6 ms to minimize.
[2024-05-21 05:01:48] [INFO ] Deduced a trap composed of 72 places in 305 ms of which 5 ms to minimize.
[2024-05-21 05:01:48] [INFO ] Deduced a trap composed of 68 places in 223 ms of which 5 ms to minimize.
[2024-05-21 05:01:48] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 5 ms to minimize.
[2024-05-21 05:01:49] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 5 ms to minimize.
[2024-05-21 05:01:49] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 5 ms to minimize.
[2024-05-21 05:01:49] [INFO ] Deduced a trap composed of 67 places in 312 ms of which 6 ms to minimize.
[2024-05-21 05:01:50] [INFO ] Deduced a trap composed of 74 places in 301 ms of which 6 ms to minimize.
[2024-05-21 05:01:50] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 5 ms to minimize.
[2024-05-21 05:01:50] [INFO ] Deduced a trap composed of 71 places in 279 ms of which 5 ms to minimize.
[2024-05-21 05:01:51] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 4 ms to minimize.
[2024-05-21 05:01:51] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 6 ms to minimize.
[2024-05-21 05:01:52] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 5 ms to minimize.
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 30302ms
Finished structural reductions in LTL mode , in 1 iterations and 31108 ms. Remains : 446/446 places, 432/432 transitions.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/446 stabilizing places and 108/432 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 108 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 05:01:52] [INFO ] Invariant cache hit.
[2024-05-21 05:01:53] [INFO ] [Real]Absence check using 39 positive place invariants in 31 ms returned sat
[2024-05-21 05:01:53] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 05:01:53] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2024-05-21 05:01:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 05:01:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 20 ms returned sat
[2024-05-21 05:01:54] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 05:01:54] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2024-05-21 05:01:54] [INFO ] Computed and/alt/rep : 431/615/431 causal constraints (skipped 0 transitions) in 55 ms.
[2024-05-21 05:01:59] [INFO ] Added : 411 causal constraints over 83 iterations in 5212 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3142 reset in 218 ms.
Product exploration explored 100000 steps with 3209 reset in 256 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 432/432 transitions.
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 446 transition count 432
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 150 place count 446 transition count 426
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 150 place count 446 transition count 426
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 211 place count 446 transition count 426
Discarding 117 places :
Symmetric choice reduction at 2 with 117 rule applications. Total rules 328 place count 329 transition count 309
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 117 rules applied. Total rules applied 445 place count 329 transition count 309
Performed 106 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 194 places in 0 ms
Iterating global reduction 2 with 106 rules applied. Total rules applied 551 place count 329 transition count 297
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 618 place count 262 transition count 230
Deduced a syphon composed of 127 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 685 place count 262 transition count 230
Deduced a syphon composed of 127 places in 0 ms
Applied a total of 685 rules in 145 ms. Remains 262 /446 variables (removed 184) and now considering 230/432 (removed 202) transitions.
[2024-05-21 05:02:01] [INFO ] Redundant transitions in 18 ms returned []
Running 229 sub problems to find dead transitions.
// Phase 1: matrix 230 rows 262 cols
[2024-05-21 05:02:01] [INFO ] Computed 40 invariants in 8 ms
[2024-05-21 05:02:01] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/262 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-21 05:02:07] [INFO ] Deduced a trap composed of 2 places in 219 ms of which 4 ms to minimize.
[2024-05-21 05:02:07] [INFO ] Deduced a trap composed of 2 places in 200 ms of which 4 ms to minimize.
[2024-05-21 05:02:07] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 4 ms to minimize.
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 4 ms to minimize.
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 3 ms to minimize.
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 2 ms to minimize.
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 3 ms to minimize.
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 3 ms to minimize.
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 05:02:08] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/60 constraints. Problems are: Problem set: 73 solved, 156 unsolved
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 05:02:09] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-21 05:02:10] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 19/79 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/79 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 230/492 variables, 262/341 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 44/385 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/385 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/385 constraints. Problems are: Problem set: 127 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 385 constraints, problems are : Problem set: 127 solved, 102 unsolved in 17156 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 262/262 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 127 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 124/258 variables, 38/38 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 39/77 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/77 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 4/262 variables, 2/79 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/79 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 230/492 variables, 262/341 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 44/385 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 102/487 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/487 constraints. Problems are: Problem set: 127 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/487 constraints. Problems are: Problem set: 127 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 487 constraints, problems are : Problem set: 127 solved, 102 unsolved in 13108 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 262/262 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 102/229 constraints, Known Traps: 39/39 constraints]
After SMT, in 30408ms problems are : Problem set: 127 solved, 102 unsolved
Search for dead transitions found 127 dead transitions in 30414ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 262/446 places, 103/432 transitions.
Graph (complete) has 349 edges and 262 vertex of which 135 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.2 ms
Discarding 127 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 135 /262 variables (removed 127) and now considering 103/103 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 135/446 places, 103/432 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30595 ms. Remains : 135/446 places, 103/432 transitions.
Built C files in :
/tmp/ltsmin1316571305860997691
[2024-05-21 05:02:31] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1316571305860997691
Running compilation step : cd /tmp/ltsmin1316571305860997691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1388 ms.
Running link step : cd /tmp/ltsmin1316571305860997691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1316571305860997691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18348950232392636989.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 432/432 transitions.
Applied a total of 0 rules in 10 ms. Remains 446 /446 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 05:02:46] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 05:02:46] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 05:02:46] [INFO ] Invariant cache hit.
[2024-05-21 05:02:47] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 05:02:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:03:00] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 7 ms to minimize.
[2024-05-21 05:03:00] [INFO ] Deduced a trap composed of 74 places in 367 ms of which 6 ms to minimize.
[2024-05-21 05:03:00] [INFO ] Deduced a trap composed of 20 places in 352 ms of which 6 ms to minimize.
[2024-05-21 05:03:01] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 7 ms to minimize.
[2024-05-21 05:03:01] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 7 ms to minimize.
[2024-05-21 05:03:01] [INFO ] Deduced a trap composed of 70 places in 384 ms of which 7 ms to minimize.
[2024-05-21 05:03:02] [INFO ] Deduced a trap composed of 21 places in 347 ms of which 6 ms to minimize.
[2024-05-21 05:03:02] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 7 ms to minimize.
[2024-05-21 05:03:03] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 7 ms to minimize.
[2024-05-21 05:03:03] [INFO ] Deduced a trap composed of 69 places in 336 ms of which 7 ms to minimize.
[2024-05-21 05:03:03] [INFO ] Deduced a trap composed of 68 places in 333 ms of which 6 ms to minimize.
[2024-05-21 05:03:04] [INFO ] Deduced a trap composed of 65 places in 364 ms of which 8 ms to minimize.
[2024-05-21 05:03:04] [INFO ] Deduced a trap composed of 26 places in 349 ms of which 6 ms to minimize.
[2024-05-21 05:03:04] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 4 ms to minimize.
[2024-05-21 05:03:05] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 4 ms to minimize.
[2024-05-21 05:03:05] [INFO ] Deduced a trap composed of 20 places in 363 ms of which 6 ms to minimize.
[2024-05-21 05:03:06] [INFO ] Deduced a trap composed of 26 places in 339 ms of which 6 ms to minimize.
[2024-05-21 05:03:06] [INFO ] Deduced a trap composed of 26 places in 346 ms of which 6 ms to minimize.
[2024-05-21 05:03:06] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 5 ms to minimize.
[2024-05-21 05:03:07] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:03:13] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 5 ms to minimize.
[2024-05-21 05:03:14] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 6 ms to minimize.
[2024-05-21 05:03:14] [INFO ] Deduced a trap composed of 69 places in 304 ms of which 6 ms to minimize.
[2024-05-21 05:03:15] [INFO ] Deduced a trap composed of 72 places in 299 ms of which 6 ms to minimize.
[2024-05-21 05:03:15] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 5 ms to minimize.
[2024-05-21 05:03:15] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 5 ms to minimize.
[2024-05-21 05:03:15] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 5 ms to minimize.
[2024-05-21 05:03:16] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 4 ms to minimize.
[2024-05-21 05:03:16] [INFO ] Deduced a trap composed of 67 places in 305 ms of which 7 ms to minimize.
[2024-05-21 05:03:16] [INFO ] Deduced a trap composed of 74 places in 296 ms of which 5 ms to minimize.
[2024-05-21 05:03:17] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 5 ms to minimize.
[2024-05-21 05:03:17] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/878 variables, and 72 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 32/72 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:03:25] [INFO ] Deduced a trap composed of 65 places in 361 ms of which 6 ms to minimize.
[2024-05-21 05:03:25] [INFO ] Deduced a trap composed of 62 places in 347 ms of which 6 ms to minimize.
[2024-05-21 05:03:25] [INFO ] Deduced a trap composed of 18 places in 348 ms of which 6 ms to minimize.
[2024-05-21 05:03:26] [INFO ] Deduced a trap composed of 58 places in 315 ms of which 8 ms to minimize.
[2024-05-21 05:03:26] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 6 ms to minimize.
[2024-05-21 05:03:26] [INFO ] Deduced a trap composed of 70 places in 316 ms of which 6 ms to minimize.
[2024-05-21 05:03:27] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 5 ms to minimize.
[2024-05-21 05:03:27] [INFO ] Deduced a trap composed of 76 places in 300 ms of which 6 ms to minimize.
[2024-05-21 05:03:27] [INFO ] Deduced a trap composed of 70 places in 304 ms of which 6 ms to minimize.
[2024-05-21 05:03:28] [INFO ] Deduced a trap composed of 81 places in 315 ms of which 6 ms to minimize.
[2024-05-21 05:03:28] [INFO ] Deduced a trap composed of 77 places in 309 ms of which 6 ms to minimize.
[2024-05-21 05:03:28] [INFO ] Deduced a trap composed of 78 places in 299 ms of which 5 ms to minimize.
[2024-05-21 05:03:29] [INFO ] Deduced a trap composed of 70 places in 280 ms of which 5 ms to minimize.
[2024-05-21 05:03:29] [INFO ] Deduced a trap composed of 77 places in 271 ms of which 6 ms to minimize.
[2024-05-21 05:03:29] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 6 ms to minimize.
[2024-05-21 05:03:29] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 5 ms to minimize.
[2024-05-21 05:03:30] [INFO ] Deduced a trap composed of 71 places in 278 ms of which 5 ms to minimize.
[2024-05-21 05:03:30] [INFO ] Deduced a trap composed of 76 places in 270 ms of which 5 ms to minimize.
[2024-05-21 05:03:30] [INFO ] Deduced a trap composed of 75 places in 234 ms of which 4 ms to minimize.
[2024-05-21 05:03:31] [INFO ] Deduced a trap composed of 80 places in 213 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:03:32] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 5 ms to minimize.
[2024-05-21 05:03:32] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 4 ms to minimize.
[2024-05-21 05:03:32] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 4 ms to minimize.
[2024-05-21 05:03:32] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-05-21 05:03:33] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 3 ms to minimize.
[2024-05-21 05:03:33] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-21 05:03:33] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-21 05:03:33] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-05-21 05:03:34] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 5 ms to minimize.
[2024-05-21 05:03:34] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 5 ms to minimize.
[2024-05-21 05:03:34] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 5 ms to minimize.
[2024-05-21 05:03:35] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 5 ms to minimize.
[2024-05-21 05:03:35] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 5 ms to minimize.
[2024-05-21 05:03:35] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 5 ms to minimize.
[2024-05-21 05:03:36] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 4 ms to minimize.
[2024-05-21 05:03:36] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 5 ms to minimize.
[2024-05-21 05:03:36] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 4 ms to minimize.
[2024-05-21 05:03:36] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 4 ms to minimize.
[2024-05-21 05:03:36] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 4 ms to minimize.
[2024-05-21 05:03:37] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:03:38] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 4 ms to minimize.
[2024-05-21 05:03:38] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2024-05-21 05:03:39] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 4 ms to minimize.
[2024-05-21 05:03:39] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 4 ms to minimize.
[2024-05-21 05:03:39] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 5 ms to minimize.
[2024-05-21 05:03:40] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 05:03:40] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 4 ms to minimize.
[2024-05-21 05:03:40] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 4 ms to minimize.
[2024-05-21 05:03:41] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 4 ms to minimize.
[2024-05-21 05:03:43] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 4 ms to minimize.
[2024-05-21 05:03:44] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/878 variables, and 123 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 83/83 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 446/446 places, 432/432 transitions.
Built C files in :
/tmp/ltsmin10841528960337201311
[2024-05-21 05:03:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10841528960337201311
Running compilation step : cd /tmp/ltsmin10841528960337201311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1361 ms.
Running link step : cd /tmp/ltsmin10841528960337201311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10841528960337201311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8596345294644700887.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 05:04:02] [INFO ] Flatten gal took : 26 ms
[2024-05-21 05:04:02] [INFO ] Flatten gal took : 25 ms
[2024-05-21 05:04:02] [INFO ] Time to serialize gal into /tmp/LTL4376211640299455079.gal : 6 ms
[2024-05-21 05:04:02] [INFO ] Time to serialize properties into /tmp/LTL715369360628409654.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4376211640299455079.gal' '-t' 'CGAL' '-hoa' '/tmp/aut76711675404909665.hoa' '-atoms' '/tmp/LTL715369360628409654.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...314
Loading property file /tmp/LTL715369360628409654.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut76711675404909665.hoa
Detected timeout of ITS tools.
[2024-05-21 05:04:17] [INFO ] Flatten gal took : 23 ms
[2024-05-21 05:04:17] [INFO ] Flatten gal took : 19 ms
[2024-05-21 05:04:17] [INFO ] Time to serialize gal into /tmp/LTL9086890114834033977.gal : 5 ms
[2024-05-21 05:04:17] [INFO ] Time to serialize properties into /tmp/LTL8246128272478153257.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9086890114834033977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8246128272478153257.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F("(p567==1)"))||(G("(p80==1)")))))
Formula 0 simplified : X(G!"(p567==1)" & F!"(p80==1)")
Detected timeout of ITS tools.
[2024-05-21 05:04:32] [INFO ] Flatten gal took : 18 ms
[2024-05-21 05:04:32] [INFO ] Applying decomposition
[2024-05-21 05:04:32] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15413229373437571697.txt' '-o' '/tmp/graph15413229373437571697.bin' '-w' '/tmp/graph15413229373437571697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15413229373437571697.bin' '-l' '-1' '-v' '-w' '/tmp/graph15413229373437571697.weights' '-q' '0' '-e' '0.001'
[2024-05-21 05:04:33] [INFO ] Decomposing Gal with order
[2024-05-21 05:04:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 05:04:33] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-21 05:04:33] [INFO ] Flatten gal took : 92 ms
[2024-05-21 05:04:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-21 05:04:33] [INFO ] Time to serialize gal into /tmp/LTL12448947373164542247.gal : 14 ms
[2024-05-21 05:04:33] [INFO ] Time to serialize properties into /tmp/LTL4662608591801815677.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12448947373164542247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4662608591801815677.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("(i19.i1.i1.u187.p567==1)"))||(G("(i7.u27.p80==1)")))))
Formula 0 simplified : X(G!"(i19.i1.i1.u187.p567==1)" & F!"(i7.u27.p80==1)")
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-06b-LTLFireability-04 finished in 247195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 45 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
[2024-05-21 05:04:48] [INFO ] Invariant cache hit.
[2024-05-21 05:04:48] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-21 05:04:48] [INFO ] Invariant cache hit.
[2024-05-21 05:04:49] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 05:04:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:05:02] [INFO ] Deduced a trap composed of 23 places in 426 ms of which 8 ms to minimize.
[2024-05-21 05:05:02] [INFO ] Deduced a trap composed of 74 places in 351 ms of which 6 ms to minimize.
[2024-05-21 05:05:02] [INFO ] Deduced a trap composed of 20 places in 376 ms of which 6 ms to minimize.
[2024-05-21 05:05:03] [INFO ] Deduced a trap composed of 17 places in 365 ms of which 7 ms to minimize.
[2024-05-21 05:05:03] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 6 ms to minimize.
[2024-05-21 05:05:04] [INFO ] Deduced a trap composed of 70 places in 363 ms of which 6 ms to minimize.
[2024-05-21 05:05:04] [INFO ] Deduced a trap composed of 21 places in 375 ms of which 7 ms to minimize.
[2024-05-21 05:05:04] [INFO ] Deduced a trap composed of 60 places in 382 ms of which 6 ms to minimize.
[2024-05-21 05:05:05] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 6 ms to minimize.
[2024-05-21 05:05:05] [INFO ] Deduced a trap composed of 69 places in 367 ms of which 7 ms to minimize.
[2024-05-21 05:05:05] [INFO ] Deduced a trap composed of 68 places in 332 ms of which 6 ms to minimize.
[2024-05-21 05:05:06] [INFO ] Deduced a trap composed of 65 places in 353 ms of which 7 ms to minimize.
[2024-05-21 05:05:06] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 6 ms to minimize.
[2024-05-21 05:05:07] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 5 ms to minimize.
[2024-05-21 05:05:07] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 5 ms to minimize.
[2024-05-21 05:05:07] [INFO ] Deduced a trap composed of 20 places in 366 ms of which 6 ms to minimize.
[2024-05-21 05:05:08] [INFO ] Deduced a trap composed of 26 places in 330 ms of which 6 ms to minimize.
[2024-05-21 05:05:08] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 6 ms to minimize.
[2024-05-21 05:05:08] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 5 ms to minimize.
[2024-05-21 05:05:09] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:05:16] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 5 ms to minimize.
[2024-05-21 05:05:16] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 6 ms to minimize.
[2024-05-21 05:05:16] [INFO ] Deduced a trap composed of 69 places in 300 ms of which 6 ms to minimize.
[2024-05-21 05:05:17] [INFO ] Deduced a trap composed of 72 places in 292 ms of which 5 ms to minimize.
[2024-05-21 05:05:17] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 6 ms to minimize.
[2024-05-21 05:05:17] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 5 ms to minimize.
[2024-05-21 05:05:18] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 5 ms to minimize.
[2024-05-21 05:05:18] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 5 ms to minimize.
[2024-05-21 05:05:18] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 6 ms to minimize.
[2024-05-21 05:05:19] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 6 ms to minimize.
[2024-05-21 05:05:19] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 6 ms to minimize.
SMT process timed out in 30268ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 30276ms
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31114 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 268 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-06 finished in 31299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 464 transition count 288
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 180 rules applied. Total rules applied 342 place count 302 transition count 270
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 355 place count 290 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 356 place count 289 transition count 269
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 356 place count 289 transition count 212
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 470 place count 232 transition count 212
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 477 place count 225 transition count 205
Iterating global reduction 4 with 7 rules applied. Total rules applied 484 place count 225 transition count 205
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 484 place count 225 transition count 201
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 492 place count 221 transition count 201
Performed 85 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 662 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 663 place count 135 transition count 103
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 16 rules applied. Total rules applied 679 place count 124 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 684 place count 119 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 684 place count 119 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 696 place count 113 transition count 92
Applied a total of 696 rules in 82 ms. Remains 113 /465 variables (removed 352) and now considering 92/451 (removed 359) transitions.
// Phase 1: matrix 92 rows 113 cols
[2024-05-21 05:05:19] [INFO ] Computed 29 invariants in 2 ms
[2024-05-21 05:05:19] [INFO ] Implicit Places using invariants in 198 ms returned [44, 64, 84, 88, 98, 102, 107, 112]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 200 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/465 places, 92/451 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 99 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 99 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 96 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 96 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 95 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 95 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 94 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 94 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 93 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 93 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 91 transition count 78
Applied a total of 28 rules in 29 ms. Remains 91 /105 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 91 cols
[2024-05-21 05:05:20] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 05:05:20] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 05:05:20] [INFO ] Invariant cache hit.
[2024-05-21 05:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 05:05:20] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/465 places, 78/451 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 642 ms. Remains : 91/465 places, 78/451 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-07
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-07 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 164 place count 464 transition count 286
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 182 rules applied. Total rules applied 346 place count 300 transition count 268
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 358 place count 288 transition count 268
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 358 place count 288 transition count 212
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 470 place count 232 transition count 212
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 476 place count 226 transition count 206
Iterating global reduction 3 with 6 rules applied. Total rules applied 482 place count 226 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 482 place count 226 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 488 place count 223 transition count 203
Performed 87 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 662 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 663 place count 135 transition count 103
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 679 place count 124 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 684 place count 119 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 684 place count 119 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 696 place count 113 transition count 92
Applied a total of 696 rules in 47 ms. Remains 113 /465 variables (removed 352) and now considering 92/451 (removed 359) transitions.
// Phase 1: matrix 92 rows 113 cols
[2024-05-21 05:05:20] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 05:05:20] [INFO ] Implicit Places using invariants in 113 ms returned [46, 66, 86, 90, 94, 98, 102, 107, 112]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 114 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/465 places, 92/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 93 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 92 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 92 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 91 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 91 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 90 transition count 78
Applied a total of 28 rules in 15 ms. Remains 90 /104 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 90 cols
[2024-05-21 05:05:20] [INFO ] Computed 20 invariants in 0 ms
[2024-05-21 05:05:20] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 05:05:20] [INFO ] Invariant cache hit.
[2024-05-21 05:05:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 05:05:20] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/465 places, 78/451 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 370 ms. Remains : 90/465 places, 78/451 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-08
Product exploration explored 100000 steps with 7831 reset in 283 ms.
Stack based approach found an accepted trace after 6682 steps with 524 reset with depth 11 and stack size 11 in 35 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-08 finished in 735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1)))&&X(F((p2||G(p3))))))'
Support contains 3 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 458 transition count 444
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 458 transition count 444
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 454 transition count 440
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 454 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 453 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 453 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 452 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 452 transition count 438
Applied a total of 26 rules in 71 ms. Remains 452 /465 variables (removed 13) and now considering 438/451 (removed 13) transitions.
// Phase 1: matrix 438 rows 452 cols
[2024-05-21 05:05:21] [INFO ] Computed 40 invariants in 5 ms
[2024-05-21 05:05:21] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-21 05:05:21] [INFO ] Invariant cache hit.
[2024-05-21 05:05:22] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-21 05:05:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 05:05:35] [INFO ] Deduced a trap composed of 23 places in 428 ms of which 7 ms to minimize.
[2024-05-21 05:05:36] [INFO ] Deduced a trap composed of 74 places in 435 ms of which 7 ms to minimize.
[2024-05-21 05:05:36] [INFO ] Deduced a trap composed of 16 places in 402 ms of which 6 ms to minimize.
[2024-05-21 05:05:36] [INFO ] Deduced a trap composed of 68 places in 396 ms of which 7 ms to minimize.
[2024-05-21 05:05:37] [INFO ] Deduced a trap composed of 18 places in 391 ms of which 7 ms to minimize.
[2024-05-21 05:05:37] [INFO ] Deduced a trap composed of 61 places in 389 ms of which 7 ms to minimize.
[2024-05-21 05:05:38] [INFO ] Deduced a trap composed of 60 places in 398 ms of which 7 ms to minimize.
[2024-05-21 05:05:38] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 6 ms to minimize.
[2024-05-21 05:05:38] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 6 ms to minimize.
[2024-05-21 05:05:39] [INFO ] Deduced a trap composed of 69 places in 352 ms of which 6 ms to minimize.
[2024-05-21 05:05:39] [INFO ] Deduced a trap composed of 60 places in 410 ms of which 6 ms to minimize.
[2024-05-21 05:05:40] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 7 ms to minimize.
[2024-05-21 05:05:40] [INFO ] Deduced a trap composed of 72 places in 407 ms of which 7 ms to minimize.
[2024-05-21 05:05:41] [INFO ] Deduced a trap composed of 21 places in 348 ms of which 6 ms to minimize.
[2024-05-21 05:05:41] [INFO ] Deduced a trap composed of 69 places in 353 ms of which 6 ms to minimize.
[2024-05-21 05:05:41] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 6 ms to minimize.
[2024-05-21 05:05:42] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 5 ms to minimize.
[2024-05-21 05:05:42] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 6 ms to minimize.
[2024-05-21 05:05:42] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 4 ms to minimize.
[2024-05-21 05:05:42] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 05:05:49] [INFO ] Deduced a trap composed of 76 places in 327 ms of which 6 ms to minimize.
[2024-05-21 05:05:50] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 6 ms to minimize.
[2024-05-21 05:05:50] [INFO ] Deduced a trap composed of 70 places in 305 ms of which 6 ms to minimize.
[2024-05-21 05:05:50] [INFO ] Deduced a trap composed of 87 places in 283 ms of which 6 ms to minimize.
[2024-05-21 05:05:51] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 5 ms to minimize.
[2024-05-21 05:05:51] [INFO ] Deduced a trap composed of 78 places in 298 ms of which 6 ms to minimize.
[2024-05-21 05:05:51] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 6 ms to minimize.
[2024-05-21 05:05:51] [INFO ] Deduced a trap composed of 78 places in 275 ms of which 5 ms to minimize.
[2024-05-21 05:05:52] [INFO ] Deduced a trap composed of 80 places in 277 ms of which 5 ms to minimize.
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 30106ms
Starting structural reductions in LTL mode, iteration 1 : 452/465 places, 438/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31132 ms. Remains : 452/465 places, 438/451 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-09
Product exploration explored 100000 steps with 426 reset in 301 ms.
Product exploration explored 100000 steps with 432 reset in 343 ms.
Computed a total of 112 stabilizing places and 112 stable transitions
Computed a total of 112 stabilizing places and 112 stable transitions
Detected a total of 112/452 stabilizing places and 112/438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p2) p3)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p2) p3))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 194 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), true, false, false]
RANDOM walk for 40000 steps (136 resets) in 664 ms. (60 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
[2024-05-21 05:05:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 387/420 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 32/452 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 438/890 variables, 452/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/890 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/890 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 492 constraints, problems are : Problem set: 0 solved, 4 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 387/420 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 05:05:55] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
At refinement iteration 6 (OVERLAPS) 32/452 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 05:05:55] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 5 ms to minimize.
[2024-05-21 05:05:55] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 5 ms to minimize.
[2024-05-21 05:05:56] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 5 ms to minimize.
[2024-05-21 05:05:56] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 5 ms to minimize.
[2024-05-21 05:05:56] [INFO ] Deduced a trap composed of 80 places in 233 ms of which 5 ms to minimize.
[2024-05-21 05:05:56] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 4 ms to minimize.
[2024-05-21 05:05:56] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 7/48 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 438/890 variables, 452/500 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 3/503 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 05:05:57] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 4 ms to minimize.
[2024-05-21 05:05:57] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 4 ms to minimize.
[2024-05-21 05:05:57] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/890 variables, 3/506 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 0/506 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/890 variables, 0/506 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 506 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3434 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 3887ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1678 steps, including 6 resets, run visited all 3 properties in 61 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 72 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p2) p3)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p2) p3))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p2) p3 (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) p3))), (F p2), (F (NOT (OR p2 p3))), (F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 19 factoid took 271 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-06b-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-06b-LTLFireability-09 finished in 37504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X((F(p0) U p1))))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 70 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 05:05:58] [INFO ] Computed 40 invariants in 4 ms
[2024-05-21 05:05:59] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-21 05:05:59] [INFO ] Invariant cache hit.
[2024-05-21 05:05:59] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 05:05:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:06:12] [INFO ] Deduced a trap composed of 23 places in 438 ms of which 7 ms to minimize.
[2024-05-21 05:06:13] [INFO ] Deduced a trap composed of 74 places in 424 ms of which 7 ms to minimize.
[2024-05-21 05:06:13] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 6 ms to minimize.
[2024-05-21 05:06:14] [INFO ] Deduced a trap composed of 17 places in 410 ms of which 7 ms to minimize.
[2024-05-21 05:06:14] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 6 ms to minimize.
[2024-05-21 05:06:14] [INFO ] Deduced a trap composed of 70 places in 349 ms of which 6 ms to minimize.
[2024-05-21 05:06:15] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 6 ms to minimize.
[2024-05-21 05:06:15] [INFO ] Deduced a trap composed of 60 places in 335 ms of which 6 ms to minimize.
[2024-05-21 05:06:15] [INFO ] Deduced a trap composed of 23 places in 359 ms of which 6 ms to minimize.
[2024-05-21 05:06:16] [INFO ] Deduced a trap composed of 69 places in 345 ms of which 6 ms to minimize.
[2024-05-21 05:06:16] [INFO ] Deduced a trap composed of 68 places in 283 ms of which 6 ms to minimize.
[2024-05-21 05:06:17] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 6 ms to minimize.
[2024-05-21 05:06:17] [INFO ] Deduced a trap composed of 26 places in 333 ms of which 6 ms to minimize.
[2024-05-21 05:06:17] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 4 ms to minimize.
[2024-05-21 05:06:18] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 4 ms to minimize.
[2024-05-21 05:06:18] [INFO ] Deduced a trap composed of 20 places in 349 ms of which 6 ms to minimize.
[2024-05-21 05:06:18] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 6 ms to minimize.
[2024-05-21 05:06:19] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 6 ms to minimize.
[2024-05-21 05:06:19] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 5 ms to minimize.
[2024-05-21 05:06:19] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:06:26] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 5 ms to minimize.
[2024-05-21 05:06:27] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 6 ms to minimize.
[2024-05-21 05:06:27] [INFO ] Deduced a trap composed of 69 places in 308 ms of which 6 ms to minimize.
[2024-05-21 05:06:28] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 6 ms to minimize.
[2024-05-21 05:06:28] [INFO ] Deduced a trap composed of 68 places in 308 ms of which 5 ms to minimize.
[2024-05-21 05:06:28] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 5 ms to minimize.
[2024-05-21 05:06:28] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 4 ms to minimize.
[2024-05-21 05:06:29] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 5 ms to minimize.
[2024-05-21 05:06:29] [INFO ] Deduced a trap composed of 67 places in 320 ms of which 11 ms to minimize.
[2024-05-21 05:06:29] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 5 ms to minimize.
SMT process timed out in 30154ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 30162ms
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31265 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 579 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-10
Stuttering criterion allowed to conclude after 283 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-10 finished in 31874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p1 U p2))))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 458 transition count 444
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 458 transition count 444
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 452 transition count 438
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 452 transition count 438
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 450 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Applied a total of 34 rules in 68 ms. Remains 448 /465 variables (removed 17) and now considering 434/451 (removed 17) transitions.
// Phase 1: matrix 434 rows 448 cols
[2024-05-21 05:06:30] [INFO ] Computed 40 invariants in 5 ms
[2024-05-21 05:06:30] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-21 05:06:30] [INFO ] Invariant cache hit.
[2024-05-21 05:06:31] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-21 05:06:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 05:06:44] [INFO ] Deduced a trap composed of 67 places in 475 ms of which 8 ms to minimize.
[2024-05-21 05:06:45] [INFO ] Deduced a trap composed of 16 places in 412 ms of which 6 ms to minimize.
[2024-05-21 05:06:45] [INFO ] Deduced a trap composed of 64 places in 402 ms of which 7 ms to minimize.
[2024-05-21 05:06:46] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 6 ms to minimize.
[2024-05-21 05:06:46] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 6 ms to minimize.
[2024-05-21 05:06:46] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 7 ms to minimize.
[2024-05-21 05:06:47] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 5 ms to minimize.
[2024-05-21 05:06:47] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 5 ms to minimize.
[2024-05-21 05:06:47] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 5 ms to minimize.
[2024-05-21 05:06:48] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 5 ms to minimize.
[2024-05-21 05:06:48] [INFO ] Deduced a trap composed of 62 places in 364 ms of which 7 ms to minimize.
[2024-05-21 05:06:49] [INFO ] Deduced a trap composed of 58 places in 348 ms of which 6 ms to minimize.
[2024-05-21 05:06:49] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 6 ms to minimize.
[2024-05-21 05:06:50] [INFO ] Deduced a trap composed of 62 places in 324 ms of which 6 ms to minimize.
[2024-05-21 05:06:51] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 5 ms to minimize.
[2024-05-21 05:06:51] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 6 ms to minimize.
[2024-05-21 05:06:52] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-21 05:06:54] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 4 ms to minimize.
[2024-05-21 05:06:54] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/882 variables, and 59 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 05:07:09] [INFO ] Deduced a trap composed of 69 places in 317 ms of which 7 ms to minimize.
[2024-05-21 05:07:09] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 6 ms to minimize.
[2024-05-21 05:07:09] [INFO ] Deduced a trap composed of 63 places in 338 ms of which 6 ms to minimize.
[2024-05-21 05:07:10] [INFO ] Deduced a trap composed of 64 places in 349 ms of which 6 ms to minimize.
[2024-05-21 05:07:10] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 6 ms to minimize.
[2024-05-21 05:07:11] [INFO ] Deduced a trap composed of 27 places in 338 ms of which 6 ms to minimize.
[2024-05-21 05:07:11] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 4 ms to minimize.
[2024-05-21 05:07:11] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 4 ms to minimize.
[2024-05-21 05:07:11] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 4 ms to minimize.
[2024-05-21 05:07:12] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 4 ms to minimize.
[2024-05-21 05:07:12] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 4 ms to minimize.
[2024-05-21 05:07:12] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 4 ms to minimize.
[2024-05-21 05:07:12] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 4 ms to minimize.
[2024-05-21 05:07:13] [INFO ] Deduced a trap composed of 20 places in 376 ms of which 6 ms to minimize.
[2024-05-21 05:07:13] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 5 ms to minimize.
[2024-05-21 05:07:14] [INFO ] Deduced a trap composed of 28 places in 330 ms of which 6 ms to minimize.
[2024-05-21 05:07:14] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 4 ms to minimize.
[2024-05-21 05:07:14] [INFO ] Deduced a trap composed of 72 places in 298 ms of which 5 ms to minimize.
[2024-05-21 05:07:15] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 5 ms to minimize.
[2024-05-21 05:07:15] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 05:07:17] [INFO ] Deduced a trap composed of 66 places in 350 ms of which 6 ms to minimize.
[2024-05-21 05:07:17] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 6 ms to minimize.
[2024-05-21 05:07:18] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 5 ms to minimize.
[2024-05-21 05:07:18] [INFO ] Deduced a trap composed of 75 places in 236 ms of which 5 ms to minimize.
[2024-05-21 05:07:18] [INFO ] Deduced a trap composed of 72 places in 245 ms of which 5 ms to minimize.
[2024-05-21 05:07:19] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 5 ms to minimize.
[2024-05-21 05:07:19] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 5 ms to minimize.
[2024-05-21 05:07:19] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 4 ms to minimize.
[2024-05-21 05:07:19] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 3 ms to minimize.
[2024-05-21 05:07:19] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-05-21 05:07:20] [INFO ] Deduced a trap composed of 83 places in 165 ms of which 3 ms to minimize.
[2024-05-21 05:07:20] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 4 ms to minimize.
[2024-05-21 05:07:22] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 5 ms to minimize.
[2024-05-21 05:07:23] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 5 ms to minimize.
[2024-05-21 05:07:23] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 4 ms to minimize.
[2024-05-21 05:07:24] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 4 ms to minimize.
[2024-05-21 05:07:24] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 3 ms to minimize.
[2024-05-21 05:07:25] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 05:07:28] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 4 ms to minimize.
[2024-05-21 05:07:28] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 6 ms to minimize.
[2024-05-21 05:07:29] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 6 ms to minimize.
[2024-05-21 05:07:30] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/882 variables, and 101 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 0/433 constraints, Known Traps: 61/61 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 448/465 places, 434/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61221 ms. Remains : 448/465 places, 434/451 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 406 reset in 300 ms.
Product exploration explored 100000 steps with 404 reset in 346 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/448 stabilizing places and 108/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 15642 steps (50 resets) in 46 ms. (332 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-21 05:07:33] [INFO ] Invariant cache hit.
[2024-05-21 05:07:33] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2024-05-21 05:07:33] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 05:07:34] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2024-05-21 05:07:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 05:07:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 32 ms returned sat
[2024-05-21 05:07:34] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 05:07:35] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2024-05-21 05:07:35] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 6 ms to minimize.
[2024-05-21 05:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-21 05:07:35] [INFO ] Computed and/alt/rep : 433/617/433 causal constraints (skipped 0 transitions) in 51 ms.
[2024-05-21 05:07:40] [INFO ] Added : 394 causal constraints over 79 iterations in 4948 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 448 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 434/434 transitions.
Applied a total of 0 rules in 13 ms. Remains 448 /448 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-21 05:07:40] [INFO ] Invariant cache hit.
[2024-05-21 05:07:40] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 05:07:40] [INFO ] Invariant cache hit.
[2024-05-21 05:07:41] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-21 05:07:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 05:07:54] [INFO ] Deduced a trap composed of 67 places in 419 ms of which 7 ms to minimize.
[2024-05-21 05:07:55] [INFO ] Deduced a trap composed of 16 places in 447 ms of which 7 ms to minimize.
[2024-05-21 05:07:55] [INFO ] Deduced a trap composed of 64 places in 424 ms of which 7 ms to minimize.
[2024-05-21 05:07:55] [INFO ] Deduced a trap composed of 17 places in 411 ms of which 6 ms to minimize.
[2024-05-21 05:07:56] [INFO ] Deduced a trap composed of 23 places in 417 ms of which 7 ms to minimize.
[2024-05-21 05:07:56] [INFO ] Deduced a trap composed of 26 places in 369 ms of which 7 ms to minimize.
[2024-05-21 05:07:57] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 5 ms to minimize.
[2024-05-21 05:07:57] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 5 ms to minimize.
[2024-05-21 05:07:57] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 5 ms to minimize.
[2024-05-21 05:07:58] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 5 ms to minimize.
[2024-05-21 05:07:58] [INFO ] Deduced a trap composed of 62 places in 377 ms of which 6 ms to minimize.
[2024-05-21 05:07:59] [INFO ] Deduced a trap composed of 58 places in 351 ms of which 6 ms to minimize.
[2024-05-21 05:07:59] [INFO ] Deduced a trap composed of 64 places in 364 ms of which 6 ms to minimize.
[2024-05-21 05:08:00] [INFO ] Deduced a trap composed of 62 places in 341 ms of which 5 ms to minimize.
[2024-05-21 05:08:01] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 4 ms to minimize.
[2024-05-21 05:08:01] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 6 ms to minimize.
[2024-05-21 05:08:02] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-21 05:08:04] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 4 ms to minimize.
[2024-05-21 05:08:04] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/882 variables, and 59 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 05:08:19] [INFO ] Deduced a trap composed of 69 places in 385 ms of which 7 ms to minimize.
[2024-05-21 05:08:19] [INFO ] Deduced a trap composed of 71 places in 363 ms of which 6 ms to minimize.
[2024-05-21 05:08:20] [INFO ] Deduced a trap composed of 63 places in 352 ms of which 7 ms to minimize.
[2024-05-21 05:08:20] [INFO ] Deduced a trap composed of 64 places in 331 ms of which 6 ms to minimize.
[2024-05-21 05:08:20] [INFO ] Deduced a trap composed of 77 places in 307 ms of which 6 ms to minimize.
[2024-05-21 05:08:21] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 6 ms to minimize.
[2024-05-21 05:08:21] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 5 ms to minimize.
[2024-05-21 05:08:21] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 4 ms to minimize.
[2024-05-21 05:08:22] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 5 ms to minimize.
[2024-05-21 05:08:22] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 5 ms to minimize.
[2024-05-21 05:08:22] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 4 ms to minimize.
[2024-05-21 05:08:22] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 5 ms to minimize.
[2024-05-21 05:08:22] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 4 ms to minimize.
[2024-05-21 05:08:23] [INFO ] Deduced a trap composed of 20 places in 371 ms of which 7 ms to minimize.
[2024-05-21 05:08:23] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 5 ms to minimize.
[2024-05-21 05:08:24] [INFO ] Deduced a trap composed of 28 places in 313 ms of which 5 ms to minimize.
[2024-05-21 05:08:24] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 5 ms to minimize.
[2024-05-21 05:08:25] [INFO ] Deduced a trap composed of 72 places in 313 ms of which 5 ms to minimize.
[2024-05-21 05:08:25] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 5 ms to minimize.
[2024-05-21 05:08:25] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 05:08:27] [INFO ] Deduced a trap composed of 66 places in 362 ms of which 6 ms to minimize.
[2024-05-21 05:08:28] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 5 ms to minimize.
[2024-05-21 05:08:28] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 5 ms to minimize.
[2024-05-21 05:08:28] [INFO ] Deduced a trap composed of 75 places in 245 ms of which 5 ms to minimize.
[2024-05-21 05:08:28] [INFO ] Deduced a trap composed of 72 places in 236 ms of which 5 ms to minimize.
[2024-05-21 05:08:29] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 5 ms to minimize.
[2024-05-21 05:08:29] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 4 ms to minimize.
[2024-05-21 05:08:29] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 4 ms to minimize.
[2024-05-21 05:08:29] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 3 ms to minimize.
[2024-05-21 05:08:30] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 4 ms to minimize.
[2024-05-21 05:08:30] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 4 ms to minimize.
[2024-05-21 05:08:30] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 4 ms to minimize.
[2024-05-21 05:08:32] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 5 ms to minimize.
[2024-05-21 05:08:33] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 5 ms to minimize.
[2024-05-21 05:08:33] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2024-05-21 05:08:34] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 4 ms to minimize.
[2024-05-21 05:08:35] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 4 ms to minimize.
[2024-05-21 05:08:36] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-21 05:08:38] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 4 ms to minimize.
[2024-05-21 05:08:39] [INFO ] Deduced a trap composed of 74 places in 344 ms of which 6 ms to minimize.
[2024-05-21 05:08:39] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 6 ms to minimize.
[2024-05-21 05:08:40] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
(s419 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/882 variables, and 101 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 0/433 constraints, Known Traps: 61/61 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in LTL mode , in 1 iterations and 61206 ms. Remains : 448/448 places, 434/434 transitions.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/448 stabilizing places and 108/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 23996 steps (81 resets) in 93 ms. (255 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-21 05:08:42] [INFO ] Invariant cache hit.
[2024-05-21 05:08:43] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2024-05-21 05:08:43] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 05:08:43] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-05-21 05:08:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 05:08:44] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2024-05-21 05:08:44] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 05:08:45] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2024-05-21 05:08:45] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-21 05:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-21 05:08:45] [INFO ] Computed and/alt/rep : 433/617/433 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-21 05:08:50] [INFO ] Added : 394 causal constraints over 79 iterations in 4959 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 403 reset in 294 ms.
Product exploration explored 100000 steps with 405 reset in 331 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 434/434 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 448 transition count 434
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 152 place count 448 transition count 428
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 152 place count 448 transition count 428
Deduced a syphon composed of 206 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 212 place count 448 transition count 428
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 332 place count 328 transition count 308
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 120 rules applied. Total rules applied 452 place count 328 transition count 308
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 192 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 557 place count 328 transition count 296
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 625 place count 260 transition count 228
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 2 with 68 rules applied. Total rules applied 693 place count 260 transition count 228
Deduced a syphon composed of 124 places in 0 ms
Applied a total of 693 rules in 71 ms. Remains 260 /448 variables (removed 188) and now considering 228/434 (removed 206) transitions.
[2024-05-21 05:08:51] [INFO ] Redundant transitions in 7 ms returned []
Running 227 sub problems to find dead transitions.
// Phase 1: matrix 228 rows 260 cols
[2024-05-21 05:08:51] [INFO ] Computed 40 invariants in 4 ms
[2024-05-21 05:08:51] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 1/260 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 05:08:57] [INFO ] Deduced a trap composed of 2 places in 159 ms of which 4 ms to minimize.
[2024-05-21 05:08:57] [INFO ] Deduced a trap composed of 2 places in 218 ms of which 4 ms to minimize.
[2024-05-21 05:08:57] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-21 05:08:58] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 05:08:58] [INFO ] Deduced a trap composed of 2 places in 192 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 05:08:58] [INFO ] Deduced a trap composed of 2 places in 146 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 05:08:58] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 4 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 05:08:58] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 4 ms to minimize.
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 3 ms to minimize.
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 05:08:59] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/60 constraints. Problems are: Problem set: 66 solved, 161 unsolved
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-21 05:09:00] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
[2024-05-21 05:09:01] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 20/80 constraints. Problems are: Problem set: 124 solved, 103 unsolved
[2024-05-21 05:09:02] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 1/81 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/81 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 228/488 variables, 260/341 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 44/385 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/385 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/488 variables, 0/385 constraints. Problems are: Problem set: 124 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 385 constraints, problems are : Problem set: 124 solved, 103 unsolved in 17786 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 260/260 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 124 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 121/256 variables, 38/38 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 41/79 constraints. Problems are: Problem set: 124 solved, 103 unsolved
[2024-05-21 05:09:10] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/80 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/80 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 4/260 variables, 2/82 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/82 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 228/488 variables, 260/342 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 44/386 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 103/489 constraints. Problems are: Problem set: 124 solved, 103 unsolved
[2024-05-21 05:09:14] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/490 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/490 constraints. Problems are: Problem set: 124 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 0/488 variables, 0/490 constraints. Problems are: Problem set: 124 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 490 constraints, problems are : Problem set: 124 solved, 103 unsolved in 21142 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 260/260 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 103/227 constraints, Known Traps: 43/43 constraints]
After SMT, in 39051ms problems are : Problem set: 124 solved, 103 unsolved
Search for dead transitions found 124 dead transitions in 39056ms
Found 124 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 124 transitions
Dead transitions reduction (with SMT) removed 124 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 260/448 places, 104/434 transitions.
Graph (complete) has 350 edges and 260 vertex of which 136 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.1 ms
Discarding 124 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 136 /260 variables (removed 124) and now considering 104/104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 136/448 places, 104/434 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39148 ms. Remains : 136/448 places, 104/434 transitions.
Built C files in :
/tmp/ltsmin13560794980858033131
[2024-05-21 05:09:30] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13560794980858033131
Running compilation step : cd /tmp/ltsmin13560794980858033131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1357 ms.
Running link step : cd /tmp/ltsmin13560794980858033131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13560794980858033131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8759928936798780830.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 434/434 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 447 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 433
Applied a total of 2 rules in 14 ms. Remains 447 /448 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 447 cols
[2024-05-21 05:09:45] [INFO ] Computed 40 invariants in 2 ms
[2024-05-21 05:09:45] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 05:09:45] [INFO ] Invariant cache hit.
[2024-05-21 05:09:46] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-05-21 05:09:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 05:09:59] [INFO ] Deduced a trap composed of 62 places in 416 ms of which 7 ms to minimize.
[2024-05-21 05:09:59] [INFO ] Deduced a trap composed of 53 places in 382 ms of which 6 ms to minimize.
[2024-05-21 05:09:59] [INFO ] Deduced a trap composed of 16 places in 355 ms of which 6 ms to minimize.
[2024-05-21 05:10:00] [INFO ] Deduced a trap composed of 69 places in 352 ms of which 6 ms to minimize.
[2024-05-21 05:10:00] [INFO ] Deduced a trap composed of 52 places in 337 ms of which 6 ms to minimize.
[2024-05-21 05:10:01] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 6 ms to minimize.
[2024-05-21 05:10:01] [INFO ] Deduced a trap composed of 15 places in 340 ms of which 5 ms to minimize.
[2024-05-21 05:10:01] [INFO ] Deduced a trap composed of 51 places in 327 ms of which 6 ms to minimize.
[2024-05-21 05:10:02] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 6 ms to minimize.
[2024-05-21 05:10:02] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 5 ms to minimize.
[2024-05-21 05:10:02] [INFO ] Deduced a trap composed of 72 places in 247 ms of which 5 ms to minimize.
[2024-05-21 05:10:02] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 6 ms to minimize.
[2024-05-21 05:10:03] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 6 ms to minimize.
[2024-05-21 05:10:03] [INFO ] Deduced a trap composed of 74 places in 296 ms of which 6 ms to minimize.
[2024-05-21 05:10:03] [INFO ] Deduced a trap composed of 63 places in 294 ms of which 6 ms to minimize.
[2024-05-21 05:10:04] [INFO ] Deduced a trap composed of 22 places in 350 ms of which 6 ms to minimize.
[2024-05-21 05:10:04] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 6 ms to minimize.
[2024-05-21 05:10:04] [INFO ] Deduced a trap composed of 65 places in 322 ms of which 6 ms to minimize.
[2024-05-21 05:10:05] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 5 ms to minimize.
[2024-05-21 05:10:05] [INFO ] Deduced a trap composed of 89 places in 290 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 05:10:12] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 5 ms to minimize.
[2024-05-21 05:10:12] [INFO ] Deduced a trap composed of 63 places in 334 ms of which 7 ms to minimize.
[2024-05-21 05:10:13] [INFO ] Deduced a trap composed of 57 places in 350 ms of which 6 ms to minimize.
[2024-05-21 05:10:13] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 6 ms to minimize.
[2024-05-21 05:10:13] [INFO ] Deduced a trap composed of 26 places in 298 ms of which 5 ms to minimize.
[2024-05-21 05:10:14] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/880 variables, and 66 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 05:10:23] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 4 ms to minimize.
[2024-05-21 05:10:23] [INFO ] Deduced a trap composed of 71 places in 310 ms of which 5 ms to minimize.
[2024-05-21 05:10:24] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 6 ms to minimize.
[2024-05-21 05:10:24] [INFO ] Deduced a trap composed of 74 places in 283 ms of which 5 ms to minimize.
[2024-05-21 05:10:24] [INFO ] Deduced a trap composed of 77 places in 274 ms of which 5 ms to minimize.
[2024-05-21 05:10:24] [INFO ] Deduced a trap composed of 80 places in 231 ms of which 5 ms to minimize.
[2024-05-21 05:10:25] [INFO ] Deduced a trap composed of 75 places in 282 ms of which 5 ms to minimize.
[2024-05-21 05:10:25] [INFO ] Deduced a trap composed of 83 places in 272 ms of which 5 ms to minimize.
[2024-05-21 05:10:25] [INFO ] Deduced a trap composed of 75 places in 293 ms of which 5 ms to minimize.
[2024-05-21 05:10:26] [INFO ] Deduced a trap composed of 74 places in 281 ms of which 6 ms to minimize.
[2024-05-21 05:10:26] [INFO ] Deduced a trap composed of 76 places in 278 ms of which 5 ms to minimize.
[2024-05-21 05:10:26] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 4 ms to minimize.
[2024-05-21 05:10:26] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 4 ms to minimize.
[2024-05-21 05:10:27] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 4 ms to minimize.
[2024-05-21 05:10:27] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 4 ms to minimize.
[2024-05-21 05:10:27] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 4 ms to minimize.
[2024-05-21 05:10:27] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 5 ms to minimize.
[2024-05-21 05:10:27] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 4 ms to minimize.
[2024-05-21 05:10:28] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 4 ms to minimize.
[2024-05-21 05:10:28] [INFO ] Deduced a trap composed of 66 places in 358 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 05:10:30] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 5 ms to minimize.
[2024-05-21 05:10:30] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 5 ms to minimize.
[2024-05-21 05:10:30] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 4 ms to minimize.
[2024-05-21 05:10:30] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 4 ms to minimize.
[2024-05-21 05:10:31] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 4 ms to minimize.
[2024-05-21 05:10:31] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 4 ms to minimize.
[2024-05-21 05:10:31] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 4 ms to minimize.
[2024-05-21 05:10:32] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 4 ms to minimize.
[2024-05-21 05:10:32] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 5 ms to minimize.
[2024-05-21 05:10:33] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 4 ms to minimize.
[2024-05-21 05:10:33] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 5 ms to minimize.
[2024-05-21 05:10:33] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 5 ms to minimize.
[2024-05-21 05:10:34] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 4 ms to minimize.
[2024-05-21 05:10:34] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 5 ms to minimize.
[2024-05-21 05:10:34] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 4 ms to minimize.
[2024-05-21 05:10:34] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 6 ms to minimize.
[2024-05-21 05:10:34] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 4 ms to minimize.
[2024-05-21 05:10:35] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-21 05:10:35] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 4 ms to minimize.
[2024-05-21 05:10:35] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-21 05:10:38] [INFO ] Deduced a trap composed of 91 places in 178 ms of which 4 ms to minimize.
[2024-05-21 05:10:39] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 4 ms to minimize.
[2024-05-21 05:10:39] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 4 ms to minimize.
[2024-05-21 05:10:39] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-05-21 05:10:39] [INFO ] Deduced a trap composed of 81 places in 198 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/880 variables, and 111 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/432 constraints, Known Traps: 71/71 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 447/448 places, 433/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60911 ms. Remains : 447/448 places, 433/434 transitions.
Built C files in :
/tmp/ltsmin9568752427781818825
[2024-05-21 05:10:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9568752427781818825
Running compilation step : cd /tmp/ltsmin9568752427781818825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1321 ms.
Running link step : cd /tmp/ltsmin9568752427781818825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9568752427781818825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12575289521714573362.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 05:11:01] [INFO ] Flatten gal took : 15 ms
[2024-05-21 05:11:01] [INFO ] Flatten gal took : 14 ms
[2024-05-21 05:11:01] [INFO ] Time to serialize gal into /tmp/LTL2594737623878156400.gal : 4 ms
[2024-05-21 05:11:01] [INFO ] Time to serialize properties into /tmp/LTL3602822218472330171.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2594737623878156400.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1480165077836800138.hoa' '-atoms' '/tmp/LTL3602822218472330171.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3602822218472330171.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1480165077836800138.hoa
Detected timeout of ITS tools.
[2024-05-21 05:11:16] [INFO ] Flatten gal took : 14 ms
[2024-05-21 05:11:16] [INFO ] Flatten gal took : 13 ms
[2024-05-21 05:11:16] [INFO ] Time to serialize gal into /tmp/LTL15262537652171287053.gal : 3 ms
[2024-05-21 05:11:16] [INFO ] Time to serialize properties into /tmp/LTL3130210792479648840.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15262537652171287053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3130210792479648840.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p85==1)")||(("(p74==1)")U("(p31==1)")))))))
Formula 0 simplified : XXG(!"(p85==1)" & (!"(p74==1)" R !"(p31==1)"))
Detected timeout of ITS tools.
[2024-05-21 05:11:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 05:11:31] [INFO ] Applying decomposition
[2024-05-21 05:11:31] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17358660904014156255.txt' '-o' '/tmp/graph17358660904014156255.bin' '-w' '/tmp/graph17358660904014156255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17358660904014156255.bin' '-l' '-1' '-v' '-w' '/tmp/graph17358660904014156255.weights' '-q' '0' '-e' '0.001'
[2024-05-21 05:11:31] [INFO ] Decomposing Gal with order
[2024-05-21 05:11:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 05:11:31] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-21 05:11:31] [INFO ] Flatten gal took : 36 ms
[2024-05-21 05:11:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 05:11:31] [INFO ] Time to serialize gal into /tmp/LTL8322687945601719079.gal : 8 ms
[2024-05-21 05:11:31] [INFO ] Time to serialize properties into /tmp/LTL12493608399164863906.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8322687945601719079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12493608399164863906.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i5.u26.p85==1)")||(("(i4.u24.p74==1)")U("(i5.u12.p31==1)")))))))
Formula 0 simplified : XXG(!"(i5.u26.p85==1)" & (!"(i4.u24.p74==1)" R !"(i5.u12.p31==1)"))
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-06b-LTLFireability-11 finished in 316201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 464 transition count 285
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 183 rules applied. Total rules applied 348 place count 299 transition count 267
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 287 transition count 267
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 360 place count 287 transition count 212
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 470 place count 232 transition count 212
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 477 place count 225 transition count 205
Iterating global reduction 3 with 7 rules applied. Total rules applied 484 place count 225 transition count 205
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 484 place count 225 transition count 201
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 492 place count 221 transition count 201
Performed 84 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 660 place count 137 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 661 place count 136 transition count 104
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 677 place count 125 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 682 place count 120 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 682 place count 120 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 694 place count 114 transition count 93
Applied a total of 694 rules in 24 ms. Remains 114 /465 variables (removed 351) and now considering 93/451 (removed 358) transitions.
// Phase 1: matrix 93 rows 114 cols
[2024-05-21 05:11:46] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 05:11:46] [INFO ] Implicit Places using invariants in 123 ms returned [45, 65, 85, 89, 98, 102, 107, 113]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 125 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/465 places, 93/451 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 100 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 100 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 99 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 99 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 98 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 96 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 96 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 95 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 95 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 92 transition count 79
Applied a total of 28 rules in 11 ms. Remains 92 /106 variables (removed 14) and now considering 79/93 (removed 14) transitions.
// Phase 1: matrix 79 rows 92 cols
[2024-05-21 05:11:46] [INFO ] Computed 21 invariants in 0 ms
[2024-05-21 05:11:46] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 05:11:47] [INFO ] Invariant cache hit.
[2024-05-21 05:11:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 05:11:47] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/465 places, 79/451 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 483 ms. Remains : 92/465 places, 79/451 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-13 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 64 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
// Phase 1: matrix 432 rows 446 cols
[2024-05-21 05:11:47] [INFO ] Computed 40 invariants in 4 ms
[2024-05-21 05:11:47] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-21 05:11:47] [INFO ] Invariant cache hit.
[2024-05-21 05:11:48] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 05:11:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:12:01] [INFO ] Deduced a trap composed of 23 places in 417 ms of which 7 ms to minimize.
[2024-05-21 05:12:01] [INFO ] Deduced a trap composed of 74 places in 392 ms of which 6 ms to minimize.
[2024-05-21 05:12:02] [INFO ] Deduced a trap composed of 20 places in 357 ms of which 6 ms to minimize.
[2024-05-21 05:12:02] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 7 ms to minimize.
[2024-05-21 05:12:02] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 6 ms to minimize.
[2024-05-21 05:12:03] [INFO ] Deduced a trap composed of 70 places in 360 ms of which 7 ms to minimize.
[2024-05-21 05:12:03] [INFO ] Deduced a trap composed of 21 places in 363 ms of which 6 ms to minimize.
[2024-05-21 05:12:03] [INFO ] Deduced a trap composed of 60 places in 379 ms of which 6 ms to minimize.
[2024-05-21 05:12:04] [INFO ] Deduced a trap composed of 23 places in 366 ms of which 6 ms to minimize.
[2024-05-21 05:12:04] [INFO ] Deduced a trap composed of 69 places in 378 ms of which 6 ms to minimize.
[2024-05-21 05:12:05] [INFO ] Deduced a trap composed of 68 places in 338 ms of which 6 ms to minimize.
[2024-05-21 05:12:05] [INFO ] Deduced a trap composed of 65 places in 386 ms of which 6 ms to minimize.
[2024-05-21 05:12:06] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 6 ms to minimize.
[2024-05-21 05:12:06] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 4 ms to minimize.
[2024-05-21 05:12:06] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 4 ms to minimize.
[2024-05-21 05:12:07] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 6 ms to minimize.
[2024-05-21 05:12:07] [INFO ] Deduced a trap composed of 26 places in 338 ms of which 6 ms to minimize.
[2024-05-21 05:12:07] [INFO ] Deduced a trap composed of 26 places in 333 ms of which 6 ms to minimize.
[2024-05-21 05:12:08] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 5 ms to minimize.
[2024-05-21 05:12:08] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:12:15] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 5 ms to minimize.
[2024-05-21 05:12:15] [INFO ] Deduced a trap composed of 21 places in 338 ms of which 6 ms to minimize.
[2024-05-21 05:12:16] [INFO ] Deduced a trap composed of 69 places in 310 ms of which 6 ms to minimize.
[2024-05-21 05:12:16] [INFO ] Deduced a trap composed of 72 places in 303 ms of which 5 ms to minimize.
[2024-05-21 05:12:16] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 6 ms to minimize.
[2024-05-21 05:12:17] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 5 ms to minimize.
[2024-05-21 05:12:17] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 5 ms to minimize.
[2024-05-21 05:12:17] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 4 ms to minimize.
[2024-05-21 05:12:18] [INFO ] Deduced a trap composed of 67 places in 331 ms of which 5 ms to minimize.
[2024-05-21 05:12:18] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/878 variables, and 70 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:12:25] [INFO ] Deduced a trap composed of 68 places in 291 ms of which 6 ms to minimize.
[2024-05-21 05:12:25] [INFO ] Deduced a trap composed of 66 places in 349 ms of which 6 ms to minimize.
[2024-05-21 05:12:26] [INFO ] Deduced a trap composed of 18 places in 323 ms of which 6 ms to minimize.
[2024-05-21 05:12:26] [INFO ] Deduced a trap composed of 58 places in 314 ms of which 6 ms to minimize.
[2024-05-21 05:12:26] [INFO ] Deduced a trap composed of 64 places in 305 ms of which 6 ms to minimize.
[2024-05-21 05:12:27] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 4 ms to minimize.
[2024-05-21 05:12:27] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 4 ms to minimize.
[2024-05-21 05:12:27] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 5 ms to minimize.
[2024-05-21 05:12:27] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 5 ms to minimize.
[2024-05-21 05:12:28] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 5 ms to minimize.
[2024-05-21 05:12:29] [INFO ] Deduced a trap composed of 72 places in 245 ms of which 5 ms to minimize.
[2024-05-21 05:12:29] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 5 ms to minimize.
[2024-05-21 05:12:29] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 5 ms to minimize.
[2024-05-21 05:12:30] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 5 ms to minimize.
[2024-05-21 05:12:30] [INFO ] Deduced a trap composed of 68 places in 229 ms of which 5 ms to minimize.
[2024-05-21 05:12:30] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 5 ms to minimize.
[2024-05-21 05:12:31] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 4 ms to minimize.
[2024-05-21 05:12:31] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 5 ms to minimize.
[2024-05-21 05:12:31] [INFO ] Deduced a trap composed of 71 places in 208 ms of which 4 ms to minimize.
[2024-05-21 05:12:31] [INFO ] Deduced a trap composed of 86 places in 238 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:12:32] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 4 ms to minimize.
[2024-05-21 05:12:34] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 4 ms to minimize.
[2024-05-21 05:12:34] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-05-21 05:12:34] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-05-21 05:12:34] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 4 ms to minimize.
[2024-05-21 05:12:35] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 4 ms to minimize.
[2024-05-21 05:12:36] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 5 ms to minimize.
[2024-05-21 05:12:37] [INFO ] Deduced a trap composed of 26 places in 308 ms of which 5 ms to minimize.
[2024-05-21 05:12:37] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 5 ms to minimize.
[2024-05-21 05:12:38] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 4 ms to minimize.
[2024-05-21 05:12:39] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:12:43] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 4 ms to minimize.
[2024-05-21 05:12:43] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 4 ms to minimize.
[2024-05-21 05:12:43] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 3 ms to minimize.
[2024-05-21 05:12:44] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 4 ms to minimize.
[2024-05-21 05:12:45] [INFO ] Deduced a trap composed of 69 places in 250 ms of which 5 ms to minimize.
[2024-05-21 05:12:45] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 4 ms to minimize.
[2024-05-21 05:12:46] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/878 variables, and 108 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 68/68 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61140 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-14 finished in 61276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 456 transition count 442
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 456 transition count 442
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 448 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 446 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 446 transition count 432
Applied a total of 38 rules in 71 ms. Remains 446 /465 variables (removed 19) and now considering 432/451 (removed 19) transitions.
[2024-05-21 05:12:48] [INFO ] Invariant cache hit.
[2024-05-21 05:12:48] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-21 05:12:48] [INFO ] Invariant cache hit.
[2024-05-21 05:12:49] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-21 05:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:13:02] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 7 ms to minimize.
[2024-05-21 05:13:03] [INFO ] Deduced a trap composed of 74 places in 398 ms of which 7 ms to minimize.
[2024-05-21 05:13:03] [INFO ] Deduced a trap composed of 20 places in 329 ms of which 6 ms to minimize.
[2024-05-21 05:13:04] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 7 ms to minimize.
[2024-05-21 05:13:04] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 6 ms to minimize.
[2024-05-21 05:13:04] [INFO ] Deduced a trap composed of 70 places in 368 ms of which 6 ms to minimize.
[2024-05-21 05:13:05] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 7 ms to minimize.
[2024-05-21 05:13:05] [INFO ] Deduced a trap composed of 60 places in 351 ms of which 6 ms to minimize.
[2024-05-21 05:13:05] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 7 ms to minimize.
[2024-05-21 05:13:06] [INFO ] Deduced a trap composed of 69 places in 352 ms of which 6 ms to minimize.
[2024-05-21 05:13:06] [INFO ] Deduced a trap composed of 68 places in 338 ms of which 6 ms to minimize.
[2024-05-21 05:13:07] [INFO ] Deduced a trap composed of 65 places in 350 ms of which 6 ms to minimize.
[2024-05-21 05:13:07] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 6 ms to minimize.
[2024-05-21 05:13:07] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 5 ms to minimize.
[2024-05-21 05:13:07] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 5 ms to minimize.
[2024-05-21 05:13:08] [INFO ] Deduced a trap composed of 20 places in 350 ms of which 6 ms to minimize.
[2024-05-21 05:13:08] [INFO ] Deduced a trap composed of 26 places in 332 ms of which 6 ms to minimize.
[2024-05-21 05:13:09] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 6 ms to minimize.
[2024-05-21 05:13:09] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 5 ms to minimize.
[2024-05-21 05:13:09] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:13:15] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 4 ms to minimize.
[2024-05-21 05:13:16] [INFO ] Deduced a trap composed of 21 places in 338 ms of which 6 ms to minimize.
[2024-05-21 05:13:16] [INFO ] Deduced a trap composed of 69 places in 294 ms of which 6 ms to minimize.
[2024-05-21 05:13:16] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 6 ms to minimize.
[2024-05-21 05:13:17] [INFO ] Deduced a trap composed of 68 places in 283 ms of which 5 ms to minimize.
[2024-05-21 05:13:17] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 4 ms to minimize.
[2024-05-21 05:13:17] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 5 ms to minimize.
[2024-05-21 05:13:17] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 5 ms to minimize.
[2024-05-21 05:13:18] [INFO ] Deduced a trap composed of 67 places in 294 ms of which 5 ms to minimize.
[2024-05-21 05:13:18] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 6 ms to minimize.
[2024-05-21 05:13:18] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 5 ms to minimize.
[2024-05-21 05:13:19] [INFO ] Deduced a trap composed of 71 places in 288 ms of which 5 ms to minimize.
[2024-05-21 05:13:19] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/878 variables, and 73 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 33/73 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:13:26] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 3 ms to minimize.
[2024-05-21 05:13:27] [INFO ] Deduced a trap composed of 63 places in 358 ms of which 6 ms to minimize.
[2024-05-21 05:13:27] [INFO ] Deduced a trap composed of 62 places in 355 ms of which 6 ms to minimize.
[2024-05-21 05:13:27] [INFO ] Deduced a trap composed of 70 places in 353 ms of which 6 ms to minimize.
[2024-05-21 05:13:28] [INFO ] Deduced a trap composed of 72 places in 306 ms of which 6 ms to minimize.
[2024-05-21 05:13:28] [INFO ] Deduced a trap composed of 68 places in 264 ms of which 5 ms to minimize.
[2024-05-21 05:13:28] [INFO ] Deduced a trap composed of 69 places in 271 ms of which 5 ms to minimize.
[2024-05-21 05:13:29] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 5 ms to minimize.
[2024-05-21 05:13:29] [INFO ] Deduced a trap composed of 77 places in 271 ms of which 5 ms to minimize.
[2024-05-21 05:13:29] [INFO ] Deduced a trap composed of 75 places in 262 ms of which 4 ms to minimize.
[2024-05-21 05:13:29] [INFO ] Deduced a trap composed of 81 places in 254 ms of which 5 ms to minimize.
[2024-05-21 05:13:30] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 4 ms to minimize.
[2024-05-21 05:13:30] [INFO ] Deduced a trap composed of 80 places in 240 ms of which 5 ms to minimize.
[2024-05-21 05:13:30] [INFO ] Deduced a trap composed of 71 places in 241 ms of which 4 ms to minimize.
[2024-05-21 05:13:30] [INFO ] Deduced a trap composed of 73 places in 232 ms of which 5 ms to minimize.
[2024-05-21 05:13:31] [INFO ] Deduced a trap composed of 78 places in 223 ms of which 4 ms to minimize.
[2024-05-21 05:13:31] [INFO ] Deduced a trap composed of 75 places in 232 ms of which 5 ms to minimize.
[2024-05-21 05:13:31] [INFO ] Deduced a trap composed of 74 places in 245 ms of which 5 ms to minimize.
[2024-05-21 05:13:32] [INFO ] Deduced a trap composed of 69 places in 364 ms of which 6 ms to minimize.
[2024-05-21 05:13:32] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:13:34] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 5 ms to minimize.
[2024-05-21 05:13:34] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 4 ms to minimize.
[2024-05-21 05:13:34] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
[2024-05-21 05:13:35] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 4 ms to minimize.
[2024-05-21 05:13:35] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-21 05:13:35] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 5 ms to minimize.
[2024-05-21 05:13:36] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 5 ms to minimize.
[2024-05-21 05:13:36] [INFO ] Deduced a trap composed of 71 places in 238 ms of which 5 ms to minimize.
[2024-05-21 05:13:37] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 5 ms to minimize.
[2024-05-21 05:13:37] [INFO ] Deduced a trap composed of 90 places in 199 ms of which 4 ms to minimize.
[2024-05-21 05:13:37] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 4 ms to minimize.
[2024-05-21 05:13:37] [INFO ] Deduced a trap composed of 93 places in 199 ms of which 4 ms to minimize.
[2024-05-21 05:13:37] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 4 ms to minimize.
[2024-05-21 05:13:38] [INFO ] Deduced a trap composed of 81 places in 210 ms of which 4 ms to minimize.
[2024-05-21 05:13:38] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 5 ms to minimize.
[2024-05-21 05:13:38] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 4 ms to minimize.
[2024-05-21 05:13:39] [INFO ] Deduced a trap composed of 84 places in 194 ms of which 4 ms to minimize.
[2024-05-21 05:13:39] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 4 ms to minimize.
[2024-05-21 05:13:42] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 19/112 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-21 05:13:45] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 5 ms to minimize.
[2024-05-21 05:13:45] [INFO ] Deduced a trap composed of 76 places in 267 ms of which 6 ms to minimize.
[2024-05-21 05:13:46] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 5 ms to minimize.
[2024-05-21 05:13:46] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 4 ms to minimize.
[2024-05-21 05:13:46] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 4 ms to minimize.
[2024-05-21 05:13:47] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-21 05:13:47] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 5 ms to minimize.
[2024-05-21 05:13:48] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 4 ms to minimize.
[2024-05-21 05:13:48] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 4 ms to minimize.
[2024-05-21 05:13:48] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/878 variables, and 122 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 82/82 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 446/465 places, 432/451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61180 ms. Remains : 446/465 places, 432/451 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 450 reset in 585 ms.
Product exploration explored 100000 steps with 443 reset in 618 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (136 resets) in 170 ms. (233 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-05-21 05:13:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 273/414 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 446/878 variables, and 40 constraints, problems are : Problem set: 1 solved, 0 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 455 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 432/432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 445 transition count 275
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 174 rules applied. Total rules applied 330 place count 289 transition count 257
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 342 place count 277 transition count 257
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 342 place count 277 transition count 203
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 450 place count 223 transition count 203
Performed 86 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 622 place count 137 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 136 transition count 104
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 18 rules applied. Total rules applied 641 place count 124 transition count 98
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 647 place count 118 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 647 place count 118 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 659 place count 112 transition count 92
Applied a total of 659 rules in 33 ms. Remains 112 /446 variables (removed 334) and now considering 92/432 (removed 340) transitions.
// Phase 1: matrix 92 rows 112 cols
[2024-05-21 05:13:52] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 05:13:53] [INFO ] Implicit Places using invariants in 173 ms returned [44, 64, 84, 88, 92, 101, 105, 111]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 175 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/446 places, 92/432 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 97 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 93 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 92 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 92 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 90 transition count 78
Applied a total of 28 rules in 16 ms. Remains 90 /104 variables (removed 14) and now considering 78/92 (removed 14) transitions.
// Phase 1: matrix 78 rows 90 cols
[2024-05-21 05:13:53] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 05:13:53] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 05:13:53] [INFO ] Invariant cache hit.
[2024-05-21 05:13:53] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/446 places, 78/432 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 537 ms. Remains : 90/446 places, 78/432 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 10 factoid took 430 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (1456 resets) in 130 ms. (305 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-05-21 05:13:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 50/168 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 3/20 constraints, State Equation: 0/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 759 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 357 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering criterion allowed to conclude after 130 steps with 3 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLFireability-15 finished in 67521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p1 U p2))))))'
Found a Shortening insensitive property : AutoFlight-PT-06b-LTLFireability-11
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 465 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 465/465 places, 451/451 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 464 transition count 285
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 183 rules applied. Total rules applied 348 place count 299 transition count 267
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 287 transition count 267
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 360 place count 287 transition count 211
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 472 place count 231 transition count 211
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 477 place count 226 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 482 place count 226 transition count 206
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 482 place count 226 transition count 202
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 490 place count 222 transition count 202
Performed 84 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 658 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 659 place count 137 transition count 105
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 675 place count 126 transition count 100
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 680 place count 121 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 680 place count 121 transition count 94
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 692 place count 115 transition count 94
Applied a total of 692 rules in 43 ms. Remains 115 /465 variables (removed 350) and now considering 94/451 (removed 357) transitions.
// Phase 1: matrix 94 rows 115 cols
[2024-05-21 05:13:56] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 05:13:56] [INFO ] Implicit Places using invariants in 192 ms returned [48, 68, 88, 92, 96, 100, 104, 109, 114]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 193 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/465 places, 94/451 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 99 transition count 87
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 99 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 98 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 98 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 96 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 96 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 95 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 95 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 92 transition count 80
Applied a total of 28 rules in 16 ms. Remains 92 /106 variables (removed 14) and now considering 80/94 (removed 14) transitions.
// Phase 1: matrix 80 rows 92 cols
[2024-05-21 05:13:56] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 05:13:57] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 05:13:57] [INFO ] Invariant cache hit.
[2024-05-21 05:13:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:13:57] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 92/465 places, 80/451 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 564 ms. Remains : 92/465 places, 80/451 transitions.
Running random walk in product with property : AutoFlight-PT-06b-LTLFireability-11
Stuttering criterion allowed to conclude after 6009 steps with 518 reset in 21 ms.
Treatment of property AutoFlight-PT-06b-LTLFireability-11 finished in 1010 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 05:13:57] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5248864477438904703
[2024-05-21 05:13:57] [INFO ] Computing symmetric may disable matrix : 451 transitions.
[2024-05-21 05:13:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:13:57] [INFO ] Computing symmetric may enable matrix : 451 transitions.
[2024-05-21 05:13:57] [INFO ] Applying decomposition
[2024-05-21 05:13:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:13:57] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12766484631478752471.txt' '-o' '/tmp/graph12766484631478752471.bin' '-w' '/tmp/graph12766484631478752471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12766484631478752471.bin' '-l' '-1' '-v' '-w' '/tmp/graph12766484631478752471.weights' '-q' '0' '-e' '0.001'
[2024-05-21 05:13:57] [INFO ] Computing Do-Not-Accords matrix : 451 transitions.
[2024-05-21 05:13:57] [INFO ] Decomposing Gal with order
[2024-05-21 05:13:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 05:13:57] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:13:57] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5248864477438904703
Running compilation step : cd /tmp/ltsmin5248864477438904703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 05:13:57] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-21 05:13:57] [INFO ] Flatten gal took : 32 ms
[2024-05-21 05:13:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 05:13:57] [INFO ] Time to serialize gal into /tmp/LTLFireability11836741389371996293.gal : 9 ms
[2024-05-21 05:13:57] [INFO ] Time to serialize properties into /tmp/LTLFireability3823297747582671267.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11836741389371996293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3823297747582671267.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X((F("(i27.i2.u194.p567==1)"))||(G("(i5.u24.p80==1)")))))
Formula 0 simplified : X(G!"(i27.i2.u194.p567==1)" & F!"(i5.u24.p80==1)")
Compilation finished in 1725 ms.
Running link step : cd /tmp/ltsmin5248864477438904703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5248864477438904703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t148, t162, t165, t188, t191, t203, t206, t258, t280, t299, t306, t328, t344, t436, t437, t43...1234
Computing Next relation with stutter on 1920 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5248864477438904703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5248864477438904703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp2==true)||((LTLAPp3==true) U (LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 05:39:03] [INFO ] Applying decomposition
[2024-05-21 05:39:03] [INFO ] Flatten gal took : 25 ms
[2024-05-21 05:39:03] [INFO ] Decomposing Gal with order
[2024-05-21 05:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 05:39:03] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-21 05:39:03] [INFO ] Flatten gal took : 70 ms
[2024-05-21 05:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 122 ms.
[2024-05-21 05:39:04] [INFO ] Time to serialize gal into /tmp/LTLFireability9240395846686417693.gal : 25 ms
[2024-05-21 05:39:04] [INFO ] Time to serialize properties into /tmp/LTLFireability9181631142513814703.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9240395846686417693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9181631142513814703.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X((F("(i1.i0.u75.p567==1)"))||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u33.p80==1)")))...157
Formula 0 simplified : X(G!"(i1.i0.u75.p567==1)" & F!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u33.p80==1)")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5248864477438904703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp2==true)||((LTLAPp3==true) U (LTLAPp4==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5248864477438904703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-21 05:54:58] [INFO ] Flatten gal took : 43 ms
[2024-05-21 05:54:58] [INFO ] Input system was already deterministic with 451 transitions.
[2024-05-21 05:54:58] [INFO ] Transformed 465 places.
[2024-05-21 05:54:58] [INFO ] Transformed 451 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 05:54:59] [INFO ] Time to serialize gal into /tmp/LTLFireability2305041613563423530.gal : 3 ms
[2024-05-21 05:54:59] [INFO ] Time to serialize properties into /tmp/LTLFireability12986594242266197522.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2305041613563423530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12986594242266197522.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("(p567==1)"))||(G("(p80==1)")))))
Formula 0 simplified : X(G!"(p567==1)" & F!"(p80==1)")

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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-06b, 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 r026-smll-171620167100148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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