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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 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 91K 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-04b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716276155738

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 07:22:38] [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 07:22:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:22:38] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-05-21 07:22:38] [INFO ] Transformed 390 places.
[2024-05-21 07:22:38] [INFO ] Transformed 388 transitions.
[2024-05-21 07:22:38] [INFO ] Found NUPN structural information;
[2024-05-21 07:22:38] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-04b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 342 transition count 340
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 342 transition count 340
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 342 transition count 333
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 121 place count 324 transition count 315
Iterating global reduction 1 with 18 rules applied. Total rules applied 139 place count 324 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 322 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 322 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 145 place count 320 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 320 transition count 311
Applied a total of 147 rules in 194 ms. Remains 320 /390 variables (removed 70) and now considering 311/388 (removed 77) transitions.
// Phase 1: matrix 311 rows 320 cols
[2024-05-21 07:22:39] [INFO ] Computed 28 invariants in 30 ms
[2024-05-21 07:22:39] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-21 07:22:39] [INFO ] Invariant cache hit.
[2024-05-21 07:22:40] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2024-05-21 07:22:40] [INFO ] Invariant cache hit.
[2024-05-21 07:22:40] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/390 places, 311/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1573 ms. Remains : 320/390 places, 311/388 transitions.
Support contains 41 out of 320 places after structural reductions.
[2024-05-21 07:22:41] [INFO ] Flatten gal took : 104 ms
[2024-05-21 07:22:41] [INFO ] Flatten gal took : 50 ms
[2024-05-21 07:22:41] [INFO ] Input system was already deterministic with 311 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 30) seen :22
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-21 07:22:42] [INFO ] Invariant cache hit.
[2024-05-21 07:22:42] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2024-05-21 07:22:42] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 07:22:42] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 07:22:42] [INFO ] [Nat]Absence check using 27 positive place invariants in 21 ms returned sat
[2024-05-21 07:22:42] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 07:22:43] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-21 07:22:43] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 8 ms to minimize.
[2024-05-21 07:22:43] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 1 ms to minimize.
[2024-05-21 07:22:43] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-21 07:22:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2024-05-21 07:22:44] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-21 07:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-21 07:22:44] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 1 ms to minimize.
[2024-05-21 07:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-21 07:22:44] [INFO ] After 1376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 188 ms.
[2024-05-21 07:22:44] [INFO ] After 1850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 5 properties in 74 ms.
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 311/311 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 320 transition count 201
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 124 rules applied. Total rules applied 234 place count 210 transition count 187
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 243 place count 202 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 201 transition count 186
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 244 place count 201 transition count 148
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 320 place count 163 transition count 148
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 324 place count 159 transition count 144
Iterating global reduction 4 with 4 rules applied. Total rules applied 328 place count 159 transition count 144
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 328 place count 159 transition count 140
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 336 place count 155 transition count 140
Performed 56 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 448 place count 99 transition count 77
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 462 place count 99 transition count 63
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 476 place count 85 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 477 place count 84 transition count 62
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 39 rules applied. Total rules applied 516 place count 66 transition count 41
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 537 place count 45 transition count 41
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 537 place count 45 transition count 31
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 557 place count 35 transition count 31
Applied a total of 557 rules in 99 ms. Remains 35 /320 variables (removed 285) and now considering 31/311 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 35/320 places, 31/311 transitions.
Finished random walk after 118 steps, including 6 resets, run visited all 3 properties in 3 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 84 stabilizing places and 84 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U p2)))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 311 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 306 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 304 transition count 294
Applied a total of 33 rules in 48 ms. Remains 304 /320 variables (removed 16) and now considering 294/311 (removed 17) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 07:22:45] [INFO ] Computed 28 invariants in 6 ms
[2024-05-21 07:22:45] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 07:22:45] [INFO ] Invariant cache hit.
[2024-05-21 07:22:45] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-21 07:22:45] [INFO ] Invariant cache hit.
[2024-05-21 07:22:46] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/320 places, 294/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1021 ms. Remains : 304/320 places, 294/311 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s11 1), p0:(EQ s90 1), p1:(EQ s18 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 9 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-00 finished in 1500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p0))||G(p1)))))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 311 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 306 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 304 transition count 294
Applied a total of 33 rules in 54 ms. Remains 304 /320 variables (removed 16) and now considering 294/311 (removed 17) transitions.
[2024-05-21 07:22:46] [INFO ] Invariant cache hit.
[2024-05-21 07:22:46] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 07:22:46] [INFO ] Invariant cache hit.
[2024-05-21 07:22:47] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-05-21 07:22:47] [INFO ] Invariant cache hit.
[2024-05-21 07:22:47] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/320 places, 294/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 918 ms. Remains : 304/320 places, 294/311 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (EQ s94 1) (EQ s196 1)), p0:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 551 reset in 634 ms.
Product exploration explored 100000 steps with 552 reset in 390 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7220 steps, including 35 resets, run visited all 2 properties in 32 ms. (steps per millisecond=225 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 07:22:49] [INFO ] Invariant cache hit.
[2024-05-21 07:22:49] [INFO ] [Real]Absence check using 27 positive place invariants in 17 ms returned sat
[2024-05-21 07:22:49] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:22:50] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2024-05-21 07:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:22:50] [INFO ] [Nat]Absence check using 27 positive place invariants in 20 ms returned sat
[2024-05-21 07:22:50] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:22:50] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2024-05-21 07:22:50] [INFO ] Computed and/alt/rep : 293/419/293 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-21 07:22:52] [INFO ] Added : 292 causal constraints over 59 iterations in 2021 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Applied a total of 0 rules in 8 ms. Remains 304 /304 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-21 07:22:52] [INFO ] Invariant cache hit.
[2024-05-21 07:22:53] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 07:22:53] [INFO ] Invariant cache hit.
[2024-05-21 07:22:53] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-21 07:22:53] [INFO ] Invariant cache hit.
[2024-05-21 07:22:53] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 964 ms. Remains : 304/304 places, 294/294 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 07:22:54] [INFO ] Invariant cache hit.
[2024-05-21 07:22:54] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2024-05-21 07:22:54] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:22:54] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:22:54] [INFO ] [Nat]Absence check using 27 positive place invariants in 16 ms returned sat
[2024-05-21 07:22:54] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 07:22:54] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 07:22:54] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-21 07:22:54] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 07:22:55] [INFO ] Invariant cache hit.
[2024-05-21 07:22:55] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2024-05-21 07:22:55] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:22:55] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-21 07:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:22:55] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2024-05-21 07:22:55] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:22:56] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-05-21 07:22:56] [INFO ] Computed and/alt/rep : 293/419/293 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-21 07:22:58] [INFO ] Added : 292 causal constraints over 59 iterations in 2391 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 552 reset in 185 ms.
Product exploration explored 100000 steps with 549 reset in 213 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 304 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 100 place count 304 transition count 290
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 100 place count 304 transition count 290
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 43 rules applied. Total rules applied 143 place count 304 transition count 290
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 222 place count 225 transition count 211
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 301 place count 225 transition count 211
Performed 72 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 373 place count 225 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 374 place count 225 transition count 203
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 418 place count 181 transition count 159
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 3 with 44 rules applied. Total rules applied 462 place count 181 transition count 159
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 462 rules in 128 ms. Remains 181 /304 variables (removed 123) and now considering 159/294 (removed 135) transitions.
[2024-05-21 07:22:59] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 159 rows 181 cols
[2024-05-21 07:22:59] [INFO ] Computed 28 invariants in 5 ms
[2024-05-21 07:22:59] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/304 places, 159/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 181/304 places, 159/294 transitions.
Built C files in :
/tmp/ltsmin1515215679352752938
[2024-05-21 07:23:00] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1515215679352752938
Running compilation step : cd /tmp/ltsmin1515215679352752938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 812 ms.
Running link step : cd /tmp/ltsmin1515215679352752938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1515215679352752938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15659866508940293109.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 304 /304 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 07:23:15] [INFO ] Computed 28 invariants in 8 ms
[2024-05-21 07:23:15] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 07:23:15] [INFO ] Invariant cache hit.
[2024-05-21 07:23:15] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-05-21 07:23:15] [INFO ] Invariant cache hit.
[2024-05-21 07:23:16] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 985 ms. Remains : 304/304 places, 294/294 transitions.
Built C files in :
/tmp/ltsmin14584164529818836619
[2024-05-21 07:23:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14584164529818836619
Running compilation step : cd /tmp/ltsmin14584164529818836619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 818 ms.
Running link step : cd /tmp/ltsmin14584164529818836619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14584164529818836619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16190511848847937183.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:23:31] [INFO ] Flatten gal took : 20 ms
[2024-05-21 07:23:31] [INFO ] Flatten gal took : 19 ms
[2024-05-21 07:23:31] [INFO ] Time to serialize gal into /tmp/LTL15354283096174125068.gal : 5 ms
[2024-05-21 07:23:31] [INFO ] Time to serialize properties into /tmp/LTL4712511207125943257.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15354283096174125068.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9691951961045008133.hoa' '-atoms' '/tmp/LTL4712511207125943257.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4712511207125943257.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9691951961045008133.hoa
Detected timeout of ITS tools.
[2024-05-21 07:23:46] [INFO ] Flatten gal took : 24 ms
[2024-05-21 07:23:46] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:23:46] [INFO ] Time to serialize gal into /tmp/LTL6975239346674819563.gal : 14 ms
[2024-05-21 07:23:46] [INFO ] Time to serialize properties into /tmp/LTL17966980288438631603.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6975239346674819563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17966980288438631603.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(p30==1)")))||(G("((p143==1)&&(p276==1))"))))))
Formula 0 simplified : XG(XG!"(p30==1)" & F!"((p143==1)&&(p276==1))")
Detected timeout of ITS tools.
[2024-05-21 07:24:01] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:24:01] [INFO ] Applying decomposition
[2024-05-21 07:24:01] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1030956927748990597.txt' '-o' '/tmp/graph1030956927748990597.bin' '-w' '/tmp/graph1030956927748990597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1030956927748990597.bin' '-l' '-1' '-v' '-w' '/tmp/graph1030956927748990597.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:24:02] [INFO ] Decomposing Gal with order
[2024-05-21 07:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:24:02] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 07:24:02] [INFO ] Flatten gal took : 79 ms
[2024-05-21 07:24:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 07:24:02] [INFO ] Time to serialize gal into /tmp/LTL14094276446952747670.gal : 11 ms
[2024-05-21 07:24:02] [INFO ] Time to serialize properties into /tmp/LTL11225510169301849523.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14094276446952747670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11225510169301849523.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(i1.u11.p30==1)")))||(G("((i0.u39.p143==1)&&(i5.u82.p276==1))"))))))
Formula 0 simplified : XG(XG!"(i1.u11.p30==1)" & F!"((i0.u39.p143==1)&&(i5.u82.p276==1))")
Reverse transition relation is NOT exact ! Due to transitions t95, t98, t122, t125, t157, t164, t188, t214, t233, t300, t301, t302, t303, t304, i0.u38.t13,...746
Computing Next relation with stutter on 320 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13787261175823261508
[2024-05-21 07:24:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13787261175823261508
Running compilation step : cd /tmp/ltsmin13787261175823261508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 604 ms.
Running link step : cd /tmp/ltsmin13787261175823261508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13787261175823261508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-04b-LTLFireability-01 finished in 105769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 303
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 312 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 307 transition count 297
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Applied a total of 31 rules in 46 ms. Remains 305 /320 variables (removed 15) and now considering 295/311 (removed 16) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-21 07:24:32] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 07:24:32] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 07:24:32] [INFO ] Invariant cache hit.
[2024-05-21 07:24:32] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-05-21 07:24:32] [INFO ] Invariant cache hit.
[2024-05-21 07:24:33] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/320 places, 295/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 305/320 places, 295/311 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s56 1), p0:(EQ s73 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 198 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-02 finished in 801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&X(p1)))&&X(F(p2)))))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 311 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 306 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 304 transition count 294
Applied a total of 33 rules in 25 ms. Remains 304 /320 variables (removed 16) and now considering 294/311 (removed 17) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 07:24:33] [INFO ] Computed 28 invariants in 5 ms
[2024-05-21 07:24:33] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 07:24:33] [INFO ] Invariant cache hit.
[2024-05-21 07:24:33] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-21 07:24:33] [INFO ] Invariant cache hit.
[2024-05-21 07:24:33] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/320 places, 294/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 304/320 places, 294/311 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s134 1), p1:(AND (EQ s89 1) (EQ s217 1)), p2:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-03 finished in 935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 319 transition count 198
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 126 rules applied. Total rules applied 238 place count 207 transition count 184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 246 place count 199 transition count 184
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 246 place count 199 transition count 145
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 324 place count 160 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 329 place count 155 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 334 place count 155 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 334 place count 155 transition count 135
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 150 transition count 135
Performed 57 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 458 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 459 place count 92 transition count 70
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 471 place count 84 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 475 place count 80 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 475 place count 80 transition count 62
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 483 place count 76 transition count 62
Applied a total of 483 rules in 33 ms. Remains 76 /320 variables (removed 244) and now considering 62/311 (removed 249) transitions.
// Phase 1: matrix 62 rows 76 cols
[2024-05-21 07:24:34] [INFO ] Computed 20 invariants in 0 ms
[2024-05-21 07:24:34] [INFO ] Implicit Places using invariants in 76 ms returned [30, 44, 58, 62, 66, 70, 75]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 78 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/320 places, 62/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 56
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 14 place count 62 transition count 55
Applied a total of 14 rules in 6 ms. Remains 62 /69 variables (removed 7) and now considering 55/62 (removed 7) transitions.
// Phase 1: matrix 55 rows 62 cols
[2024-05-21 07:24:34] [INFO ] Computed 13 invariants in 0 ms
[2024-05-21 07:24:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 07:24:34] [INFO ] Invariant cache hit.
[2024-05-21 07:24:34] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/320 places, 55/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 62/320 places, 55/311 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s13 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5580 reset in 199 ms.
Product exploration explored 100000 steps with 5530 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 548 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 114239 steps, run visited all 1 properties in 210 ms. (steps per millisecond=543 )
Probabilistic random walk after 114239 steps, saw 21519 distinct states, run finished after 211 ms. (steps per millisecond=541 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-21 07:24:35] [INFO ] Invariant cache hit.
[2024-05-21 07:24:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 07:24:35] [INFO ] Invariant cache hit.
[2024-05-21 07:24:35] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-21 07:24:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 07:24:35] [INFO ] Invariant cache hit.
[2024-05-21 07:24:35] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 62/62 places, 55/55 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 555 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 114239 steps, run visited all 1 properties in 231 ms. (steps per millisecond=494 )
Probabilistic random walk after 114239 steps, saw 21519 distinct states, run finished after 231 ms. (steps per millisecond=494 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5521 reset in 130 ms.
Product exploration explored 100000 steps with 5509 reset in 364 ms.
Built C files in :
/tmp/ltsmin14566492651127797480
[2024-05-21 07:24:37] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-21 07:24:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:24:37] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-21 07:24:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:24:37] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-21 07:24:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:24:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14566492651127797480
Running compilation step : cd /tmp/ltsmin14566492651127797480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin14566492651127797480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14566492651127797480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6530084979224202078.hoa' '--buchi-type=spotba'
LTSmin run took 2913 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-04b-LTLFireability-04 finished in 6284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||X((X(p2)&&p1)))))))'
Support contains 5 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 303
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 312 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 308 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 306 transition count 296
Applied a total of 29 rules in 23 ms. Remains 306 /320 variables (removed 14) and now considering 296/311 (removed 15) transitions.
// Phase 1: matrix 296 rows 306 cols
[2024-05-21 07:24:40] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 07:24:40] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 07:24:40] [INFO ] Invariant cache hit.
[2024-05-21 07:24:40] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-21 07:24:40] [INFO ] Invariant cache hit.
[2024-05-21 07:24:41] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/320 places, 296/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 306/320 places, 296/311 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p0 p1), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 7}]], initial=0, aps=[p0:(AND (EQ s66 1) (EQ s199 1) (EQ s302 1)), p1:(AND (EQ s188 1) (EQ s57 1)), p2:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-05 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 319 transition count 198
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 126 rules applied. Total rules applied 238 place count 207 transition count 184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 246 place count 199 transition count 184
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 246 place count 199 transition count 145
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 324 place count 160 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 329 place count 155 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 334 place count 155 transition count 140
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 334 place count 155 transition count 136
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 342 place count 151 transition count 136
Performed 58 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 458 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 459 place count 92 transition count 70
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 471 place count 84 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 475 place count 80 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 475 place count 80 transition count 62
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 483 place count 76 transition count 62
Applied a total of 483 rules in 36 ms. Remains 76 /320 variables (removed 244) and now considering 62/311 (removed 249) transitions.
// Phase 1: matrix 62 rows 76 cols
[2024-05-21 07:24:41] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 07:24:41] [INFO ] Implicit Places using invariants in 80 ms returned [30, 44, 58, 62, 66, 70, 75]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 82 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/320 places, 62/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 53
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 20 place count 59 transition count 52
Applied a total of 20 rules in 13 ms. Remains 59 /69 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 59 cols
[2024-05-21 07:24:41] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 07:24:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 07:24:41] [INFO ] Invariant cache hit.
[2024-05-21 07:24:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:24:41] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/320 places, 52/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 337 ms. Remains : 59/320 places, 52/311 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10583 reset in 274 ms.
Stack based approach found an accepted trace after 3716 steps with 391 reset with depth 5 and stack size 5 in 11 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-06 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||X((p1&&G(p2)&&F(p3)))) U !p2))'
Support contains 2 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 319 transition count 201
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 120 rules applied. Total rules applied 229 place count 210 transition count 190
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 236 place count 204 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 203 transition count 189
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 237 place count 203 transition count 149
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 317 place count 163 transition count 149
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 323 place count 157 transition count 143
Iterating global reduction 4 with 6 rules applied. Total rules applied 329 place count 157 transition count 143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 329 place count 157 transition count 138
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 339 place count 152 transition count 138
Performed 54 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 447 place count 98 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 448 place count 97 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 452 place count 94 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 453 place count 93 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 453 place count 93 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 457 place count 91 transition count 73
Applied a total of 457 rules in 55 ms. Remains 91 /320 variables (removed 229) and now considering 73/311 (removed 238) transitions.
// Phase 1: matrix 73 rows 91 cols
[2024-05-21 07:24:42] [INFO ] Computed 25 invariants in 1 ms
[2024-05-21 07:24:42] [INFO ] Implicit Places using invariants in 138 ms returned [37, 51, 73, 79, 84, 90]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 140 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/320 places, 73/311 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 81 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 81 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 80 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 80 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 79 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 79 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 78 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 78 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 77 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 77 transition count 65
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 2 with 4 rules applied. Total rules applied 20 place count 75 transition count 63
Applied a total of 20 rules in 19 ms. Remains 75 /85 variables (removed 10) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 75 cols
[2024-05-21 07:24:42] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 07:24:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 07:24:42] [INFO ] Invariant cache hit.
[2024-05-21 07:24:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 07:24:42] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 250 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/320 places, 63/311 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 74 transition count 62
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 73 transition count 62
Applied a total of 2 rules in 5 ms. Remains 73 /74 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 73 cols
[2024-05-21 07:24:42] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 07:24:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 07:24:42] [INFO ] Invariant cache hit.
[2024-05-21 07:24:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-21 07:24:42] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 73/320 places, 62/311 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 718 ms. Remains : 73/320 places, 62/311 transitions.
Stuttering acceptance computed with spot in 142 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s61 1), p0:(NEQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15722 reset in 390 ms.
Product exploration explored 100000 steps with 15790 reset in 331 ms.
Computed a total of 7 stabilizing places and 4 stable transitions
Computed a total of 7 stabilizing places and 4 stable transitions
Detected a total of 7/73 stabilizing places and 4/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Finished random walk after 2681 steps, including 106 resets, run visited all 4 properties in 19 ms. (steps per millisecond=141 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 7 factoid took 492 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Stuttering acceptance computed with spot in 110 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
[2024-05-21 07:24:44] [INFO ] Invariant cache hit.
[2024-05-21 07:24:45] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-21 07:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:24:45] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 07:24:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:24:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-21 07:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:24:45] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 07:24:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-21 07:24:45] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2024-05-21 07:24:45] [INFO ] Computed and/alt/rep : 53/128/53 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 07:24:45] [INFO ] Added : 38 causal constraints over 8 iterations in 84 ms. Result :sat
Could not prove EG p2
Support contains 2 out of 73 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-21 07:24:45] [INFO ] Invariant cache hit.
[2024-05-21 07:24:45] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 07:24:45] [INFO ] Invariant cache hit.
[2024-05-21 07:24:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-21 07:24:45] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-21 07:24:45] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 07:24:45] [INFO ] Invariant cache hit.
[2024-05-21 07:24:45] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 358 ms. Remains : 73/73 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 4 stable transitions
Computed a total of 7 stabilizing places and 4 stable transitions
Detected a total of 7/73 stabilizing places and 4/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 7 factoid took 339 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Finished random walk after 5164 steps, including 204 resets, run visited all 4 properties in 38 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 7 factoid took 470 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Stuttering acceptance computed with spot in 141 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
[2024-05-21 07:24:46] [INFO ] Invariant cache hit.
[2024-05-21 07:24:47] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-21 07:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:24:47] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 07:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:24:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-21 07:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:24:47] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-21 07:24:47] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-21 07:24:47] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2024-05-21 07:24:47] [INFO ] Computed and/alt/rep : 53/128/53 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 07:24:47] [INFO ] Added : 38 causal constraints over 8 iterations in 68 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 146 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Product exploration explored 100000 steps with 15750 reset in 296 ms.
Stack based approach found an accepted trace after 1727 steps with 252 reset with depth 19 and stack size 19 in 8 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-07 finished in 5561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((G((p1 U p0)) U (p0 U p2))))))'
Support contains 2 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 311 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 306 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 304 transition count 294
Applied a total of 33 rules in 48 ms. Remains 304 /320 variables (removed 16) and now considering 294/311 (removed 17) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 07:24:47] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 07:24:48] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-21 07:24:48] [INFO ] Invariant cache hit.
[2024-05-21 07:24:48] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-21 07:24:48] [INFO ] Invariant cache hit.
[2024-05-21 07:24:48] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/320 places, 294/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 304/320 places, 294/311 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s95 1), p2:(EQ s279 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 235 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-09 finished in 1055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 319 transition count 203
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 118 rules applied. Total rules applied 225 place count 212 transition count 192
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 232 place count 206 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 205 transition count 191
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 233 place count 205 transition count 152
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 311 place count 166 transition count 152
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 316 place count 161 transition count 147
Iterating global reduction 4 with 5 rules applied. Total rules applied 321 place count 161 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 321 place count 161 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 329 place count 157 transition count 143
Performed 58 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 445 place count 99 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 447 place count 98 transition count 78
Applied a total of 447 rules in 20 ms. Remains 98 /320 variables (removed 222) and now considering 78/311 (removed 233) transitions.
// Phase 1: matrix 78 rows 98 cols
[2024-05-21 07:24:48] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 07:24:48] [INFO ] Implicit Places using invariants in 83 ms returned [33, 34, 38, 39, 40, 41, 42, 43, 57, 71, 77, 83, 89, 97]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 84 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/320 places, 78/311 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 84 transition count 71
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 77 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 72 transition count 66
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 72 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 71 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 71 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 70 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 70 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 69 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 69 transition count 63
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 68 transition count 62
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 68 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 67 transition count 61
Applied a total of 34 rules in 7 ms. Remains 67 /84 variables (removed 17) and now considering 61/78 (removed 17) transitions.
// Phase 1: matrix 61 rows 67 cols
[2024-05-21 07:24:48] [INFO ] Computed 14 invariants in 0 ms
[2024-05-21 07:24:48] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 07:24:48] [INFO ] Invariant cache hit.
[2024-05-21 07:24:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 07:24:49] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/320 places, 61/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 67/320 places, 61/311 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s19 1) (NOT (AND (EQ s29 1) (EQ s64 1)))), p0:(AND (EQ s10 1) (EQ s45 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-10 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 319 transition count 197
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 127 rules applied. Total rules applied 240 place count 206 transition count 183
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 248 place count 198 transition count 183
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 248 place count 198 transition count 145
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 324 place count 160 transition count 145
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 330 place count 154 transition count 139
Iterating global reduction 3 with 6 rules applied. Total rules applied 336 place count 154 transition count 139
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 336 place count 154 transition count 134
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 346 place count 149 transition count 134
Performed 57 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 460 place count 92 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 91 transition count 69
Reduce places removed 7 places and 0 transitions.
Drop transitions 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 471 place count 84 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 474 place count 81 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 474 place count 81 transition count 62
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 482 place count 77 transition count 62
Applied a total of 482 rules in 40 ms. Remains 77 /320 variables (removed 243) and now considering 62/311 (removed 249) transitions.
// Phase 1: matrix 62 rows 77 cols
[2024-05-21 07:24:49] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 07:24:49] [INFO ] Implicit Places using invariants in 79 ms returned [30, 44, 58, 63, 67, 71, 76]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 80 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/320 places, 62/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 64 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 53
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 20 place count 60 transition count 52
Applied a total of 20 rules in 13 ms. Remains 60 /70 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 60 cols
[2024-05-21 07:24:49] [INFO ] Computed 14 invariants in 1 ms
[2024-05-21 07:24:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 07:24:49] [INFO ] Invariant cache hit.
[2024-05-21 07:24:49] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/320 places, 52/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 294 ms. Remains : 60/320 places, 52/311 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-11 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 319 transition count 200
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 124 rules applied. Total rules applied 234 place count 209 transition count 186
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 243 place count 201 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 200 transition count 185
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 244 place count 200 transition count 146
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 322 place count 161 transition count 146
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 328 place count 155 transition count 140
Iterating global reduction 4 with 6 rules applied. Total rules applied 334 place count 155 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 334 place count 155 transition count 135
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 344 place count 150 transition count 135
Performed 56 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 456 place count 94 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 457 place count 93 transition count 71
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 12 rules applied. Total rules applied 469 place count 85 transition count 67
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 473 place count 81 transition count 67
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 473 place count 81 transition count 63
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 481 place count 77 transition count 63
Applied a total of 481 rules in 43 ms. Remains 77 /320 variables (removed 243) and now considering 63/311 (removed 248) transitions.
// Phase 1: matrix 63 rows 77 cols
[2024-05-21 07:24:49] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 07:24:49] [INFO ] Implicit Places using invariants in 81 ms returned [29, 43, 57, 67, 71, 76]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 85 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/320 places, 63/311 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 66 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 55
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 20 place count 61 transition count 53
Applied a total of 20 rules in 9 ms. Remains 61 /71 variables (removed 10) and now considering 53/63 (removed 10) transitions.
// Phase 1: matrix 53 rows 61 cols
[2024-05-21 07:24:49] [INFO ] Computed 14 invariants in 0 ms
[2024-05-21 07:24:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 07:24:49] [INFO ] Invariant cache hit.
[2024-05-21 07:24:49] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/320 places, 53/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 61/320 places, 53/311 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s37 0) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4708 reset in 141 ms.
Product exploration explored 100000 steps with 4704 reset in 156 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-21 07:24:50] [INFO ] Invariant cache hit.
[2024-05-21 07:24:50] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 07:24:50] [INFO ] Invariant cache hit.
[2024-05-21 07:24:50] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-21 07:24:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 07:24:50] [INFO ] Invariant cache hit.
[2024-05-21 07:24:50] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 61/61 places, 53/53 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 391 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=195 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4712 reset in 137 ms.
Product exploration explored 100000 steps with 4709 reset in 156 ms.
Built C files in :
/tmp/ltsmin6177688756545341633
[2024-05-21 07:24:51] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-21 07:24:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:24:51] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-21 07:24:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:24:51] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-21 07:24:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:24:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6177688756545341633
Running compilation step : cd /tmp/ltsmin6177688756545341633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin6177688756545341633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6177688756545341633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3433176006578681457.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-21 07:25:06] [INFO ] Invariant cache hit.
[2024-05-21 07:25:06] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 07:25:06] [INFO ] Invariant cache hit.
[2024-05-21 07:25:06] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-21 07:25:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 07:25:06] [INFO ] Invariant cache hit.
[2024-05-21 07:25:06] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 61/61 places, 53/53 transitions.
Built C files in :
/tmp/ltsmin15751679655412774208
[2024-05-21 07:25:06] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-21 07:25:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:25:06] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-21 07:25:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:25:06] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-21 07:25:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:25:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15751679655412774208
Running compilation step : cd /tmp/ltsmin15751679655412774208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin15751679655412774208;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15751679655412774208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5381952116442617256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:25:22] [INFO ] Flatten gal took : 4 ms
[2024-05-21 07:25:22] [INFO ] Flatten gal took : 6 ms
[2024-05-21 07:25:22] [INFO ] Time to serialize gal into /tmp/LTL13967767107262810714.gal : 2 ms
[2024-05-21 07:25:22] [INFO ] Time to serialize properties into /tmp/LTL13114786792635652312.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13967767107262810714.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9926192650207925469.hoa' '-atoms' '/tmp/LTL13114786792635652312.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13114786792635652312.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9926192650207925469.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 256 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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.072598,16040,1,0,31,9729,24,17,1444,5604,75
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-04b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-04b-LTLFireability-13 finished in 32766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((p1 U p2)&&G(p1))))))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 319 transition count 200
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 117 rules applied. Total rules applied 227 place count 209 transition count 193
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 231 place count 205 transition count 193
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 231 place count 205 transition count 152
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 313 place count 164 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 319 place count 158 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 325 place count 158 transition count 146
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 325 place count 158 transition count 141
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 335 place count 153 transition count 141
Performed 57 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 449 place count 96 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 450 place count 95 transition count 76
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 458 place count 89 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 460 place count 87 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 460 place count 87 transition count 70
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 468 place count 83 transition count 70
Applied a total of 468 rules in 28 ms. Remains 83 /320 variables (removed 237) and now considering 70/311 (removed 241) transitions.
// Phase 1: matrix 70 rows 83 cols
[2024-05-21 07:25:22] [INFO ] Computed 22 invariants in 4 ms
[2024-05-21 07:25:22] [INFO ] Implicit Places using invariants in 84 ms returned [35, 49, 63, 68, 72, 77, 82]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 87 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/320 places, 70/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 70 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 70 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 69 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 69 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 68 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 68 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 67 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 67 transition count 61
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 20 place count 66 transition count 60
Applied a total of 20 rules in 9 ms. Remains 66 /76 variables (removed 10) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 66 cols
[2024-05-21 07:25:22] [INFO ] Computed 15 invariants in 0 ms
[2024-05-21 07:25:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 07:25:22] [INFO ] Invariant cache hit.
[2024-05-21 07:25:22] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/320 places, 60/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 260 ms. Remains : 66/320 places, 60/311 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s34 1), p1:(EQ s22 1), p2:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 70 steps with 5 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-15 finished in 447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p0))||G(p1)))))'
Found a Shortening insensitive property : AutoFlight-PT-04b-LTLFireability-01
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 319 transition count 200
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 123 rules applied. Total rules applied 233 place count 209 transition count 187
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 242 place count 201 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 200 transition count 186
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 243 place count 200 transition count 147
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 321 place count 161 transition count 147
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 328 place count 154 transition count 140
Iterating global reduction 4 with 7 rules applied. Total rules applied 335 place count 154 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 154 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 336 place count 154 transition count 135
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 344 place count 150 transition count 135
Performed 57 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 458 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 459 place count 92 transition count 70
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 12 rules applied. Total rules applied 471 place count 84 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 475 place count 80 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 475 place count 80 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 483 place count 76 transition count 62
Applied a total of 483 rules in 38 ms. Remains 76 /320 variables (removed 244) and now considering 62/311 (removed 249) transitions.
// Phase 1: matrix 62 rows 76 cols
[2024-05-21 07:25:22] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 07:25:23] [INFO ] Implicit Places using invariants in 89 ms returned [30, 44, 58, 62, 66, 70, 75]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 91 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 69/320 places, 62/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 53
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 20 place count 59 transition count 52
Applied a total of 20 rules in 6 ms. Remains 59 /69 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 59 cols
[2024-05-21 07:25:23] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 07:25:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 07:25:23] [INFO ] Invariant cache hit.
[2024-05-21 07:25:23] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 59/320 places, 52/311 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 305 ms. Remains : 59/320 places, 52/311 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (EQ s24 1) (EQ s41 1)), p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 953 steps with 90 reset in 3 ms.
Treatment of property AutoFlight-PT-04b-LTLFireability-01 finished in 536 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 07:25:23] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16108545470389844541
[2024-05-21 07:25:23] [INFO ] Computing symmetric may disable matrix : 311 transitions.
[2024-05-21 07:25:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:25:23] [INFO ] Computing symmetric may enable matrix : 311 transitions.
[2024-05-21 07:25:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:25:23] [INFO ] Applying decomposition
[2024-05-21 07:25:23] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:25:23] [INFO ] Computing Do-Not-Accords matrix : 311 transitions.
[2024-05-21 07:25:23] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:25:23] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16108545470389844541
Running compilation step : cd /tmp/ltsmin16108545470389844541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14536308672168320277.txt' '-o' '/tmp/graph14536308672168320277.bin' '-w' '/tmp/graph14536308672168320277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14536308672168320277.bin' '-l' '-1' '-v' '-w' '/tmp/graph14536308672168320277.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:25:23] [INFO ] Decomposing Gal with order
[2024-05-21 07:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:25:23] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-21 07:25:23] [INFO ] Flatten gal took : 63 ms
[2024-05-21 07:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 07:25:23] [INFO ] Time to serialize gal into /tmp/LTLFireability17397037293095992584.gal : 14 ms
[2024-05-21 07:25:23] [INFO ] Time to serialize properties into /tmp/LTLFireability9776903483891893334.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17397037293095992584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9776903483891893334.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(i2.u10.p30==1)")))||(G("((i9.u46.p143==1)&&(i9.u91.p276==1))"))))))
Formula 0 simplified : XG(XG!"(i2.u10.p30==1)" & F!"((i9.u46.p143==1)&&(i9.u91.p276==1))")
Compilation finished in 1089 ms.
Running link step : cd /tmp/ltsmin16108545470389844541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16108545470389844541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t98, t108, t111, t136, t139, t164, t181, t207, t214, t233, t302, t303, t304, i0.t95, i0.i2.t9...857
Computing Next relation with stutter on 320 deadlock states
Detected timeout of ITS tools.
[2024-05-21 07:46:17] [INFO ] Applying decomposition
[2024-05-21 07:46:17] [INFO ] Flatten gal took : 42 ms
[2024-05-21 07:46:17] [INFO ] Decomposing Gal with order
[2024-05-21 07:46:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:46:18] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 07:46:18] [INFO ] Flatten gal took : 65 ms
[2024-05-21 07:46:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 24 ms.
[2024-05-21 07:46:18] [INFO ] Time to serialize gal into /tmp/LTLFireability12275834648693779889.gal : 23 ms
[2024-05-21 07:46:18] [INFO ] Time to serialize properties into /tmp/LTLFireability12618319950100275548.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12275834648693779889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12618319950100275548.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u20.p30==1)")))||(G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u29.p14...201
Formula 0 simplified : XG(XG!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u20.p30==1)" & F!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u29.p143==1)&&...189
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: LTL layer: formula: X(<>((X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.010: "X(<>((X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.077: There are 314 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.077: State length is 321, there are 317 groups
pins2lts-mc-linux64( 0/ 8), 0.077: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.077: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.077: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.077: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.175: [Blue] ~120 levels ~960 states ~5952 transitions
pins2lts-mc-linux64( 4/ 8), 0.250: [Blue] ~216 levels ~1920 states ~10648 transitions
pins2lts-mc-linux64( 4/ 8), 0.321: [Blue] ~224 levels ~3840 states ~14352 transitions
pins2lts-mc-linux64( 5/ 8), 0.413: [Blue] ~197 levels ~7680 states ~22448 transitions
pins2lts-mc-linux64( 5/ 8), 0.555: [Blue] ~197 levels ~15360 states ~39552 transitions
pins2lts-mc-linux64( 5/ 8), 0.873: [Blue] ~197 levels ~30720 states ~79688 transitions
pins2lts-mc-linux64( 5/ 8), 1.508: [Blue] ~197 levels ~61440 states ~163536 transitions
pins2lts-mc-linux64( 5/ 8), 2.674: [Blue] ~197 levels ~122880 states ~343728 transitions
pins2lts-mc-linux64( 5/ 8), 4.805: [Blue] ~198 levels ~245760 states ~710984 transitions
pins2lts-mc-linux64( 5/ 8), 8.319: [Blue] ~198 levels ~491520 states ~1534360 transitions
pins2lts-mc-linux64( 5/ 8), 14.145: [Blue] ~198 levels ~983040 states ~3169072 transitions
pins2lts-mc-linux64( 3/ 8), 24.250: [Blue] ~200 levels ~1966080 states ~8712440 transitions
pins2lts-mc-linux64( 3/ 8), 43.557: [Blue] ~200 levels ~3932160 states ~18525840 transitions
pins2lts-mc-linux64( 3/ 8), 82.301: [Blue] ~200 levels ~7864320 states ~38894536 transitions
pins2lts-mc-linux64( 3/ 8), 160.616: [Blue] ~200 levels ~15728640 states ~80550424 transitions
pins2lts-mc-linux64( 3/ 8), 318.660: [Blue] ~200 levels ~31457280 states ~172925272 transitions
pins2lts-mc-linux64( 3/ 8), 636.896: [Blue] ~200 levels ~62914560 states ~366339248 transitions
pins2lts-mc-linux64( 3/ 8), 1283.303: [Blue] ~201 levels ~125829120 states ~759387080 transitions
pins2lts-mc-linux64( 3/ 8), 1515.727: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1515.800:
pins2lts-mc-linux64( 0/ 8), 1515.800: Explored 135157480 states 700282215 transitions, fanout: 5.181
pins2lts-mc-linux64( 0/ 8), 1515.800: Total exploration time 1515.710 sec (1515.650 sec minimum, 1515.680 sec on average)
pins2lts-mc-linux64( 0/ 8), 1515.800: States per second: 89171, Transitions per second: 462016
pins2lts-mc-linux64( 0/ 8), 1515.800:
pins2lts-mc-linux64( 0/ 8), 1515.800: State space has 134217456 states, 131127301 are accepting
pins2lts-mc-linux64( 0/ 8), 1515.800: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1515.800: blue states: 135157480 (100.70%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1515.800: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1515.800: all-red states: 131181845 (97.74%), bogus 856021 (0.64%)
pins2lts-mc-linux64( 0/ 8), 1515.800:
pins2lts-mc-linux64( 0/ 8), 1515.800: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1515.800:
pins2lts-mc-linux64( 0/ 8), 1515.800: Queue width: 8B, total height: 1759, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1515.800: Tree memory: 1026.7MB, 8.0 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1515.800: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 1515.800: Stored 313 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1515.800: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1515.800: Est. total memory use: 1026.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16108545470389844541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16108545470389844541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 08:07:15] [INFO ] Flatten gal took : 964 ms
[2024-05-21 08:07:18] [INFO ] Input system was already deterministic with 311 transitions.
[2024-05-21 08:07:19] [INFO ] Transformed 320 places.
[2024-05-21 08:07:19] [INFO ] Transformed 311 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 08:07:19] [INFO ] Time to serialize gal into /tmp/LTLFireability15704614953888210296.gal : 14 ms
[2024-05-21 08:07:19] [INFO ] Time to serialize properties into /tmp/LTLFireability17302657627734400949.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15704614953888210296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17302657627734400949.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((X(F("(p30==1)")))||(G("((p143==1)&&(p276==1))"))))))
Formula 0 simplified : XG(XG!"(p30==1)" & F!"((p143==1)&&(p276==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3587976 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15845084 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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