Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946787900084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is AutonomousCar-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.6K Mar 5 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 5 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 5 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 16:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 5 16:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 177K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779482002924

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 20:33:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 20:33:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:33:25] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2026-05-22 20:33:25] [INFO ] Transformed 65 places.
[2026-05-22 20:33:25] [INFO ] Transformed 417 transitions.
[2026-05-22 20:33:25] [INFO ] Found NUPN structural information;
[2026-05-22 20:33:25] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 243
Applied a total of 6 rules in 30 ms. Remains 62 /65 variables (removed 3) and now considering 243/258 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8687997415183845342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12240129996189159261.kers'
[2026-05-22 20:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8687997415183845342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12240129996189159261.kers]
Normalized transition count is 242 out of 243 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 242 rows 61 cols 1801 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-22 20:33:26] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12240129996189159261.kers
Total runtime 3 ms.
[2026-05-22 20:33:26] [INFO ] Implicit Places using invariants in 282 ms returned []
[2026-05-22 20:33:26] [INFO ] Invariant cache hit.
[2026-05-22 20:33:26] [INFO ] State equation strengthened by 135 read => feed constraints.
[2026-05-22 20:33:26] [INFO ] Implicit Places using invariants and state equation in 297 ms returned [58, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 654 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 243/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 718 ms. Remains : 60/65 places, 243/258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-499308151010759336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8368759329179663154.kers'
[2026-05-22 20:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-499308151010759336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8368759329179663154.kers]
Normalized transition count is 242 out of 243 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 242 rows 59 cols 1794 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-22 20:33:26] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8368759329179663154.kers
Total runtime 3 ms.
[2026-05-22 20:33:26] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 20:33:26] [INFO ] Invariant cache hit.
[2026-05-22 20:33:27] [INFO ] State equation strengthened by 135 read => feed constraints.
[2026-05-22 20:33:27] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-22 20:33:27] [INFO ] Invariant cache hit.
[2026-05-22 20:33:27] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 242/302 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 134/202 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 206 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 242/302 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 134/205 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 242/447 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 5/452 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/303 variables, and 452 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 134/135 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 61067ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 61105ms
Finished structural reductions in LTL mode , in 1 iterations and 61540 ms. Remains : 60/60 places, 243/243 transitions.
Support contains 33 out of 60 places after structural reductions.
[2026-05-22 20:34:28] [INFO ] Flatten gal took : 142 ms
[2026-05-22 20:34:29] [INFO ] Flatten gal took : 72 ms
[2026-05-22 20:34:29] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 32 out of 60 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (2237 resets) in 3660 ms. (10 steps per ms) remains 7/31 properties
BEST_FIRST walk for 40003 steps (208 resets) in 230 ms. (173 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (215 resets) in 98 ms. (404 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (270 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (205 resets) in 80 ms. (493 steps per ms) remains 2/3 properties
[2026-05-22 20:34:30] [INFO ] Invariant cache hit.
[2026-05-22 20:34:30] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 17/25 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 234/285 variables, 51/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 134/193 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/193 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/298 variables, 5/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/302 variables, 4/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/303 variables, 1/203 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/303 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 203 constraints, problems are : Problem set: 1 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/51 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 234/285 variables, 51/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 134/193 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 3/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/298 variables, 5/201 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/302 variables, 4/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/303 variables, 1/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/303 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 208 constraints, problems are : Problem set: 1 solved, 1 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1144ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 386 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 243/243 transitions.
Graph (complete) has 502 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 232
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 52 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 52 transition count 231
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 51 transition count 231
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 46 transition count 202
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 46 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 43 transition count 199
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 43 transition count 193
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 78 place count 37 transition count 163
Applied a total of 78 rules in 148 ms. Remains 37 /60 variables (removed 23) and now considering 163/243 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 37/60 places, 163/243 transitions.
RANDOM walk for 40000 steps (145 resets) in 522 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35526 steps (96 resets) in 293 ms. (120 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 60 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 49 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 49 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 47 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 46 transition count 218
Applied a total of 28 rules in 58 ms. Remains 46 /60 variables (removed 14) and now considering 218/243 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1780833268425394423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6062998541419494120.kers'
[2026-05-22 20:34:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1780833268425394423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6062998541419494120.kers]
Normalized transition count is 217 out of 218 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 217 rows 45 cols 1701 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 20:34:33] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6062998541419494120.kers
Total runtime 3 ms.
[2026-05-22 20:34:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 20:34:33] [INFO ] Invariant cache hit.
[2026-05-22 20:34:33] [INFO ] State equation strengthened by 125 read => feed constraints.
[2026-05-22 20:34:33] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2026-05-22 20:34:33] [INFO ] Redundant transitions in 34 ms returned []
Running 217 sub problems to find dead transitions.
[2026-05-22 20:34:33] [INFO ] Invariant cache hit.
[2026-05-22 20:34:33] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 217/263 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 124/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/264 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 180 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 217/263 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 124/179 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 217/396 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/264 variables, and 401 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 124/125 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 50788ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 50792ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/60 places, 218/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51245 ms. Remains : 46/60 places, 218/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-00
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-00 finished in 51790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 60 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 48 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 48 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 46 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 45 transition count 211
Applied a total of 30 rules in 48 ms. Remains 45 /60 variables (removed 15) and now considering 211/243 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14747566935075706834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3810513016215554577.kers'
[2026-05-22 20:35:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14747566935075706834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3810513016215554577.kers]
Normalized transition count is 210 out of 211 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 210 rows 44 cols 1663 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 20:35:24] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3810513016215554577.kers
Total runtime 3 ms.
[2026-05-22 20:35:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-22 20:35:24] [INFO ] Invariant cache hit.
[2026-05-22 20:35:25] [INFO ] State equation strengthened by 119 read => feed constraints.
[2026-05-22 20:35:25] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2026-05-22 20:35:25] [INFO ] Redundant transitions in 49 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-22 20:35:25] [INFO ] Invariant cache hit.
[2026-05-22 20:35:25] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/255 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 118/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 173 constraints, problems are : Problem set: 0 solved, 210 unsolved in 22770 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/255 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 118/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 210/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 255/256 variables, and 387 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 118/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 53404ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 53405ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/60 places, 211/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53960 ms. Remains : 45/60 places, 211/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-01
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-01 finished in 54059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(p1) U X(X((p2||X(X(p2)))))))))'
Support contains 14 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 215
Applied a total of 8 rules in 3 ms. Remains 56 /60 variables (removed 4) and now considering 215/243 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14824350659526998434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4598582165484345191.kers'
[2026-05-22 20:36:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14824350659526998434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4598582165484345191.kers]
Normalized transition count is 214 out of 215 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 214 rows 55 cols 1642 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-22 20:36:18] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4598582165484345191.kers
Total runtime 2 ms.
[2026-05-22 20:36:18] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-22 20:36:18] [INFO ] Invariant cache hit.
[2026-05-22 20:36:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-22 20:36:19] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2026-05-22 20:36:19] [INFO ] Invariant cache hit.
[2026-05-22 20:36:19] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 21690 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 397 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 51942ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 51944ms
Starting structural reductions in LTL mode, iteration 1 : 56/60 places, 215/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52181 ms. Remains : 56/60 places, 215/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(p1) U X(X((X(X(p2))||p2)))))))'
Stuttering acceptance computed with spot in 932 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-02
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-02 finished in 53198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&((p1 U p2)||F(p3)))))))'
Support contains 15 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 215
Applied a total of 8 rules in 6 ms. Remains 56 /60 variables (removed 4) and now considering 215/243 (removed 28) transitions.
[2026-05-22 20:37:12] [INFO ] Invariant cache hit.
[2026-05-22 20:37:12] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-22 20:37:12] [INFO ] Invariant cache hit.
[2026-05-22 20:37:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-22 20:37:12] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 56/60 places, 215/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 56/60 places, 215/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&((p1 U p2)||F(p3)))))))'
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-03
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-03 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(F(p0))) U G(!p1)))))'
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 10 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18065102070935163694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9255314671125706977.kers'
[2026-05-22 20:37:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18065102070935163694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9255314671125706977.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 221 rows 56 cols 1680 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 20:37:12] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9255314671125706977.kers
Total runtime 3 ms.
[2026-05-22 20:37:13] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 20:37:13] [INFO ] Invariant cache hit.
[2026-05-22 20:37:13] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:37:13] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-22 20:37:13] [INFO ] Invariant cache hit.
[2026-05-22 20:37:13] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 221 unsolved in 26661 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/405 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 411 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 57067ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 57069ms
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57411 ms. Remains : 57/60 places, 222/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(F(p0))) U G(!p1)))))'
Stuttering acceptance computed with spot in 311 ms :[p1, p1, p1, (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-04
Product exploration explored 100000 steps with 19941 reset in 701 ms.
Product exploration explored 100000 steps with 20057 reset in 945 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 26994 steps (1541 resets) in 200 ms. (134 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[p1, p1, p1, (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Knowledge-based reduction took 441 ms.
Stuttering acceptance computed with spot in 312 ms :[p1, p1, p1, (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Support contains 11 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-22 20:38:13] [INFO ] Invariant cache hit.
[2026-05-22 20:38:13] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-22 20:38:13] [INFO ] Invariant cache hit.
[2026-05-22 20:38:13] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:38:13] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 57/57 places, 222/222 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 19066 steps (1036 resets) in 121 ms. (156 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[p1, p1, p1, (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Knowledge-based reduction took 575 ms.
Stuttering acceptance computed with spot in 311 ms :[p1, p1, p1, (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 317 ms :[p1, p1, p1, (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 20029 reset in 967 ms.
Product exploration explored 100000 steps with 19979 reset in 834 ms.
Spot run failed in 116 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10577959561895694745
[2026-05-22 20:38:16] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10577959561895694745
Running compilation step : cd /tmp/ltsmin10577959561895694745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1141 ms.
Running link step : cd /tmp/ltsmin10577959561895694745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin10577959561895694745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3061482552510367488.hoa' '--buchi-type=spotba'
LTSmin run took 3353 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-04 finished in 68346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 58 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 50 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 50 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 49 transition count 233
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 46 transition count 212
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 46 transition count 212
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 44 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 43 transition count 210
Applied a total of 31 rules in 32 ms. Remains 43 /60 variables (removed 17) and now considering 210/243 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8512297031811621786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17513217862626128000.kers'
[2026-05-22 20:38:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8512297031811621786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17513217862626128000.kers]
Normalized transition count is 209 out of 210 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 43 cols 1653 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-22 20:38:21] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17513217862626128000.kers
Total runtime 1 ms.
[2026-05-22 20:38:21] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 20:38:21] [INFO ] Invariant cache hit.
[2026-05-22 20:38:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 20:38:21] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2026-05-22 20:38:21] [INFO ] Redundant transitions in 17 ms returned []
Running 209 sub problems to find dead transitions.
[2026-05-22 20:38:21] [INFO ] Invariant cache hit.
[2026-05-22 20:38:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 209/252 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 57 constraints, problems are : Problem set: 0 solved, 209 unsolved in 20718 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 209/252 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 209/261 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/253 variables, and 267 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 50989ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 50990ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/60 places, 210/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51289 ms. Remains : 43/60 places, 210/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-05
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-05 finished in 51366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 60 transition count 237
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 54 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 54 transition count 235
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 16 place count 52 transition count 235
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 48 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 48 transition count 207
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 2 with 2 rules applied. Total rules applied 26 place count 47 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 46 transition count 206
Applied a total of 28 rules in 25 ms. Remains 46 /60 variables (removed 14) and now considering 206/243 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4185052292520650201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9882978671433923873.kers'
[2026-05-22 20:39:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4185052292520650201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9882978671433923873.kers]
Normalized transition count is 205 out of 206 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 205 rows 45 cols 1630 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 20:39:12] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9882978671433923873.kers
Total runtime 2 ms.
[2026-05-22 20:39:12] [INFO ] Implicit Places using invariants in 212 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 214 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/60 places, 206/243 transitions.
Applied a total of 0 rules in 13 ms. Remains 45 /45 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 45/60 places, 206/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X(p0)&&F(p1)))||F(p2)))))'
Support contains 12 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 5 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10012046923875243762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11714915212676725374.kers'
[2026-05-22 20:39:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10012046923875243762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11714915212676725374.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 221 rows 56 cols 1680 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 20:39:13] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11714915212676725374.kers
Total runtime 4 ms.
[2026-05-22 20:39:13] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-22 20:39:13] [INFO ] Invariant cache hit.
[2026-05-22 20:39:13] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:39:13] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-22 20:39:13] [INFO ] Invariant cache hit.
[2026-05-22 20:39:13] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21311 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/405 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 411 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 51765ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 51766ms
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52158 ms. Remains : 57/60 places, 222/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X(p0)&&F(p1)))||F(p2)))))'
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-07
Product exploration explored 100000 steps with 3 reset in 327 ms.
Product exploration explored 100000 steps with 39 reset in 356 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (2283 resets) in 406 ms. (98 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (205 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (208 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (211 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
[2026-05-22 20:40:06] [INFO ] Invariant cache hit.
[2026-05-22 20:40:06] [INFO ] State equation strengthened by 117 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 215/264 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 116/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 13/277 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/279 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 215/264 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 116/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/277 variables, 7/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/278 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/279 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/279 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 187 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2171 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2482ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 222/222 transitions.
Graph (complete) has 478 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 56 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 50 transition count 212
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 50 transition count 209
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 47 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 46 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 46 transition count 208
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 2 with 2 rules applied. Total rules applied 26 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 74 place count 39 transition count 165
Applied a total of 74 rules in 50 ms. Remains 39 /57 variables (removed 18) and now considering 165/222 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 39/57 places, 165/222 transitions.
RANDOM walk for 40000 steps (78 resets) in 411 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (352 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (349 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (353 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 111317 steps, run visited all 3 properties in 535 ms. (steps per millisecond=208 )
Probabilistic random walk after 111317 steps, saw 18555 distinct states, run finished after 541 ms. (steps per millisecond=205 ) properties seen :3
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 4385 ms.
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-22 20:40:10] [INFO ] Invariant cache hit.
[2026-05-22 20:40:10] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-22 20:40:10] [INFO ] Invariant cache hit.
[2026-05-22 20:40:11] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:40:11] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 57/57 places, 222/222 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (2291 resets) in 533 ms. (74 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (204 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (205 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (209 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
[2026-05-22 20:40:11] [INFO ] Invariant cache hit.
[2026-05-22 20:40:11] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 215/264 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 116/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 13/277 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/279 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 215/264 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 116/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/277 variables, 7/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/278 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/279 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/279 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 187 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2069 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2392ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 222/222 transitions.
Graph (complete) has 478 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 56 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 50 transition count 212
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 50 transition count 209
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 47 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 46 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 46 transition count 208
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 2 with 2 rules applied. Total rules applied 26 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 74 place count 39 transition count 165
Applied a total of 74 rules in 39 ms. Remains 39 /57 variables (removed 18) and now considering 165/222 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 39/57 places, 165/222 transitions.
RANDOM walk for 36391 steps (64 resets) in 297 ms. (122 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 3446 ms.
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 24 reset in 186 ms.
Product exploration explored 100000 steps with 76 reset in 208 ms.
Spot run failed in 87 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16444037799687869321
[2026-05-22 20:40:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16444037799687869321
Running compilation step : cd /tmp/ltsmin16444037799687869321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 726 ms.
Running link step : cd /tmp/ltsmin16444037799687869321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16444037799687869321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased126944868943320205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-22 20:40:30] [INFO ] Invariant cache hit.
[2026-05-22 20:40:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-22 20:40:30] [INFO ] Invariant cache hit.
[2026-05-22 20:40:30] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:40:31] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 57/57 places, 222/222 transitions.
Built C files in :
/tmp/ltsmin11443641526511098905
[2026-05-22 20:40:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11443641526511098905
Running compilation step : cd /tmp/ltsmin11443641526511098905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 893 ms.
Running link step : cd /tmp/ltsmin11443641526511098905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11443641526511098905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5972090370675636796.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 20:40:46] [INFO ] Flatten gal took : 32 ms
[2026-05-22 20:40:46] [INFO ] Flatten gal took : 29 ms
[2026-05-22 20:40:46] [INFO ] Time to serialize gal into /tmp/LTL13065387325167720389.gal : 6 ms
[2026-05-22 20:40:46] [INFO ] Time to serialize properties into /tmp/LTL17660387209825299978.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13065387325167720389.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4851569992392516923.hoa' '-atoms' '/tmp/LTL17660387209825299978.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17660387209825299978.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4851569992392516923.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t15, t18, t19, t20, t23, t25, t28, t30, t141, t167, t169, t174,...448
Computing Next relation with stutter on 10130 deadlock states
Detected timeout of ITS tools.
[2026-05-22 20:41:01] [INFO ] Flatten gal took : 45 ms
[2026-05-22 20:41:01] [INFO ] Flatten gal took : 39 ms
[2026-05-22 20:41:01] [INFO ] Time to serialize gal into /tmp/LTL12184637056385396276.gal : 10 ms
[2026-05-22 20:41:01] [INFO ] Time to serialize properties into /tmp/LTL13534047597644501256.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12184637056385396276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13534047597644501256.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((X((X("(((p1==1)&&(p7==1))&&((p26==1)&&(p57==1)))"))&&(F("((((p13==1)&&(p23==1))&&((p27==1)&&(p34==1)))&&(((p41==1)&&(p51==1))&...226
Formula 0 simplified : XF(X(X!"(((p1==1)&&(p7==1))&&((p26==1)&&(p57==1)))" | G!"((((p13==1)&&(p23==1))&&((p27==1)&&(p34==1)))&&(((p41==1)&&(p51==1))&&(p58=...212
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t15, t18, t19, t20, t23, t25, t28, t30, t141, t167, t169, t174,...448
Computing Next relation with stutter on 10130 deadlock states
Detected timeout of ITS tools.
[2026-05-22 20:41:16] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:41:16] [INFO ] Applying decomposition
[2026-05-22 20:41:16] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9819010687688014585.txt' '-o' '/tmp/graph9819010687688014585.bin' '-w' '/tmp/graph9819010687688014585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9819010687688014585.bin' '-l' '-1' '-v' '-w' '/tmp/graph9819010687688014585.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:41:16] [INFO ] Decomposing Gal with order
[2026-05-22 20:41:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:41:16] [INFO ] Removed a total of 745 redundant transitions.
[2026-05-22 20:41:16] [INFO ] Flatten gal took : 127 ms
[2026-05-22 20:41:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 12 ms.
[2026-05-22 20:41:16] [INFO ] Time to serialize gal into /tmp/LTL12995843094510400150.gal : 3 ms
[2026-05-22 20:41:16] [INFO ] Time to serialize properties into /tmp/LTL15902913522107016437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12995843094510400150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15902913522107016437.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X((X("(((u0.p1==1)&&(u0.p7==1))&&((u8.p26==1)&&(u0.p57==1)))"))&&(F("((((i1.u2.p13==1)&&(i2.u6.p23==1))&&((u8.p27==1)&&(i5.u11...293
Formula 0 simplified : XF(X(X!"(((u0.p1==1)&&(u0.p7==1))&&((u8.p26==1)&&(u0.p57==1)))" | G!"((((i1.u2.p13==1)&&(i2.u6.p23==1))&&((u8.p27==1)&&(i5.u11.p34==...279
Reverse transition relation is NOT exact ! Due to transitions t142, t190, t191, t222, t223, u0.t167, u8.t19, u8.t20, i1.u2.t30, i1.u3.t28, i2.u5.t25, i2.u6...392
Computing Next relation with stutter on 10130 deadlock states
85 unique states visited
85 strongly connected components in search stack
86 transitions explored
85 items max in DFS search stack
61 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.639389,35192,1,0,37281,1709,1015,54160,330,9982,64977
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-06a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutonomousCar-PT-06a-LTLFireability-07 finished in 124601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0)&&X(p1)) U X(!p2)))))'
Support contains 8 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 53 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 49 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 49 transition count 220
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 3 with 4 rules applied. Total rules applied 26 place count 47 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 46 transition count 218
Applied a total of 28 rules in 27 ms. Remains 46 /60 variables (removed 14) and now considering 218/243 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9704733157992488676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3520647780571626380.kers'
[2026-05-22 20:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9704733157992488676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3520647780571626380.kers]
Normalized transition count is 217 out of 218 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 217 rows 45 cols 1701 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 20:41:17] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3520647780571626380.kers
Total runtime 2 ms.
[2026-05-22 20:41:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-22 20:41:17] [INFO ] Invariant cache hit.
[2026-05-22 20:41:17] [INFO ] State equation strengthened by 125 read => feed constraints.
[2026-05-22 20:41:17] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2026-05-22 20:41:18] [INFO ] Redundant transitions in 23 ms returned []
Running 217 sub problems to find dead transitions.
[2026-05-22 20:41:18] [INFO ] Invariant cache hit.
[2026-05-22 20:41:18] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 217/263 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 124/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/264 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 180 constraints, problems are : Problem set: 0 solved, 217 unsolved in 26982 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 217/263 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 124/179 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 217/396 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/264 variables, and 401 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 124/125 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 57771ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 57772ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/60 places, 218/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58189 ms. Remains : 46/60 places, 218/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0)&&X(p1)) U X(!p2)))))'
Stuttering acceptance computed with spot in 165 ms :[p2, (AND (NOT p0) p2), p2, false]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-08
Product exploration explored 100000 steps with 39946 reset in 827 ms.
Product exploration explored 100000 steps with 40112 reset in 966 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge based reduction with 12 factoid took 81 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (2975 resets) in 518 ms. (77 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (240 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (244 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
[2026-05-22 20:42:18] [INFO ] Invariant cache hit.
[2026-05-22 20:42:18] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 27/264 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 5/8 constraints, State Equation: 0/46 constraints, ReadFeed: 0/125 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 14 factoid took 196 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[p2, p2]
Knowledge-based reduction took 745 ms.
Stuttering acceptance computed with spot in 106 ms :[p2, p2]
Support contains 4 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 218/218 transitions.
Applied a total of 0 rules in 14 ms. Remains 46 /46 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-22 20:42:18] [INFO ] Invariant cache hit.
[2026-05-22 20:42:18] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-22 20:42:18] [INFO ] Invariant cache hit.
[2026-05-22 20:42:18] [INFO ] State equation strengthened by 125 read => feed constraints.
[2026-05-22 20:42:19] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2026-05-22 20:42:19] [INFO ] Redundant transitions in 23 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 470 ms. Remains : 46/46 places, 218/218 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
RANDOM walk for 15004 steps (1084 resets) in 139 ms. (107 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p2, p2]
Knowledge-based reduction took 311 ms.
Stuttering acceptance computed with spot in 103 ms :[p2, p2]
Stuttering acceptance computed with spot in 102 ms :[p2, p2]
Product exploration explored 100000 steps with 33431 reset in 994 ms.
Product exploration explored 100000 steps with 33374 reset in 711 ms.
Built C files in :
/tmp/ltsmin2530387716194255541
[2026-05-22 20:42:21] [INFO ] Computing symmetric may disable matrix : 218 transitions.
[2026-05-22 20:42:21] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:42:21] [INFO ] Computing symmetric may enable matrix : 218 transitions.
[2026-05-22 20:42:21] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:42:21] [INFO ] Computing Do-Not-Accords matrix : 218 transitions.
[2026-05-22 20:42:21] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:42:21] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2530387716194255541
Running compilation step : cd /tmp/ltsmin2530387716194255541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1082 ms.
Running link step : cd /tmp/ltsmin2530387716194255541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2530387716194255541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11622963140769304561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 218/218 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 211
Applied a total of 2 rules in 20 ms. Remains 45 /46 variables (removed 1) and now considering 211/218 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16422100503280958929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5825948954169890751.kers'
[2026-05-22 20:42:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16422100503280958929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5825948954169890751.kers]
Normalized transition count is 210 out of 211 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 210 rows 44 cols 1663 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 20:42:36] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5825948954169890751.kers
Total runtime 3 ms.
[2026-05-22 20:42:36] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 20:42:36] [INFO ] Invariant cache hit.
[2026-05-22 20:42:36] [INFO ] State equation strengthened by 119 read => feed constraints.
[2026-05-22 20:42:36] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2026-05-22 20:42:36] [INFO ] Redundant transitions in 15 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-22 20:42:36] [INFO ] Invariant cache hit.
[2026-05-22 20:42:36] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/255 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 118/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 173 constraints, problems are : Problem set: 0 solved, 210 unsolved in 23979 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/255 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 118/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 210/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 255/256 variables, and 387 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 118/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 54296ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 54297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/46 places, 211/218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54682 ms. Remains : 45/46 places, 211/218 transitions.
Built C files in :
/tmp/ltsmin343219650828001662
[2026-05-22 20:43:31] [INFO ] Computing symmetric may disable matrix : 211 transitions.
[2026-05-22 20:43:31] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:43:31] [INFO ] Computing symmetric may enable matrix : 211 transitions.
[2026-05-22 20:43:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:43:31] [INFO ] Computing Do-Not-Accords matrix : 211 transitions.
[2026-05-22 20:43:31] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:43:31] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin343219650828001662
Running compilation step : cd /tmp/ltsmin343219650828001662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1056 ms.
Running link step : cd /tmp/ltsmin343219650828001662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin343219650828001662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4376263702820709786.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 20:43:46] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:43:46] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:43:46] [INFO ] Time to serialize gal into /tmp/LTL14466599413805186166.gal : 3 ms
[2026-05-22 20:43:46] [INFO ] Time to serialize properties into /tmp/LTL1270434909766395977.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14466599413805186166.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10993742470300048408.hoa' '-atoms' '/tmp/LTL1270434909766395977.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1270434909766395977.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10993742470300048408.hoa
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t9, t10, t13, t14, t15, t18, t20, t23, t25, t28, t30, t170, t171, t172, t173, t174, t...478
Computing Next relation with stutter on 10130 deadlock states
Detected timeout of ITS tools.
[2026-05-22 20:44:01] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:44:01] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:44:01] [INFO ] Time to serialize gal into /tmp/LTL10862820355591810516.gal : 4 ms
[2026-05-22 20:44:01] [INFO ] Time to serialize properties into /tmp/LTL2487401222855876885.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10862820355591810516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2487401222855876885.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((p1==1)&&(p9==1))&&((p22==1)&&(p57==1)))"))&&(X("(((p1==1)&&(p6==1))&&((p12==1)&&(p57==1)))")))U(X(!("(((p1==1)&&(p8==1)...187
Formula 0 simplified : GF((G!"(((p1==1)&&(p9==1))&&((p22==1)&&(p57==1)))" | X!"(((p1==1)&&(p6==1))&&((p12==1)&&(p57==1)))") R X"(((p1==1)&&(p8==1))&&((p35=...172
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t9, t10, t13, t14, t15, t18, t20, t23, t25, t28, t29, t30, t170, t172, t174, t176, t1...398
Computing Next relation with stutter on 10130 deadlock states
Detected timeout of ITS tools.
[2026-05-22 20:44:16] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:44:16] [INFO ] Applying decomposition
[2026-05-22 20:44:16] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6528980268898509026.txt' '-o' '/tmp/graph6528980268898509026.bin' '-w' '/tmp/graph6528980268898509026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6528980268898509026.bin' '-l' '-1' '-v' '-w' '/tmp/graph6528980268898509026.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:44:16] [INFO ] Decomposing Gal with order
[2026-05-22 20:44:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:44:16] [INFO ] Removed a total of 651 redundant transitions.
[2026-05-22 20:44:16] [INFO ] Flatten gal took : 31 ms
[2026-05-22 20:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 5 ms.
[2026-05-22 20:44:16] [INFO ] Time to serialize gal into /tmp/LTL18035859010496930051.gal : 1 ms
[2026-05-22 20:44:16] [INFO ] Time to serialize properties into /tmp/LTL5715295167425790901.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18035859010496930051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5715295167425790901.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("(((u13.p1==1)&&(u13.p9==1))&&((i2.u3.p22==1)&&(u13.p57==1)))"))&&(X("(((u13.p1==1)&&(u13.p6==1))&&((u0.p12==1)&&(u13.p57==...235
Formula 0 simplified : GF((G!"(((u13.p1==1)&&(u13.p9==1))&&((i2.u3.p22==1)&&(u13.p57==1)))" | X!"(((u13.p1==1)&&(u13.p6==1))&&((u0.p12==1)&&(u13.p57==1)))"...220
Reverse transition relation is NOT exact ! Due to transitions t174, t60_t3_t2, t108_t3_t2, t168_t165_t167_t240, u0.t29, u0.t30, u1.t28, u6.t14, u6.t15, u7....373
Computing Next relation with stutter on 10130 deadlock states
78 unique states visited
78 strongly connected components in search stack
79 transitions explored
78 items max in DFS search stack
35 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.361603,29928,1,0,26401,1466,715,32074,360,9980,54868
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-06a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-06a-LTLFireability-08 finished in 179280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(p0)))||G(p1)) U G(p2)))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 58 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 229
Applied a total of 4 rules in 2 ms. Remains 58 /60 variables (removed 2) and now considering 229/243 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17632636854078670894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8173582120065420984.kers'
[2026-05-22 20:44:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17632636854078670894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8173582120065420984.kers]
Normalized transition count is 228 out of 229 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 57 cols 1718 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-22 20:44:16] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8173582120065420984.kers
Total runtime 3 ms.
[2026-05-22 20:44:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-22 20:44:16] [INFO ] Invariant cache hit.
[2026-05-22 20:44:17] [INFO ] State equation strengthened by 123 read => feed constraints.
[2026-05-22 20:44:17] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2026-05-22 20:44:17] [INFO ] Invariant cache hit.
[2026-05-22 20:44:17] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/287 variables, and 192 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/419 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 1/287 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 425 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 229/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60825 ms. Remains : 58/60 places, 229/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(p0)))||G(p1)) U G(p2)))'
Stuttering acceptance computed with spot in 870 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 518 steps with 32 reset in 4 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-09 finished in 61756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(F(p1)&&X(F(p2)))))'
Support contains 13 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 215
Applied a total of 8 rules in 2 ms. Remains 56 /60 variables (removed 4) and now considering 215/243 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1636043680952744542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4745004893555362626.kers'
[2026-05-22 20:45:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1636043680952744542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4745004893555362626.kers]
Normalized transition count is 214 out of 215 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 214 rows 55 cols 1642 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-22 20:45:18] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4745004893555362626.kers
Total runtime 3 ms.
[2026-05-22 20:45:18] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 20:45:18] [INFO ] Invariant cache hit.
[2026-05-22 20:45:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-22 20:45:18] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2026-05-22 20:45:18] [INFO ] Invariant cache hit.
[2026-05-22 20:45:18] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 28230 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 397 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 58694ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 58695ms
Starting structural reductions in LTL mode, iteration 1 : 56/60 places, 215/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59022 ms. Remains : 56/60 places, 215/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(F(p1)&&X(F(p2)))))'
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-10
Product exploration explored 100000 steps with 173 reset in 124 ms.
Product exploration explored 100000 steps with 372 reset in 170 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 15 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2244 resets) in 338 ms. (117 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (224 resets) in 77 ms. (512 steps per ms) remains 1/3 properties
[2026-05-22 20:46:18] [INFO ] Invariant cache hit.
[2026-05-22 20:46:18] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 48/271 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/56 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 16 factoid took 168 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 627 ms.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 11 out of 56 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2026-05-22 20:46:19] [INFO ] Invariant cache hit.
[2026-05-22 20:46:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-22 20:46:19] [INFO ] Invariant cache hit.
[2026-05-22 20:46:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-22 20:46:19] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 56/56 places, 215/215 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 7 factoid took 63 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (2177 resets) in 290 ms. (137 steps per ms) remains 1/3 properties
BEST_FIRST walk for 32150 steps (179 resets) in 38 ms. (824 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 468 ms.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 156 reset in 124 ms.
Product exploration explored 100000 steps with 54 reset in 124 ms.
Spot run failed in 88 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14118638226811103639
[2026-05-22 20:46:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14118638226811103639
Running compilation step : cd /tmp/ltsmin14118638226811103639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1125 ms.
Running link step : cd /tmp/ltsmin14118638226811103639;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14118638226811103639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased541452140530086010.hoa' '--buchi-type=spotba'
LTSmin run took 580 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06a-LTLFireability-10 finished in 63514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(p0 U p1))||X(G(p0))||G(p2))))'
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 2 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7840282964707904891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8072249581840649744.kers'
[2026-05-22 20:46:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7840282964707904891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8072249581840649744.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 221 rows 56 cols 1680 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 20:46:22] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8072249581840649744.kers
Total runtime 2 ms.
[2026-05-22 20:46:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-22 20:46:22] [INFO ] Invariant cache hit.
[2026-05-22 20:46:22] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:46:22] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-22 20:46:22] [INFO ] Invariant cache hit.
[2026-05-22 20:46:22] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21750 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/405 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 411 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 52121ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 52122ms
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52458 ms. Remains : 57/60 places, 222/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(p0 U p1))||X(G(p0))||G(p2))))'
Stuttering acceptance computed with spot in 393 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 1079 ms.
Product exploration explored 100000 steps with 33333 reset in 1029 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 18 ms. Proved property starting from automaton with 8 states, 21 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06a-LTLFireability-12 finished in 55035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(p1))))))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 2 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12654234861496560116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14597282451490033.kers'
[2026-05-22 20:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12654234861496560116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14597282451490033.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 221 rows 56 cols 1680 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 20:47:17] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14597282451490033.kers
Total runtime 3 ms.
[2026-05-22 20:47:17] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-22 20:47:17] [INFO ] Invariant cache hit.
[2026-05-22 20:47:17] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:47:17] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 57/60 places, 222/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(p1))))))'
Stuttering acceptance computed with spot in 189 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 : AutonomousCar-PT-06a-LTLFireability-14
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-14 finished in 507 ms.
All properties solved by simple procedures.
Total runtime 832351 ms.

BK_STOP 1779482837722

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06a, 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 r018-smll-177946787900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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