Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r069-tall-171620503900148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CANInsertWithFailure-PT-070, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 30M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716402488188

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 18:28:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 18:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:28:10] [INFO ] Load time of PNML (sax parser for PT used): 742 ms
[2024-05-22 18:28:10] [INFO ] Transformed 10644 places.
[2024-05-22 18:28:10] [INFO ] Transformed 29820 transitions.
[2024-05-22 18:28:10] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 983 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 10644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10643 transition count 29820
Applied a total of 1 rules in 3047 ms. Remains 10643 /10644 variables (removed 1) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-22 18:28:19] [INFO ] Computed 72 invariants in 6045 ms
[2024-05-22 18:28:32] [INFO ] Implicit Places using invariants in 18474 ms returned []
Implicit Place search using SMT only with invariants took 18505 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 18:28:32] [INFO ] Invariant cache hit.
[2024-05-22 18:28:33] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 118224ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 118543ms
Starting structural reductions in LTL mode, iteration 1 : 10643/10644 places, 29820/29820 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140216 ms. Remains : 10643/10644 places, 29820/29820 transitions.
Support contains 35 out of 10643 places after structural reductions.
[2024-05-22 18:30:32] [INFO ] Flatten gal took : 946 ms
[2024-05-22 18:30:33] [INFO ] Flatten gal took : 935 ms
[2024-05-22 18:30:34] [INFO ] Input system was already deterministic with 29820 transitions.
RANDOM walk for 40000 steps (21 resets) in 3363 ms. (11 steps per ms) remains 9/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
[2024-05-22 18:30:36] [INFO ] Invariant cache hit.
[2024-05-22 18:30:36] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10493/10507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 18:30:38] [INFO ] Deduced a trap composed of 5 places in 466 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10507 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10507/40463 variables, and 5 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10493/10507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10507 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 18:30:42] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 3 ms to minimize.
[2024-05-22 18:30:43] [INFO ] Deduced a trap composed of 5 places in 349 ms of which 3 ms to minimize.
[2024-05-22 18:30:43] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 3 ms to minimize.
[2024-05-22 18:30:44] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 3 ms to minimize.
[2024-05-22 18:30:44] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 3 ms to minimize.
[2024-05-22 18:30:45] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 2 ms to minimize.
[2024-05-22 18:30:45] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 3 ms to minimize.
[2024-05-22 18:30:46] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10507/40463 variables, and 13 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 4/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 9/9 constraints]
After SMT, in 10240ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 487 rules applied. Total rules applied 487 place count 10643 transition count 29333
Reduce places removed 487 places and 0 transitions.
Iterating post reduction 1 with 487 rules applied. Total rules applied 974 place count 10156 transition count 29333
Performed 4824 Post agglomeration using F-continuation condition.Transition count delta: 4824
Deduced a syphon composed of 4824 places in 11 ms
Reduce places removed 4824 places and 0 transitions.
Iterating global reduction 2 with 9648 rules applied. Total rules applied 10622 place count 5332 transition count 24509
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10626 place count 5332 transition count 24505
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 10630 place count 5328 transition count 24505
Partial Free-agglomeration rule applied 4966 times.
Drop transitions (Partial Free agglomeration) removed 4966 transitions
Iterating global reduction 3 with 4966 rules applied. Total rules applied 15596 place count 5328 transition count 24505
Applied a total of 15596 rules in 9061 ms. Remains 5328 /10643 variables (removed 5315) and now considering 24505/29820 (removed 5315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9066 ms. Remains : 5328/10643 places, 24505/29820 transitions.
RANDOM walk for 40000 steps (92 resets) in 2248 ms. (17 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 3/3 properties
[2024-05-22 18:30:56] [INFO ] Flow matrix only has 24500 transitions (discarded 5 similar events)
// Phase 1: matrix 24500 rows 5328 cols
[2024-05-22 18:30:57] [INFO ] Computed 72 invariants in 1432 ms
[2024-05-22 18:30:57] [INFO ] State equation strengthened by 24268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5183/5188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 18:30:58] [INFO ] Deduced a trap composed of 2 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5188 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 136/5324 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5324 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/5326 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 18:31:10] [INFO ] Deduced a trap composed of 147 places in 10364 ms of which 42 ms to minimize.
[2024-05-22 18:31:21] [INFO ] Deduced a trap composed of 88 places in 10201 ms of which 36 ms to minimize.
[2024-05-22 18:31:31] [INFO ] Deduced a trap composed of 115 places in 9818 ms of which 34 ms to minimize.
[2024-05-22 18:31:40] [INFO ] Deduced a trap composed of 101 places in 9656 ms of which 37 ms to minimize.
[2024-05-22 18:31:50] [INFO ] Deduced a trap composed of 79 places in 9683 ms of which 36 ms to minimize.
SMT process timed out in 54499ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 5328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5328/5328 places, 24505/24505 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 5325 transition count 24502
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 5325 transition count 24502
Applied a total of 10 rules in 4066 ms. Remains 5325 /5328 variables (removed 3) and now considering 24502/24505 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4067 ms. Remains : 5325/5328 places, 24502/24505 transitions.
RANDOM walk for 40000 steps (93 resets) in 1957 ms. (20 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2024-05-22 18:31:55] [INFO ] Flow matrix only has 24501 transitions (discarded 1 similar events)
// Phase 1: matrix 24501 rows 5325 cols
[2024-05-22 18:31:56] [INFO ] Computed 72 invariants in 1297 ms
[2024-05-22 18:31:56] [INFO ] State equation strengthened by 24282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5181/5185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 18:31:57] [INFO ] Deduced a trap composed of 2 places in 145 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5185 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 136/5321 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5321 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/5323 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 18:32:09] [INFO ] Deduced a trap composed of 107 places in 10353 ms of which 37 ms to minimize.
[2024-05-22 18:32:19] [INFO ] Deduced a trap composed of 106 places in 10323 ms of which 36 ms to minimize.
[2024-05-22 18:32:29] [INFO ] Deduced a trap composed of 99 places in 9945 ms of which 35 ms to minimize.
[2024-05-22 18:32:39] [INFO ] Deduced a trap composed of 83 places in 9619 ms of which 35 ms to minimize.
[2024-05-22 18:32:48] [INFO ] Deduced a trap composed of 83 places in 8728 ms of which 32 ms to minimize.
[2024-05-22 18:32:57] [INFO ] Deduced a trap composed of 85 places in 9136 ms of which 32 ms to minimize.
[2024-05-22 18:33:06] [INFO ] Deduced a trap composed of 104 places in 8605 ms of which 29 ms to minimize.
[2024-05-22 18:33:15] [INFO ] Deduced a trap composed of 89 places in 9005 ms of which 33 ms to minimize.
SMT process timed out in 79836ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5324 transition count 24501
Applied a total of 2 rules in 2697 ms. Remains 5324 /5325 variables (removed 1) and now considering 24501/24502 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2697 ms. Remains : 5324/5325 places, 24501/24502 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X((p1&&X(p2))) U (p0&&X((p1&&X(p2)))))))))'
Support contains 1 out of 10643 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 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 11 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 4969 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-22 18:33:23] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2024-05-22 18:33:24] [INFO ] Computed 72 invariants in 1764 ms
[2024-05-22 18:33:32] [INFO ] Implicit Places using invariants in 9004 ms returned []
Implicit Place search using SMT only with invariants took 9007 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-22 18:33:32] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2024-05-22 18:33:32] [INFO ] Invariant cache hit.
[2024-05-22 18:33:32] [INFO ] State equation strengthened by 14627 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 82732ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 82949ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96989 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-00
Stuttering criterion allowed to conclude after 339 steps with 0 reset in 14 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-00 finished in 97257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&(p1 U (G(p1)||(p1&&(p2||(!p0 U (p3||G(!p0)))))))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2275 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-22 18:35:02] [INFO ] Computed 72 invariants in 4989 ms
[2024-05-22 18:35:16] [INFO ] Implicit Places using invariants in 18659 ms returned []
Implicit Place search using SMT only with invariants took 18661 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 18:35:16] [INFO ] Invariant cache hit.
[2024-05-22 18:35:17] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 130764ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 131214ms
Finished structural reductions in LTL mode , in 1 iterations and 152215 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-04
Entered a terminal (fully accepting) state of product in 33773 steps with 20 reset in 872 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-04 finished in 153277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F((F((p1||X(p1)))&&X(p0)))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2237 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-22 18:37:30] [INFO ] Invariant cache hit.
[2024-05-22 18:37:44] [INFO ] Implicit Places using invariants in 13796 ms returned []
Implicit Place search using SMT only with invariants took 13798 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 18:37:45] [INFO ] Invariant cache hit.
[2024-05-22 18:37:45] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 121979ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 122224ms
Finished structural reductions in LTL mode , in 1 iterations and 138316 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 3280 ms.
Product exploration explored 100000 steps with 33333 reset in 3089 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-070-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-05 finished in 145024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 8 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Applied a total of 10636 rules in 4826 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
[2024-05-22 18:39:58] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2024-05-22 18:40:00] [INFO ] Computed 72 invariants in 1619 ms
[2024-05-22 18:40:07] [INFO ] Implicit Places using invariants in 8781 ms returned []
Implicit Place search using SMT only with invariants took 8784 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-22 18:40:07] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-22 18:40:07] [INFO ] Invariant cache hit.
[2024-05-22 18:40:07] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 83384ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 83591ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/10643 places, 24502/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97238 ms. Remains : 5325/10643 places, 24502/29820 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-07
Product exploration explored 100000 steps with 282 reset in 2302 ms.
Product exploration explored 100000 steps with 283 reset in 2289 ms.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (112 resets) in 1104 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 55409 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 55409 steps, saw 39154 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-22 18:41:39] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-22 18:41:39] [INFO ] Invariant cache hit.
[2024-05-22 18:41:39] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5182/5185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:41:40] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 2 ms to minimize.
[2024-05-22 18:41:40] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-22 18:41:40] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-22 18:41:40] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 2 ms to minimize.
[2024-05-22 18:41:41] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 2 ms to minimize.
[2024-05-22 18:41:41] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-22 18:41:41] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-22 18:41:41] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-22 18:41:42] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-22 18:41:42] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 1 ms to minimize.
[2024-05-22 18:41:42] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 5 ms to minimize.
[2024-05-22 18:41:42] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-22 18:41:42] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2024-05-22 18:41:43] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 1 ms to minimize.
[2024-05-22 18:41:43] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 1 ms to minimize.
[2024-05-22 18:41:43] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 2 ms to minimize.
[2024-05-22 18:41:43] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 1 ms to minimize.
[2024-05-22 18:41:44] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2024-05-22 18:41:44] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
[2024-05-22 18:41:44] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
SMT process timed out in 5326ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5325 transition count 24500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4970 times.
Drop transitions (Partial Free agglomeration) removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4974 place count 5323 transition count 24500
Applied a total of 4974 rules in 3198 ms. Remains 5323 /5325 variables (removed 2) and now considering 24500/24502 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3198 ms. Remains : 5323/5325 places, 24500/24502 transitions.
RANDOM walk for 40000 steps (93 resets) in 1926 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 67265 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 67265 steps, saw 52230 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-22 18:41:51] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2024-05-22 18:41:52] [INFO ] Computed 72 invariants in 1145 ms
[2024-05-22 18:41:52] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:41:53] [INFO ] Deduced a trap composed of 2 places in 134 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5183 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 136/5319 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5319 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5321 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:42:03] [INFO ] Deduced a trap composed of 138 places in 9510 ms of which 36 ms to minimize.
[2024-05-22 18:42:12] [INFO ] Deduced a trap composed of 80 places in 9276 ms of which 33 ms to minimize.
[2024-05-22 18:42:21] [INFO ] Deduced a trap composed of 110 places in 8636 ms of which 29 ms to minimize.
[2024-05-22 18:42:31] [INFO ] Deduced a trap composed of 121 places in 9326 ms of which 30 ms to minimize.
[2024-05-22 18:42:39] [INFO ] Deduced a trap composed of 132 places in 8763 ms of which 30 ms to minimize.
SMT process timed out in 48588ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1334 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1334 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1302 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-22 18:42:42] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-22 18:42:42] [INFO ] Invariant cache hit.
[2024-05-22 18:42:53] [INFO ] Implicit Places using invariants in 10669 ms returned []
Implicit Place search using SMT only with invariants took 10670 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2024-05-22 18:42:53] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-22 18:42:53] [INFO ] Invariant cache hit.
[2024-05-22 18:42:53] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5322 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24430 unsolved
SMT process timed out in 98858ms, After SMT, problems are : Problem set: 0 solved, 24430 unsolved
Search for dead transitions found 0 dead transitions in 99053ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111062 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1028 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2024-05-22 18:44:33] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2024-05-22 18:44:35] [INFO ] Computed 72 invariants in 1627 ms
[2024-05-22 18:44:42] [INFO ] Implicit Places using invariants in 8679 ms returned []
Implicit Place search using SMT only with invariants took 8682 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-22 18:44:42] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-22 18:44:42] [INFO ] Invariant cache hit.
[2024-05-22 18:44:42] [INFO ] State equation strengthened by 14627 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 86116ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 86355ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 96101 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (111 resets) in 1322 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 55031 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 55031 steps, saw 39105 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-22 18:46:12] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-22 18:46:12] [INFO ] Invariant cache hit.
[2024-05-22 18:46:12] [INFO ] State equation strengthened by 14627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5182/5185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:46:13] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 2 ms to minimize.
[2024-05-22 18:46:13] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-22 18:46:13] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 2 ms to minimize.
[2024-05-22 18:46:14] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-22 18:46:14] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 2 ms to minimize.
[2024-05-22 18:46:14] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-22 18:46:14] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-22 18:46:14] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-22 18:46:15] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-22 18:46:15] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
[2024-05-22 18:46:15] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-22 18:46:15] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-22 18:46:16] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-22 18:46:16] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 2 ms to minimize.
[2024-05-22 18:46:16] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-22 18:46:16] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-22 18:46:17] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-22 18:46:17] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-22 18:46:17] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 0 ms to minimize.
SMT process timed out in 5184ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5325 transition count 24500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4970 times.
Drop transitions (Partial Free agglomeration) removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4974 place count 5323 transition count 24500
Applied a total of 4974 rules in 3514 ms. Remains 5323 /5325 variables (removed 2) and now considering 24500/24502 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3515 ms. Remains : 5323/5325 places, 24500/24502 transitions.
RANDOM walk for 40000 steps (93 resets) in 2075 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66685 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66685 steps, saw 52154 distinct states, run finished after 3006 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-22 18:46:24] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2024-05-22 18:46:25] [INFO ] Computed 72 invariants in 1251 ms
[2024-05-22 18:46:26] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:46:26] [INFO ] Deduced a trap composed of 2 places in 140 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5183 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 136/5319 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5319 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/5321 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:46:37] [INFO ] Deduced a trap composed of 138 places in 9419 ms of which 30 ms to minimize.
[2024-05-22 18:46:46] [INFO ] Deduced a trap composed of 80 places in 9434 ms of which 33 ms to minimize.
[2024-05-22 18:46:56] [INFO ] Deduced a trap composed of 110 places in 9416 ms of which 35 ms to minimize.
[2024-05-22 18:47:05] [INFO ] Deduced a trap composed of 121 places in 9410 ms of which 30 ms to minimize.
[2024-05-22 18:47:14] [INFO ] Deduced a trap composed of 132 places in 8752 ms of which 33 ms to minimize.
SMT process timed out in 49711ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 5323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1355 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1355 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1324 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2024-05-22 18:47:17] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-22 18:47:17] [INFO ] Invariant cache hit.
[2024-05-22 18:47:27] [INFO ] Implicit Places using invariants in 10610 ms returned []
Implicit Place search using SMT only with invariants took 10612 ms to find 0 implicit places.
Running 24430 sub problems to find dead transitions.
[2024-05-22 18:47:27] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
[2024-05-22 18:47:27] [INFO ] Invariant cache hit.
[2024-05-22 18:47:28] [INFO ] State equation strengthened by 24286 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5322 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24430 unsolved
SMT process timed out in 92313ms, After SMT, problems are : Problem set: 0 solved, 24430 unsolved
Search for dead transitions found 0 dead transitions in 92509ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104475 ms. Remains : 5323/5323 places, 24500/24500 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 282 reset in 2420 ms.
Product exploration explored 100000 steps with 282 reset in 2140 ms.
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 942 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2024-05-22 18:49:05] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2024-05-22 18:49:07] [INFO ] Computed 72 invariants in 1672 ms
[2024-05-22 18:49:14] [INFO ] Implicit Places using invariants in 8630 ms returned []
Implicit Place search using SMT only with invariants took 8631 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-22 18:49:14] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-22 18:49:14] [INFO ] Invariant cache hit.
[2024-05-22 18:49:14] [INFO ] State equation strengthened by 14627 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 82922ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 83118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92720 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-07 finished in 644939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||X(F(p1)))))))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1896 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-22 18:50:45] [INFO ] Computed 72 invariants in 5167 ms
[2024-05-22 18:50:59] [INFO ] Implicit Places using invariants in 18531 ms returned []
Implicit Place search using SMT only with invariants took 18532 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 18:50:59] [INFO ] Invariant cache hit.
[2024-05-22 18:50:59] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 115730ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 115965ms
Finished structural reductions in LTL mode , in 1 iterations and 136426 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-08
Product exploration explored 100000 steps with 14320 reset in 2463 ms.
Product exploration explored 100000 steps with 14277 reset in 2399 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 30146 steps (17 resets) in 627 ms. (48 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1904 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2024-05-22 18:53:03] [INFO ] Invariant cache hit.
[2024-05-22 18:53:16] [INFO ] Implicit Places using invariants in 13072 ms returned []
Implicit Place search using SMT only with invariants took 13072 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 18:53:16] [INFO ] Invariant cache hit.
[2024-05-22 18:53:16] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 119788ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 120024ms
Finished structural reductions in LTL mode , in 1 iterations and 135042 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 24880 steps (13 resets) in 514 ms. (48 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 14285 reset in 2493 ms.
Product exploration explored 100000 steps with 14281 reset in 2477 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 10643 transition count 29820
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 346 place count 10643 transition count 29820
Deduced a syphon composed of 420 places in 7 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 420 place count 10643 transition count 29820
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 560 place count 10503 transition count 29680
Deduced a syphon composed of 280 places in 8 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 700 place count 10503 transition count 29680
Performed 4896 Post agglomeration using F-continuation condition.Transition count delta: -9520
Deduced a syphon composed of 5176 places in 9 ms
Iterating global reduction 1 with 4896 rules applied. Total rules applied 5596 place count 10503 transition count 39200
Discarding 272 places :
Symmetric choice reduction at 1 with 272 rule applications. Total rules 5868 place count 10231 transition count 38928
Deduced a syphon composed of 4904 places in 7 ms
Iterating global reduction 1 with 272 rules applied. Total rules applied 6140 place count 10231 transition count 38928
Deduced a syphon composed of 4904 places in 8 ms
Applied a total of 6140 rules in 12386 ms. Remains 10231 /10643 variables (removed 412) and now considering 38928/29820 (removed -9108) transitions.
Running 38858 sub problems to find dead transitions.
[2024-05-22 18:55:36] [INFO ] Flow matrix only has 34236 transitions (discarded 4692 similar events)
// Phase 1: matrix 34236 rows 10231 cols
[2024-05-22 18:55:41] [INFO ] Computed 72 invariants in 5816 ms
[2024-05-22 18:55:42] [INFO ] State equation strengthened by 14626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10230 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 38858 unsolved
SMT process timed out in 183263ms, After SMT, problems are : Problem set: 0 solved, 38858 unsolved
Search for dead transitions found 0 dead transitions in 183563ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10231/10643 places, 38928/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196001 ms. Remains : 10231/10643 places, 38928/29820 transitions.
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1892 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-22 18:58:46] [INFO ] Computed 72 invariants in 4877 ms
[2024-05-22 18:58:59] [INFO ] Implicit Places using invariants in 18160 ms returned []
Implicit Place search using SMT only with invariants took 18161 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 18:58:59] [INFO ] Invariant cache hit.
[2024-05-22 18:58:59] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 118816ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 119052ms
Finished structural reductions in LTL mode , in 1 iterations and 139141 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-08 finished in 620517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 8 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 4664 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-22 19:01:03] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
// Phase 1: matrix 19809 rows 5324 cols
[2024-05-22 19:01:05] [INFO ] Computed 72 invariants in 1589 ms
[2024-05-22 19:01:12] [INFO ] Implicit Places using invariants in 8527 ms returned []
Implicit Place search using SMT only with invariants took 8527 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-22 19:01:12] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-22 19:01:12] [INFO ] Invariant cache hit.
[2024-05-22 19:01:12] [INFO ] State equation strengthened by 14628 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 82603ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 82794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96014 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-09
Product exploration explored 100000 steps with 283 reset in 2218 ms.
Product exploration explored 100000 steps with 283 reset in 2562 ms.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 33046 steps (92 resets) in 811 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 972 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-22 19:02:41] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-22 19:02:41] [INFO ] Invariant cache hit.
[2024-05-22 19:02:48] [INFO ] Implicit Places using invariants in 7218 ms returned []
Implicit Place search using SMT only with invariants took 7219 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-22 19:02:49] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-22 19:02:49] [INFO ] Invariant cache hit.
[2024-05-22 19:02:49] [INFO ] State equation strengthened by 14628 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 82164ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 82355ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 90576 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 16043 steps (43 resets) in 707 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 281 reset in 2121 ms.
Product exploration explored 100000 steps with 285 reset in 2283 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 992 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2024-05-22 19:04:17] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-22 19:04:17] [INFO ] Invariant cache hit.
[2024-05-22 19:04:24] [INFO ] Implicit Places using invariants in 6965 ms returned []
Implicit Place search using SMT only with invariants took 6966 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-22 19:04:24] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-22 19:04:24] [INFO ] Invariant cache hit.
[2024-05-22 19:04:24] [INFO ] State equation strengthened by 14628 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 81749ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 81942ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 89929 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-09 finished in 287796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 8 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Applied a total of 10636 rules in 4594 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
[2024-05-22 19:05:51] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2024-05-22 19:05:53] [INFO ] Computed 72 invariants in 1633 ms
[2024-05-22 19:06:00] [INFO ] Implicit Places using invariants in 8641 ms returned []
Implicit Place search using SMT only with invariants took 8642 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-22 19:06:00] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
[2024-05-22 19:06:00] [INFO ] Invariant cache hit.
[2024-05-22 19:06:00] [INFO ] State equation strengthened by 14627 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 1.0)
(s393 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 81419ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 81613ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/10643 places, 24502/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94881 ms. Remains : 5325/10643 places, 24502/29820 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-11
Stuttering criterion allowed to conclude after 366 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-11 finished in 95030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 10 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 4577 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2024-05-22 19:07:26] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
// Phase 1: matrix 19809 rows 5324 cols
[2024-05-22 19:07:28] [INFO ] Computed 72 invariants in 1473 ms
[2024-05-22 19:07:35] [INFO ] Implicit Places using invariants in 8475 ms returned []
Implicit Place search using SMT only with invariants took 8477 ms to find 0 implicit places.
Running 24431 sub problems to find dead transitions.
[2024-05-22 19:07:35] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2024-05-22 19:07:35] [INFO ] Invariant cache hit.
[2024-05-22 19:07:35] [INFO ] State equation strengthened by 14628 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 1.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5323 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24431 unsolved
SMT process timed out in 85300ms, After SMT, problems are : Problem set: 0 solved, 24431 unsolved
Search for dead transitions found 0 dead transitions in 85498ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98585 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-12
Stuttering criterion allowed to conclude after 375 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-12 finished in 98693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(!p0 U (G(!p0)||(G(!p2)&&X(p3)&&p1)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1820 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-22 19:09:07] [INFO ] Computed 72 invariants in 4894 ms
[2024-05-22 19:09:20] [INFO ] Implicit Places using invariants in 18207 ms returned []
Implicit Place search using SMT only with invariants took 18223 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 19:09:21] [INFO ] Invariant cache hit.
[2024-05-22 19:09:21] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 123120ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 123402ms
Finished structural reductions in LTL mode , in 1 iterations and 143491 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 378 ms :[true, false, p2, (OR (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND p0 p2), (AND p2 (NOT p0)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)) (AND p0 p2)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-13
Product exploration explored 100000 steps with 59 reset in 1831 ms.
Product exploration explored 100000 steps with 58 reset in 1835 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2)))), (X (AND (NOT p0) (NOT p2) p3)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (OR p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p2) p3))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 125 ms. Reduced automaton from 10 states, 33 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, (OR (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)) (AND p0 p2))]
Reduction of identical properties reduced properties to check from 20 to 18
RANDOM walk for 40000 steps (21 resets) in 1191 ms. (33 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
[2024-05-22 19:11:29] [INFO ] Invariant cache hit.
[2024-05-22 19:11:29] [INFO ] State equation strengthened by 9730 read => feed constraints.
Problem apf8 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10498/10503 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-22 19:11:31] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10503 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10503 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 136/10639 variables, 68/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10639 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/10641 variables, 2/73 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10641/40463 variables, and 73 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10499/10503 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10503 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-22 19:11:36] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 4 ms to minimize.
[2024-05-22 19:11:36] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 2 ms to minimize.
[2024-05-22 19:11:37] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 3 ms to minimize.
[2024-05-22 19:11:37] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 2 ms to minimize.
[2024-05-22 19:11:37] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 2 ms to minimize.
[2024-05-22 19:11:38] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 3 ms to minimize.
[2024-05-22 19:11:38] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 2 ms to minimize.
[2024-05-22 19:11:39] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 2 ms to minimize.
[2024-05-22 19:11:39] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 2 ms to minimize.
[2024-05-22 19:11:39] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10503/40463 variables, and 13 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/70 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10643 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 11/11 constraints]
After SMT, in 10174ms problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 10155 transition count 29331
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 8 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 2 with 9654 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10634 place count 5327 transition count 24502
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Partial Free-agglomeration rule applied 4972 times.
Drop transitions (Partial Free agglomeration) removed 4972 transitions
Iterating global reduction 3 with 4972 rules applied. Total rules applied 15608 place count 5325 transition count 24502
Partial Free-agglomeration rule applied 70 times.
Drop transitions (Partial Free agglomeration) removed 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 15678 place count 5325 transition count 24502
Applied a total of 15678 rules in 9448 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9450 ms. Remains : 5325/10643 places, 24502/29820 transitions.
RANDOM walk for 40000 steps (93 resets) in 3154 ms. (12 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
// Phase 1: matrix 24502 rows 5325 cols
[2024-05-22 19:11:51] [INFO ] Computed 72 invariants in 1178 ms
[2024-05-22 19:11:51] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 19:11:52] [INFO ] Deduced a trap composed of 2 places in 126 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5184 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 138/5322 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5322 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 19:12:02] [INFO ] Deduced a trap composed of 122 places in 9654 ms of which 35 ms to minimize.
[2024-05-22 19:12:11] [INFO ] Deduced a trap composed of 76 places in 8967 ms of which 31 ms to minimize.
[2024-05-22 19:12:20] [INFO ] Deduced a trap composed of 76 places in 8546 ms of which 33 ms to minimize.
[2024-05-22 19:12:29] [INFO ] Deduced a trap composed of 103 places in 9278 ms of which 35 ms to minimize.
[2024-05-22 19:12:38] [INFO ] Deduced a trap composed of 76 places in 8961 ms of which 30 ms to minimize.
SMT process timed out in 48537ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1187 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1187 ms. Remains : 5325/5325 places, 24502/24502 transitions.
RANDOM walk for 40000 steps (95 resets) in 2002 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 64247 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 64247 steps, saw 51994 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-22 19:12:43] [INFO ] Invariant cache hit.
[2024-05-22 19:12:44] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 19:12:44] [INFO ] Deduced a trap composed of 2 places in 136 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5184 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 138/5322 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5322 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 19:12:55] [INFO ] Deduced a trap composed of 122 places in 10282 ms of which 34 ms to minimize.
[2024-05-22 19:13:06] [INFO ] Deduced a trap composed of 113 places in 10201 ms of which 36 ms to minimize.
[2024-05-22 19:13:16] [INFO ] Deduced a trap composed of 133 places in 10014 ms of which 35 ms to minimize.
[2024-05-22 19:13:31] [INFO ] Deduced a trap composed of 76 places in 14999 ms of which 36 ms to minimize.
[2024-05-22 19:13:41] [INFO ] Deduced a trap composed of 136 places in 9702 ms of which 35 ms to minimize.
[2024-05-22 19:13:50] [INFO ] Deduced a trap composed of 109 places in 9567 ms of which 34 ms to minimize.
[2024-05-22 19:13:59] [INFO ] Deduced a trap composed of 84 places in 9169 ms of which 32 ms to minimize.
SMT process timed out in 76097ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1174 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1176 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1168 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2024-05-22 19:14:02] [INFO ] Invariant cache hit.
[2024-05-22 19:14:12] [INFO ] Implicit Places using invariants in 10537 ms returned []
Implicit Place search using SMT only with invariants took 10544 ms to find 0 implicit places.
Running 24432 sub problems to find dead transitions.
[2024-05-22 19:14:13] [INFO ] Invariant cache hit.
[2024-05-22 19:14:13] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5324 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24432 unsolved
SMT process timed out in 94588ms, After SMT, problems are : Problem set: 0 solved, 24432 unsolved
Search for dead transitions found 0 dead transitions in 94834ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106595 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2)))), (X (AND (NOT p0) (NOT p2) p3)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (OR p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p2) p3))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (G (OR (NOT p0) (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) p3 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (OR p0 p1) (OR p0 (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p3) p2))), (F (NOT (OR p0 (NOT p1) p3 p2))), (F (NOT (AND (OR p0 p1 p3) (OR p0 (NOT p2))))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND p3 (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT p1)), (F (NOT (AND (NOT p0) p3 (NOT p2)))), (F p0), (F (NOT (AND p3 (NOT p2)))), (F (NOT p3)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 39 factoid took 652 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, p2, (AND p0 p2)]
Stuttering acceptance computed with spot in 222 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, p2, (AND p0 p2)]
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1870 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-22 19:15:55] [INFO ] Computed 72 invariants in 4674 ms
[2024-05-22 19:16:08] [INFO ] Implicit Places using invariants in 17920 ms returned []
Implicit Place search using SMT only with invariants took 17920 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 19:16:09] [INFO ] Invariant cache hit.
[2024-05-22 19:16:09] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 116772ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 117183ms
Finished structural reductions in LTL mode , in 1 iterations and 137011 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 110 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, (AND p0 p2)]
RANDOM walk for 40000 steps (21 resets) in 4547 ms. (8 steps per ms) remains 5/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
[2024-05-22 19:18:07] [INFO ] Invariant cache hit.
[2024-05-22 19:18:07] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10499/10503 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 19:18:09] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 3 ms to minimize.
[2024-05-22 19:18:09] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 3 ms to minimize.
[2024-05-22 19:18:10] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 2 ms to minimize.
[2024-05-22 19:18:10] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 2 ms to minimize.
[2024-05-22 19:18:11] [INFO ] Deduced a trap composed of 5 places in 524 ms of which 2 ms to minimize.
[2024-05-22 19:18:11] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 2 ms to minimize.
[2024-05-22 19:18:12] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 2 ms to minimize.
[2024-05-22 19:18:12] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 2 ms to minimize.
[2024-05-22 19:18:13] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 2 ms to minimize.
SMT process timed out in 5364ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 10155 transition count 29331
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 9 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 2 with 9654 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10634 place count 5327 transition count 24502
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Partial Free-agglomeration rule applied 4972 times.
Drop transitions (Partial Free agglomeration) removed 4972 transitions
Iterating global reduction 3 with 4972 rules applied. Total rules applied 15608 place count 5325 transition count 24502
Partial Free-agglomeration rule applied 70 times.
Drop transitions (Partial Free agglomeration) removed 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 15678 place count 5325 transition count 24502
Applied a total of 15678 rules in 9511 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9511 ms. Remains : 5325/10643 places, 24502/29820 transitions.
RANDOM walk for 40000 steps (94 resets) in 2910 ms. (13 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
// Phase 1: matrix 24502 rows 5325 cols
[2024-05-22 19:18:24] [INFO ] Computed 72 invariants in 1180 ms
[2024-05-22 19:18:24] [INFO ] State equation strengthened by 24286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 19:18:25] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5184 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 138/5322 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5322 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 19:18:35] [INFO ] Deduced a trap composed of 76 places in 9562 ms of which 35 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/5322 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5322 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/5323 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5323 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24502/29825 variables, 5323/5397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/29825 variables, 24286/29683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/29825 variables, 0/29683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/29827 variables, 2/29685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/29827 variables, 0/29685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/29827 variables, 0/29685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29827/29827 variables, and 29685 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28523 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5325/5325 constraints, ReadFeed: 24286/24286 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5180/5184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5184 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 19:18:54] [INFO ] Deduced a trap composed of 2 places in 139 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 138/5322 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5322 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5322 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 19:19:04] [INFO ] Deduced a trap composed of 118 places in 9617 ms of which 33 ms to minimize.
[2024-05-22 19:19:13] [INFO ] Deduced a trap composed of 83 places in 9030 ms of which 29 ms to minimize.
[2024-05-22 19:19:21] [INFO ] Deduced a trap composed of 80 places in 8357 ms of which 31 ms to minimize.
[2024-05-22 19:19:30] [INFO ] Deduced a trap composed of 76 places in 8399 ms of which 33 ms to minimize.
[2024-05-22 19:19:38] [INFO ] Deduced a trap composed of 77 places in 7684 ms of which 29 ms to minimize.
[2024-05-22 19:19:46] [INFO ] Deduced a trap composed of 76 places in 7833 ms of which 32 ms to minimize.
SMT process timed out in 82557ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 5325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1191 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1191 ms. Remains : 5325/5325 places, 24502/24502 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p3) p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (OR p0 p1 p3) (OR p0 (NOT p2))))), (F (NOT p1)), (F p0), (F p2), (F (NOT (AND (NOT p0) p3 (NOT p2)))), (F (NOT p3)), (F (NOT (AND (OR p0 p1) (OR p0 (NOT p2))))), (F (NOT (OR p0 (NOT p1) p3 p2)))]
Knowledge based reduction with 25 factoid took 521 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 233 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 205 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, (AND p0 p2)]
Product exploration explored 100000 steps with 57 reset in 1628 ms.
Product exploration explored 100000 steps with 58 reset in 1683 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 215 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, (AND p0 p2)]
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Performed 348 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 10643 transition count 29820
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 348 place count 10643 transition count 29820
Deduced a syphon composed of 420 places in 7 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 420 place count 10643 transition count 29820
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 560 place count 10503 transition count 29680
Deduced a syphon composed of 280 places in 7 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 700 place count 10503 transition count 29680
Performed 4895 Post agglomeration using F-continuation condition.Transition count delta: -9514
Deduced a syphon composed of 5175 places in 8 ms
Iterating global reduction 1 with 4895 rules applied. Total rules applied 5595 place count 10503 transition count 39194
Discarding 276 places :
Symmetric choice reduction at 1 with 276 rule applications. Total rules 5871 place count 10227 transition count 38918
Deduced a syphon composed of 4899 places in 6 ms
Iterating global reduction 1 with 276 rules applied. Total rules applied 6147 place count 10227 transition count 38918
Deduced a syphon composed of 4899 places in 6 ms
Applied a total of 6147 rules in 10494 ms. Remains 10227 /10643 variables (removed 416) and now considering 38918/29820 (removed -9098) transitions.
Running 38848 sub problems to find dead transitions.
[2024-05-22 19:20:02] [INFO ] Flow matrix only has 34229 transitions (discarded 4689 similar events)
// Phase 1: matrix 34229 rows 10227 cols
[2024-05-22 19:20:08] [INFO ] Computed 72 invariants in 5402 ms
[2024-05-22 19:20:08] [INFO ] State equation strengthened by 14624 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10226 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 38848 unsolved
SMT process timed out in 178131ms, After SMT, problems are : Problem set: 0 solved, 38848 unsolved
Search for dead transitions found 0 dead transitions in 178438ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10227/10643 places, 38918/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188973 ms. Remains : 10227/10643 places, 38918/29820 transitions.
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2026 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2024-05-22 19:23:08] [INFO ] Computed 72 invariants in 4845 ms
[2024-05-22 19:23:21] [INFO ] Implicit Places using invariants in 18303 ms returned []
Implicit Place search using SMT only with invariants took 18304 ms to find 0 implicit places.
Running 29750 sub problems to find dead transitions.
[2024-05-22 19:23:21] [INFO ] Invariant cache hit.
[2024-05-22 19:23:21] [INFO ] State equation strengthened by 9730 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10642 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 29750 unsolved
SMT process timed out in 119779ms, After SMT, problems are : Problem set: 0 solved, 29750 unsolved
Search for dead transitions found 0 dead transitions in 120056ms
Finished structural reductions in LTL mode , in 1 iterations and 140420 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-13 finished in 981447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 10155 transition count 29331
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 11 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Applied a total of 10634 rules in 5894 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
[2024-05-22 19:25:28] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
// Phase 1: matrix 19812 rows 5326 cols
[2024-05-22 19:25:29] [INFO ] Computed 72 invariants in 1586 ms
[2024-05-22 19:25:36] [INFO ] Implicit Places using invariants in 8915 ms returned []
Implicit Place search using SMT only with invariants took 8916 ms to find 0 implicit places.
Running 24433 sub problems to find dead transitions.
[2024-05-22 19:25:37] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
[2024-05-22 19:25:37] [INFO ] Invariant cache hit.
[2024-05-22 19:25:37] [INFO ] State equation strengthened by 14626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5325 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24433 unsolved
SMT process timed out in 84923ms, After SMT, problems are : Problem set: 0 solved, 24433 unsolved
Search for dead transitions found 0 dead transitions in 85114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5326/10643 places, 24503/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99955 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-15
Product exploration explored 100000 steps with 283 reset in 2820 ms.
Stack based approach found an accepted trace after 40250 steps with 114 reset with depth 337 and stack size 334 in 1093 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-15 finished in 104064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||X(F(p1)))))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-070-LTLFireability-08
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 486 rules applied. Total rules applied 486 place count 10643 transition count 29334
Reduce places removed 486 places and 0 transitions.
Iterating post reduction 1 with 486 rules applied. Total rules applied 972 place count 10157 transition count 29334
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 972 place count 10157 transition count 29332
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 10 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Applied a total of 10632 rules in 5810 ms. Remains 5327 /10643 variables (removed 5316) and now considering 24504/29820 (removed 5316) transitions.
[2024-05-22 19:27:12] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
// Phase 1: matrix 19812 rows 5327 cols
[2024-05-22 19:27:14] [INFO ] Computed 72 invariants in 1752 ms
[2024-05-22 19:27:21] [INFO ] Implicit Places using invariants in 8879 ms returned []
Implicit Place search using SMT only with invariants took 8882 ms to find 0 implicit places.
Running 24434 sub problems to find dead transitions.
[2024-05-22 19:27:21] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2024-05-22 19:27:21] [INFO ] Invariant cache hit.
[2024-05-22 19:27:21] [INFO ] State equation strengthened by 14626 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="CANInsertWithFailure-PT-070"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CANInsertWithFailure-PT-070, 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 r069-tall-171620503900148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-070.tgz
mv CANInsertWithFailure-PT-070 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;