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.r267-smll-171654405700092.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 greatspnxred
Input is Parking-PT-832, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405700092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 251K May 18 16:43 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 Parking-PT-832-LTLFireability-00
FORMULA_NAME Parking-PT-832-LTLFireability-01
FORMULA_NAME Parking-PT-832-LTLFireability-02
FORMULA_NAME Parking-PT-832-LTLFireability-03
FORMULA_NAME Parking-PT-832-LTLFireability-04
FORMULA_NAME Parking-PT-832-LTLFireability-05
FORMULA_NAME Parking-PT-832-LTLFireability-06
FORMULA_NAME Parking-PT-832-LTLFireability-07
FORMULA_NAME Parking-PT-832-LTLFireability-08
FORMULA_NAME Parking-PT-832-LTLFireability-09
FORMULA_NAME Parking-PT-832-LTLFireability-10
FORMULA_NAME Parking-PT-832-LTLFireability-11
FORMULA_NAME Parking-PT-832-LTLFireability-12
FORMULA_NAME Parking-PT-832-LTLFireability-13
FORMULA_NAME Parking-PT-832-LTLFireability-14
FORMULA_NAME Parking-PT-832-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716661493159

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-832
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 18:24:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 18:24:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:24:56] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2024-05-25 18:24:56] [INFO ] Transformed 737 places.
[2024-05-25 18:24:56] [INFO ] Transformed 993 transitions.
[2024-05-25 18:24:56] [INFO ] Found NUPN structural information;
[2024-05-25 18:24:56] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 665 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 730 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 730 transition count 602
Applied a total of 14 rules in 290 ms. Remains 730 /737 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 730 cols
[2024-05-25 18:24:57] [INFO ] Computed 184 invariants in 50 ms
[2024-05-25 18:24:58] [INFO ] Implicit Places using invariants in 1281 ms returned [144, 152, 160, 184, 213, 221, 229, 237, 261, 263, 290, 298, 306, 314, 338, 340, 367, 375, 383, 391, 415, 417, 444, 452, 460, 468, 492, 494, 521, 529, 537, 545, 569, 571, 599, 607, 615, 623, 647, 649, 676, 684, 692, 700, 724]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 1357 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/737 places, 602/609 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 657 transition count 574
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 657 transition count 574
Applied a total of 56 rules in 116 ms. Remains 657 /685 variables (removed 28) and now considering 574/602 (removed 28) transitions.
// Phase 1: matrix 574 rows 657 cols
[2024-05-25 18:24:58] [INFO ] Computed 139 invariants in 7 ms
[2024-05-25 18:24:59] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-05-25 18:24:59] [INFO ] Invariant cache hit.
[2024-05-25 18:24:59] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 18:25:01] [INFO ] Implicit Places using invariants and state equation in 2383 ms returned []
Implicit Place search using SMT with State Equation took 3206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 657/737 places, 574/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5039 ms. Remains : 657/737 places, 574/609 transitions.
Support contains 34 out of 657 places after structural reductions.
[2024-05-25 18:25:02] [INFO ] Flatten gal took : 186 ms
[2024-05-25 18:25:02] [INFO ] Flatten gal took : 93 ms
[2024-05-25 18:25:02] [INFO ] Input system was already deterministic with 574 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (200 resets) in 3975 ms. (10 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
[2024-05-25 18:25:04] [INFO ] Invariant cache hit.
[2024-05-25 18:25:04] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 293/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 347/657 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 574/1231 variables, 657/796 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 152/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/1231 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1231/1231 variables, and 948 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2023 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 657/657 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 293/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 347/657 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 574/1231 variables, 657/796 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 152/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 9/957 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1231 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/1231 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1231/1231 variables, and 957 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2992 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 657/657 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 5104ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 7 properties in 4137 ms.
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 132 place count 591 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 589 transition count 546
Free-agglomeration rule applied 151 times.
Iterating global reduction 2 with 151 rules applied. Total rules applied 287 place count 589 transition count 395
Reduce places removed 151 places and 0 transitions.
Graph (complete) has 887 edges and 438 vertex of which 180 are kept as prefixes of interest. Removing 258 places using SCC suffix rule.3 ms
Discarding 258 places :
Also discarding 207 output transitions
Drop transitions (Output transitions of discarded places.) removed 207 transitions
Iterating post reduction 2 with 152 rules applied. Total rules applied 439 place count 180 transition count 188
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 489 place count 180 transition count 138
Applied a total of 489 rules in 326 ms. Remains 180 /657 variables (removed 477) and now considering 138/574 (removed 436) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 180/657 places, 138/574 transitions.
RANDOM walk for 40000 steps (8 resets) in 1262 ms. (31 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1873 steps (0 resets) in 11 ms. (156 steps per ms) remains 0/1 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 38 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-25 18:25:14] [INFO ] Computed 139 invariants in 8 ms
[2024-05-25 18:25:15] [INFO ] Implicit Places using invariants in 669 ms returned [136, 179, 649]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 675 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/657 places, 570/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 649 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 649 transition count 569
Applied a total of 2 rules in 40 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-25 18:25:15] [INFO ] Computed 136 invariants in 5 ms
[2024-05-25 18:25:16] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-25 18:25:16] [INFO ] Invariant cache hit.
[2024-05-25 18:25:16] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 18:25:18] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3467 ms. Remains : 649/657 places, 569/574 transitions.
Stuttering acceptance computed with spot in 366 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-00
Entered a terminal (fully accepting) state of product in 359 steps with 1 reset in 22 ms.
FORMULA Parking-PT-832-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-00 finished in 3979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(p1)&&p0)||(p1&&(X(p2) U (!p3&&X(p2))))))))'
Support contains 7 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 41 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-25 18:25:18] [INFO ] Computed 139 invariants in 5 ms
[2024-05-25 18:25:19] [INFO ] Implicit Places using invariants in 632 ms returned [179, 649]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 645 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/657 places, 570/574 transitions.
Applied a total of 0 rules in 22 ms. Remains 651 /651 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 708 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 588 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3))]
Running random walk in product with property : Parking-PT-832-LTLFireability-01
Stuttering criterion allowed to conclude after 651 steps with 106 reset in 32 ms.
FORMULA Parking-PT-832-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-01 finished in 1384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(p0) U !p0)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 130 place count 592 transition count 509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
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 134 place count 590 transition count 547
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 590 transition count 547
Applied a total of 135 rules in 259 ms. Remains 590 /657 variables (removed 67) and now considering 547/574 (removed 27) transitions.
// Phase 1: matrix 547 rows 590 cols
[2024-05-25 18:25:20] [INFO ] Computed 139 invariants in 18 ms
[2024-05-25 18:25:21] [INFO ] Implicit Places using invariants in 821 ms returned [135, 173, 587]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 825 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/657 places, 547/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 586 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 586 transition count 546
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 0 with 2 rules applied. Total rules applied 4 place count 585 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 584 transition count 560
Applied a total of 6 rules in 134 ms. Remains 584 /587 variables (removed 3) and now considering 560/547 (removed -13) transitions.
// Phase 1: matrix 560 rows 584 cols
[2024-05-25 18:25:21] [INFO ] Computed 136 invariants in 9 ms
[2024-05-25 18:25:22] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-05-25 18:25:22] [INFO ] Invariant cache hit.
[2024-05-25 18:25:22] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 18:25:24] [INFO ] Implicit Places using invariants and state equation in 2731 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/657 places, 560/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4578 ms. Remains : 584/657 places, 560/574 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-02
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 4 ms.
FORMULA Parking-PT-832-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-02 finished in 4715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 132 place count 591 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
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 136 place count 589 transition count 546
Applied a total of 136 rules in 148 ms. Remains 589 /657 variables (removed 68) and now considering 546/574 (removed 28) transitions.
// Phase 1: matrix 546 rows 589 cols
[2024-05-25 18:25:25] [INFO ] Computed 139 invariants in 6 ms
[2024-05-25 18:25:25] [INFO ] Implicit Places using invariants in 590 ms returned [135, 173, 586]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 593 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/657 places, 546/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 585 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 585 transition count 545
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 4 place count 584 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 6 place count 583 transition count 559
Applied a total of 6 rules in 73 ms. Remains 583 /586 variables (removed 3) and now considering 559/546 (removed -13) transitions.
// Phase 1: matrix 559 rows 583 cols
[2024-05-25 18:25:25] [INFO ] Computed 136 invariants in 3 ms
[2024-05-25 18:25:26] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-25 18:25:26] [INFO ] Invariant cache hit.
[2024-05-25 18:25:26] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 18:25:28] [INFO ] Implicit Places using invariants and state equation in 2636 ms returned []
Implicit Place search using SMT with State Equation took 3053 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 583/657 places, 559/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3869 ms. Remains : 583/657 places, 559/574 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-03
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 4 ms.
FORMULA Parking-PT-832-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-03 finished in 3954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 132 place count 591 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
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 136 place count 589 transition count 546
Applied a total of 136 rules in 146 ms. Remains 589 /657 variables (removed 68) and now considering 546/574 (removed 28) transitions.
// Phase 1: matrix 546 rows 589 cols
[2024-05-25 18:25:29] [INFO ] Computed 139 invariants in 5 ms
[2024-05-25 18:25:29] [INFO ] Implicit Places using invariants in 618 ms returned [135, 173, 586]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 620 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/657 places, 546/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 585 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 585 transition count 545
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 0 with 2 rules applied. Total rules applied 4 place count 584 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 6 place count 583 transition count 559
Applied a total of 6 rules in 112 ms. Remains 583 /586 variables (removed 3) and now considering 559/546 (removed -13) transitions.
// Phase 1: matrix 559 rows 583 cols
[2024-05-25 18:25:29] [INFO ] Computed 136 invariants in 3 ms
[2024-05-25 18:25:30] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-25 18:25:30] [INFO ] Invariant cache hit.
[2024-05-25 18:25:31] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 18:25:32] [INFO ] Implicit Places using invariants and state equation in 2551 ms returned []
Implicit Place search using SMT with State Equation took 3175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 583/657 places, 559/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4054 ms. Remains : 583/657 places, 559/574 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-06
Stuttering criterion allowed to conclude after 237 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-06 finished in 4127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||G(p2))))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 128 place count 593 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 591 transition count 548
Applied a total of 132 rules in 114 ms. Remains 591 /657 variables (removed 66) and now considering 548/574 (removed 26) transitions.
// Phase 1: matrix 548 rows 591 cols
[2024-05-25 18:25:33] [INFO ] Computed 139 invariants in 5 ms
[2024-05-25 18:25:33] [INFO ] Implicit Places using invariants in 601 ms returned [135, 173, 588]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 606 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/657 places, 548/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 587 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 587 transition count 547
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 4 place count 586 transition count 546
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 6 place count 585 transition count 561
Applied a total of 6 rules in 104 ms. Remains 585 /588 variables (removed 3) and now considering 561/548 (removed -13) transitions.
// Phase 1: matrix 561 rows 585 cols
[2024-05-25 18:25:33] [INFO ] Computed 136 invariants in 3 ms
[2024-05-25 18:25:34] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-25 18:25:34] [INFO ] Invariant cache hit.
[2024-05-25 18:25:35] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-25 18:25:36] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 3017 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 585/657 places, 561/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3843 ms. Remains : 585/657 places, 561/574 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-07
Product exploration explored 100000 steps with 513 reset in 1062 ms.
Product exploration explored 100000 steps with 516 reset in 986 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 p2))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) p2)), (X p1), (X (X (NOT (AND p0 p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 185 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (200 resets) in 928 ms. (43 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 4/4 properties
[2024-05-25 18:25:40] [INFO ] Invariant cache hit.
[2024-05-25 18:25:40] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 457/585 variables, 132/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1146 variables, 238/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1146 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 959 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 457/585 variables, 132/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1146 variables, 238/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 4/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1146 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1146 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 963 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1763 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3052ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1255 ms.
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 561/561 transitions.
Free-agglomeration rule applied 157 times.
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 585 transition count 404
Reduce places removed 157 places and 0 transitions.
Graph (complete) has 899 edges and 428 vertex of which 232 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.2 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions (Output transitions of discarded places.) removed 156 transitions
Iterating post reduction 0 with 158 rules applied. Total rules applied 315 place count 232 transition count 248
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 367 place count 232 transition count 196
Applied a total of 367 rules in 70 ms. Remains 232 /585 variables (removed 353) and now considering 196/561 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 232/585 places, 196/561 transitions.
RANDOM walk for 24467 steps (4 resets) in 137 ms. (177 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 p2))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) p2)), (X p1), (X (X (NOT (AND p0 p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 519 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 561/561 transitions.
Applied a total of 0 rules in 43 ms. Remains 585 /585 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2024-05-25 18:25:45] [INFO ] Invariant cache hit.
[2024-05-25 18:25:46] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-05-25 18:25:46] [INFO ] Invariant cache hit.
[2024-05-25 18:25:46] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-25 18:25:48] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 2985 ms to find 0 implicit places.
[2024-05-25 18:25:48] [INFO ] Redundant transitions in 48 ms returned []
Running 536 sub problems to find dead transitions.
[2024-05-25 18:25:48] [INFO ] Invariant cache hit.
[2024-05-25 18:25:48] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 3 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 536 unsolved
SMT process timed out in 31622ms, After SMT, problems are : Problem set: 0 solved, 536 unsolved
Search for dead transitions found 0 dead transitions in 31638ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34737 ms. Remains : 585/585 places, 561/561 transitions.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 173 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (207 resets) in 711 ms. (56 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
[2024-05-25 18:26:21] [INFO ] Invariant cache hit.
[2024-05-25 18:26:21] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 457/585 variables, 132/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1146 variables, 238/959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1146 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 959 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 457/585 variables, 132/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1146 variables, 238/959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1146 variables, 5/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1146 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1146 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 964 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3459ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 1845 ms.
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 561/561 transitions.
Free-agglomeration rule applied 157 times.
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 585 transition count 404
Reduce places removed 157 places and 0 transitions.
Graph (complete) has 899 edges and 428 vertex of which 232 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.1 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions (Output transitions of discarded places.) removed 156 transitions
Iterating post reduction 0 with 158 rules applied. Total rules applied 315 place count 232 transition count 248
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 367 place count 232 transition count 196
Applied a total of 367 rules in 56 ms. Remains 232 /585 variables (removed 353) and now considering 196/561 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 232/585 places, 196/561 transitions.
RANDOM walk for 34324 steps (8 resets) in 156 ms. (218 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p2))), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 415 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 515 reset in 1189 ms.
Product exploration explored 100000 steps with 513 reset in 873 ms.
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 561/561 transitions.
Applied a total of 0 rules in 28 ms. Remains 585 /585 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2024-05-25 18:26:29] [INFO ] Invariant cache hit.
[2024-05-25 18:26:29] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-25 18:26:29] [INFO ] Invariant cache hit.
[2024-05-25 18:26:30] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-25 18:26:32] [INFO ] Implicit Places using invariants and state equation in 2281 ms returned []
Implicit Place search using SMT with State Equation took 2833 ms to find 0 implicit places.
[2024-05-25 18:26:32] [INFO ] Redundant transitions in 13 ms returned []
Running 536 sub problems to find dead transitions.
[2024-05-25 18:26:32] [INFO ] Invariant cache hit.
[2024-05-25 18:26:32] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 3 (OVERLAPS) 561/1146 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 536 unsolved
SMT process timed out in 31517ms, After SMT, problems are : Problem set: 0 solved, 536 unsolved
Search for dead transitions found 0 dead transitions in 31525ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34410 ms. Remains : 585/585 places, 561/561 transitions.
Treatment of property Parking-PT-832-LTLFireability-07 finished in 90794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(p1))||(p2&&(p0||G(p3))))))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 36 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-25 18:27:03] [INFO ] Computed 139 invariants in 6 ms
[2024-05-25 18:27:04] [INFO ] Implicit Places using invariants in 528 ms returned [136, 179, 650]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 532 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 650 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 650 transition count 570
Applied a total of 2 rules in 34 ms. Remains 650 /651 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 650 cols
[2024-05-25 18:27:04] [INFO ] Computed 136 invariants in 2 ms
[2024-05-25 18:27:04] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-25 18:27:05] [INFO ] Invariant cache hit.
[2024-05-25 18:27:05] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 18:27:06] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2424 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 650/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3030 ms. Remains : 650/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Parking-PT-832-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-832-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-08 finished in 3300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 21 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-25 18:27:07] [INFO ] Computed 139 invariants in 3 ms
[2024-05-25 18:27:07] [INFO ] Implicit Places using invariants in 788 ms returned [136, 650]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 792 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 39 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-25 18:27:07] [INFO ] Computed 137 invariants in 3 ms
[2024-05-25 18:27:08] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-05-25 18:27:08] [INFO ] Invariant cache hit.
[2024-05-25 18:27:09] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 18:27:10] [INFO ] Implicit Places using invariants and state equation in 1904 ms returned []
Implicit Place search using SMT with State Equation took 2487 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3342 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-10
Stuttering criterion allowed to conclude after 202 steps with 0 reset in 2 ms.
FORMULA Parking-PT-832-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-10 finished in 3479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1||X(F(p2)))))))'
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 27 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-25 18:27:10] [INFO ] Computed 139 invariants in 2 ms
[2024-05-25 18:27:11] [INFO ] Implicit Places using invariants in 512 ms returned [136, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 513 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 21 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-25 18:27:11] [INFO ] Computed 137 invariants in 3 ms
[2024-05-25 18:27:11] [INFO ] Implicit Places using invariants in 735 ms returned []
[2024-05-25 18:27:11] [INFO ] Invariant cache hit.
[2024-05-25 18:27:12] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 18:27:13] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 2574 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3136 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 2181 ms.
Product exploration explored 100000 steps with 33333 reset in 2040 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 25 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-832-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-11 finished in 7561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 31 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-25 18:27:18] [INFO ] Computed 139 invariants in 2 ms
[2024-05-25 18:27:18] [INFO ] Implicit Places using invariants in 553 ms returned [136, 179, 649]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 555 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/657 places, 570/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 649 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 649 transition count 569
Applied a total of 2 rules in 33 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-25 18:27:18] [INFO ] Computed 136 invariants in 2 ms
[2024-05-25 18:27:19] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-25 18:27:19] [INFO ] Invariant cache hit.
[2024-05-25 18:27:20] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 18:27:21] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2448 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3069 ms. Remains : 649/657 places, 569/574 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-832-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-13 finished in 3171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 656 transition count 558
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 641 transition count 558
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 641 transition count 543
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 626 transition count 543
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 622 transition count 539
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 622 transition count 539
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 128 place count 592 transition count 509
Applied a total of 128 rules in 50 ms. Remains 592 /657 variables (removed 65) and now considering 509/574 (removed 65) transitions.
// Phase 1: matrix 509 rows 592 cols
[2024-05-25 18:27:21] [INFO ] Computed 139 invariants in 1 ms
[2024-05-25 18:27:21] [INFO ] Implicit Places using invariants in 574 ms returned [134, 174, 589]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 587 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 589/657 places, 509/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 588 transition count 508
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 588 transition count 508
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 6 place count 586 transition count 506
Applied a total of 6 rules in 54 ms. Remains 586 /589 variables (removed 3) and now considering 506/509 (removed 3) transitions.
// Phase 1: matrix 506 rows 586 cols
[2024-05-25 18:27:21] [INFO ] Computed 136 invariants in 2 ms
[2024-05-25 18:27:22] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-25 18:27:22] [INFO ] Invariant cache hit.
[2024-05-25 18:27:23] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/657 places, 506/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2609 ms. Remains : 586/657 places, 506/574 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLFireability-14
Product exploration explored 100000 steps with 511 reset in 1156 ms.
Product exploration explored 100000 steps with 508 reset in 835 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 : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 288 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (206 resets) in 414 ms. (96 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
[2024-05-25 18:27:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/183 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 93/276 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/1092 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 34/136 constraints, State Equation: 148/586 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/183 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/276 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 31/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/1092 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 34/136 constraints, State Equation: 148/586 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 399ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 425 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 506/506 transitions.
Applied a total of 0 rules in 19 ms. Remains 586 /586 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 18:27:27] [INFO ] Invariant cache hit.
[2024-05-25 18:27:28] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-25 18:27:28] [INFO ] Invariant cache hit.
[2024-05-25 18:27:29] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-05-25 18:27:29] [INFO ] Redundant transitions in 8 ms returned []
Running 338 sub problems to find dead transitions.
[2024-05-25 18:27:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 8/586 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 506/1092 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 722 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 8/586 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 506/1092 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 338/1060 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1060 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61685 ms. Remains : 586/586 places, 506/506 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 : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 37672 steps (191 resets) in 393 ms. (95 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 514 reset in 1080 ms.
Product exploration explored 100000 steps with 511 reset in 816 ms.
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 506/506 transitions.
Applied a total of 0 rules in 12 ms. Remains 586 /586 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-25 18:28:32] [INFO ] Invariant cache hit.
[2024-05-25 18:28:33] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-25 18:28:33] [INFO ] Invariant cache hit.
[2024-05-25 18:28:34] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2024-05-25 18:28:34] [INFO ] Redundant transitions in 5 ms returned []
Running 338 sub problems to find dead transitions.
[2024-05-25 18:28:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 8/586 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 506/1092 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 722 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 8/586 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 506/1092 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 338/1060 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 1)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 0)
(s304 1)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1060 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61695 ms. Remains : 586/586 places, 506/506 transitions.
Treatment of property Parking-PT-832-LTLFireability-14 finished in 133030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p1)&&p0)))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 20 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-25 18:29:34] [INFO ] Computed 139 invariants in 1 ms
[2024-05-25 18:29:34] [INFO ] Implicit Places using invariants in 607 ms returned [136, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 609 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 20 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-25 18:29:34] [INFO ] Computed 137 invariants in 2 ms
[2024-05-25 18:29:35] [INFO ] Implicit Places using invariants in 685 ms returned []
[2024-05-25 18:29:35] [INFO ] Invariant cache hit.
[2024-05-25 18:29:36] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-25 18:29:37] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2877 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-15
Stuttering criterion allowed to conclude after 187 steps with 0 reset in 1 ms.
FORMULA Parking-PT-832-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-15 finished in 3052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2024-05-25 18:29:37] [INFO ] Flatten gal took : 45 ms
[2024-05-25 18:29:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-25 18:29:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 657 places, 574 transitions and 1942 arcs took 11 ms.
Total runtime 282456 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Parking-PT-832

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 657
TRANSITIONS: 574
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.004s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1236
MODEL NAME: /home/mcc/execution/416/model
657 places, 574 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Parking-PT-832-LTLFireability-07 CANNOT_COMPUTE
FORMULA Parking-PT-832-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716662158611

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Parking-PT-832"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Parking-PT-832, 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 r267-smll-171654405700092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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