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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717017283318

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 21:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 21:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:14:45] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-05-29 21:14:45] [INFO ] Transformed 5003 places.
[2024-05-29 21:14:45] [INFO ] Transformed 5003 transitions.
[2024-05-29 21:14:45] [INFO ] Found NUPN structural information;
[2024-05-29 21:14:45] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVt-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1093 places :
Symmetric choice reduction at 0 with 1093 rule applications. Total rules 1093 place count 3910 transition count 3910
Iterating global reduction 0 with 1093 rules applied. Total rules applied 2186 place count 3910 transition count 3910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2187 place count 3909 transition count 3909
Iterating global reduction 0 with 1 rules applied. Total rules applied 2188 place count 3909 transition count 3909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2189 place count 3908 transition count 3908
Iterating global reduction 0 with 1 rules applied. Total rules applied 2190 place count 3908 transition count 3908
Applied a total of 2190 rules in 2085 ms. Remains 3908 /5003 variables (removed 1095) and now considering 3908/5003 (removed 1095) transitions.
// Phase 1: matrix 3908 rows 3908 cols
[2024-05-29 21:14:48] [INFO ] Computed 401 invariants in 49 ms
[2024-05-29 21:14:50] [INFO ] Implicit Places using invariants in 1616 ms returned []
[2024-05-29 21:14:50] [INFO ] Invariant cache hit.
[2024-05-29 21:14:51] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
[2024-05-29 21:14:51] [INFO ] Invariant cache hit.
[2024-05-29 21:14:53] [INFO ] Dead Transitions using invariants and state equation in 2695 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3908/5003 places, 3908/5003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7537 ms. Remains : 3908/5003 places, 3908/5003 transitions.
Support contains 29 out of 3908 places after structural reductions.
[2024-05-29 21:14:54] [INFO ] Flatten gal took : 251 ms
[2024-05-29 21:14:54] [INFO ] Flatten gal took : 158 ms
[2024-05-29 21:14:54] [INFO ] Input system was already deterministic with 3908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 23) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-29 21:14:55] [INFO ] Invariant cache hit.
[2024-05-29 21:14:56] [INFO ] After 1416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 21:14:58] [INFO ] [Nat]Absence check using 401 positive place invariants in 279 ms returned sat
[2024-05-29 21:15:05] [INFO ] After 5774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 21:15:06] [INFO ] Deduced a trap composed of 30 places in 1109 ms of which 9 ms to minimize.
[2024-05-29 21:15:07] [INFO ] Deduced a trap composed of 22 places in 961 ms of which 3 ms to minimize.
[2024-05-29 21:15:08] [INFO ] Deduced a trap composed of 47 places in 1015 ms of which 2 ms to minimize.
[2024-05-29 21:15:09] [INFO ] Deduced a trap composed of 22 places in 1033 ms of which 2 ms to minimize.
[2024-05-29 21:15:10] [INFO ] Deduced a trap composed of 24 places in 964 ms of which 2 ms to minimize.
[2024-05-29 21:15:11] [INFO ] Deduced a trap composed of 35 places in 968 ms of which 2 ms to minimize.
[2024-05-29 21:15:13] [INFO ] Deduced a trap composed of 23 places in 937 ms of which 2 ms to minimize.
[2024-05-29 21:15:14] [INFO ] Deduced a trap composed of 26 places in 947 ms of which 2 ms to minimize.
[2024-05-29 21:15:15] [INFO ] Deduced a trap composed of 48 places in 982 ms of which 2 ms to minimize.
[2024-05-29 21:15:16] [INFO ] Deduced a trap composed of 58 places in 938 ms of which 2 ms to minimize.
[2024-05-29 21:15:17] [INFO ] Deduced a trap composed of 53 places in 928 ms of which 2 ms to minimize.
[2024-05-29 21:15:18] [INFO ] Deduced a trap composed of 54 places in 944 ms of which 2 ms to minimize.
[2024-05-29 21:15:19] [INFO ] Deduced a trap composed of 22 places in 874 ms of which 2 ms to minimize.
[2024-05-29 21:15:20] [INFO ] Deduced a trap composed of 52 places in 847 ms of which 2 ms to minimize.
[2024-05-29 21:15:21] [INFO ] Deduced a trap composed of 42 places in 847 ms of which 2 ms to minimize.
[2024-05-29 21:15:22] [INFO ] Deduced a trap composed of 61 places in 826 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 21:15:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 21:15:22] [INFO ] After 25293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2348 ms.
Support contains 19 out of 3908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Drop transitions removed 1084 transitions
Trivial Post-agglo rules discarded 1084 transitions
Performed 1084 trivial Post agglomeration. Transition count delta: 1084
Iterating post reduction 0 with 1084 rules applied. Total rules applied 1084 place count 3908 transition count 2824
Reduce places removed 1084 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1089 rules applied. Total rules applied 2173 place count 2824 transition count 2819
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2178 place count 2819 transition count 2819
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 790 Pre rules applied. Total rules applied 2178 place count 2819 transition count 2029
Deduced a syphon composed of 790 places in 6 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 3 with 1580 rules applied. Total rules applied 3758 place count 2029 transition count 2029
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3759 place count 2028 transition count 2028
Iterating global reduction 3 with 1 rules applied. Total rules applied 3760 place count 2028 transition count 2028
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3760 place count 2028 transition count 2027
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3762 place count 2027 transition count 2027
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 2 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 5572 place count 1122 transition count 1122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5573 place count 1122 transition count 1121
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5575 place count 1121 transition count 1120
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5777 place count 1020 transition count 1217
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5979 place count 919 transition count 1317
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 6159 place count 829 transition count 1402
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6160 place count 829 transition count 1401
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6161 place count 829 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6162 place count 828 transition count 1400
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6163 place count 828 transition count 1399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6164 place count 827 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6165 place count 826 transition count 1398
Applied a total of 6165 rules in 934 ms. Remains 826 /3908 variables (removed 3082) and now considering 1398/3908 (removed 2510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 826/3908 places, 1398/3908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 91824 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91824 steps, saw 59553 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1398 rows 826 cols
[2024-05-29 21:15:30] [INFO ] Computed 400 invariants in 9 ms
[2024-05-29 21:15:30] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 21:15:30] [INFO ] [Nat]Absence check using 400 positive place invariants in 66 ms returned sat
[2024-05-29 21:15:32] [INFO ] After 1033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 21:15:32] [INFO ] After 1962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 538 ms.
[2024-05-29 21:15:33] [INFO ] After 3031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 688 ms.
Support contains 12 out of 826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 826/826 places, 1398/1398 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 826 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 825 transition count 1397
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 825 transition count 1393
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 821 transition count 1393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 820 transition count 1392
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 817 transition count 1396
Applied a total of 18 rules in 103 ms. Remains 817 /826 variables (removed 9) and now considering 1396/1398 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 817/826 places, 1396/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 97705 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{7=1}
Probabilistic random walk after 97705 steps, saw 59911 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :1
Running SMT prover for 10 properties.
// Phase 1: matrix 1396 rows 817 cols
[2024-05-29 21:15:38] [INFO ] Computed 400 invariants in 6 ms
[2024-05-29 21:15:38] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 21:15:39] [INFO ] [Nat]Absence check using 400 positive place invariants in 65 ms returned sat
[2024-05-29 21:15:40] [INFO ] After 863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 21:15:40] [INFO ] After 1558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 397 ms.
[2024-05-29 21:15:41] [INFO ] After 2363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 716 ms.
Support contains 11 out of 817 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 817/817 places, 1396/1396 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 816 transition count 1396
Applied a total of 2 rules in 50 ms. Remains 816 /817 variables (removed 1) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 816/817 places, 1396/1396 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 105449 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105449 steps, saw 65171 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1396 rows 816 cols
[2024-05-29 21:15:46] [INFO ] Computed 400 invariants in 5 ms
[2024-05-29 21:15:46] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 21:15:46] [INFO ] [Nat]Absence check using 400 positive place invariants in 62 ms returned sat
[2024-05-29 21:15:47] [INFO ] After 892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 21:15:48] [INFO ] After 1581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 399 ms.
[2024-05-29 21:15:48] [INFO ] After 2385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 805 ms.
Support contains 8 out of 816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 1396/1396 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 816 transition count 1393
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 813 transition count 1393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 812 transition count 1392
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 810 transition count 1396
Applied a total of 12 rules in 71 ms. Remains 810 /816 variables (removed 6) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 810/816 places, 1396/1396 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 104310 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104310 steps, saw 64507 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1396 rows 810 cols
[2024-05-29 21:15:53] [INFO ] Computed 400 invariants in 4 ms
[2024-05-29 21:15:53] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 21:15:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 67 ms returned sat
[2024-05-29 21:15:54] [INFO ] After 790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 21:15:55] [INFO ] After 1385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 328 ms.
[2024-05-29 21:15:55] [INFO ] After 2084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 862 ms.
Support contains 8 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 1396/1396 transitions.
Applied a total of 0 rules in 28 ms. Remains 810 /810 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 810/810 places, 1396/1396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 1396/1396 transitions.
Applied a total of 0 rules in 28 ms. Remains 810 /810 variables (removed 0) and now considering 1396/1396 (removed 0) transitions.
[2024-05-29 21:15:56] [INFO ] Invariant cache hit.
[2024-05-29 21:15:57] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-29 21:15:57] [INFO ] Invariant cache hit.
[2024-05-29 21:15:58] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
[2024-05-29 21:15:58] [INFO ] Redundant transitions in 87 ms returned []
[2024-05-29 21:15:58] [INFO ] Invariant cache hit.
[2024-05-29 21:15:59] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2602 ms. Remains : 810/810 places, 1396/1396 transitions.
Graph (trivial) has 391 edges and 810 vertex of which 4 / 810 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2797 edges and 808 vertex of which 806 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 388 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 802 transition count 1387
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 387 edges and 800 vertex of which 6 / 800 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 797 transition count 1378
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 385 edges and 794 vertex of which 8 / 794 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 790 transition count 1367
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 786 vertex of which 8 / 786 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 782 transition count 1353
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 778 vertex of which 8 / 778 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 774 transition count 1339
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 770 vertex of which 8 / 770 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 766 transition count 1325
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 762 vertex of which 8 / 762 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 758 transition count 1311
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 754 vertex of which 8 / 754 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 750 transition count 1297
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 746 vertex of which 8 / 746 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 742 transition count 1283
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 738 vertex of which 8 / 738 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 734 transition count 1269
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 730 vertex of which 8 / 730 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 726 transition count 1255
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 722 vertex of which 8 / 722 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 718 transition count 1241
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 714 vertex of which 8 / 714 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 710 transition count 1227
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 706 vertex of which 8 / 706 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 702 transition count 1213
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 698 vertex of which 8 / 698 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 694 transition count 1199
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 690 vertex of which 8 / 690 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 686 transition count 1185
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 682 vertex of which 8 / 682 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 678 transition count 1171
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 674 vertex of which 8 / 674 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 670 transition count 1157
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 666 vertex of which 8 / 666 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 662 transition count 1143
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 658 vertex of which 8 / 658 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 654 transition count 1129
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 650 vertex of which 8 / 650 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 646 transition count 1115
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 642 vertex of which 8 / 642 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 638 transition count 1101
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 634 vertex of which 8 / 634 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 630 transition count 1087
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 626 vertex of which 8 / 626 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 622 transition count 1073
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 618 vertex of which 8 / 618 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 614 transition count 1059
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 610 vertex of which 8 / 610 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 606 transition count 1045
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 602 vertex of which 8 / 602 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 598 transition count 1031
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 594 vertex of which 8 / 594 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 590 transition count 1017
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 281 edges and 586 vertex of which 8 / 586 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 582 transition count 1003
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 277 edges and 578 vertex of which 6 / 578 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 575 transition count 989
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 274 edges and 572 vertex of which 4 / 572 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 30 with 14 rules applied. Total rules applied 562 place count 570 transition count 979
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 271 edges and 568 vertex of which 2 / 568 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 31 with 11 rules applied. Total rules applied 573 place count 567 transition count 971
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 270 edges and 566 vertex of which 2 / 566 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 32 with 5 rules applied. Total rules applied 578 place count 565 transition count 968
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 269 edges and 564 vertex of which 2 / 564 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 33 with 7 rules applied. Total rules applied 585 place count 563 transition count 963
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 34 with 6 rules applied. Total rules applied 591 place count 562 transition count 958
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 593 place count 561 transition count 957
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 2 Pre rules applied. Total rules applied 593 place count 561 transition count 955
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 6 rules applied. Total rules applied 599 place count 557 transition count 955
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 3 rules applied. Total rules applied 602 place count 555 transition count 954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 36 with 3 rules applied. Total rules applied 605 place count 555 transition count 951
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 37 with 4 rules applied. Total rules applied 609 place count 555 transition count 947
Applied a total of 609 rules in 203 ms. Remains 555 /810 variables (removed 255) and now considering 947/1396 (removed 449) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 947 rows 555 cols
[2024-05-29 21:15:59] [INFO ] Computed 273 invariants in 2 ms
[2024-05-29 21:15:59] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 21:15:59] [INFO ] [Nat]Absence check using 273 positive place invariants in 36 ms returned sat
[2024-05-29 21:16:00] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 21:16:00] [INFO ] After 869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 236 ms.
[2024-05-29 21:16:01] [INFO ] After 1339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA ShieldRVt-PT-100B-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1199 stabilizing places and 1199 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p1||X(p2)))))))'
Support contains 3 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 688 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:16:02] [INFO ] Computed 401 invariants in 18 ms
[2024-05-29 21:16:03] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2024-05-29 21:16:03] [INFO ] Invariant cache hit.
[2024-05-29 21:16:04] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2845 ms to find 0 implicit places.
[2024-05-29 21:16:04] [INFO ] Invariant cache hit.
[2024-05-29 21:16:07] [INFO ] Dead Transitions using invariants and state equation in 2520 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6061 ms. Remains : 3902/3908 places, 3902/3908 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 367 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s830 0), p2:(EQ s3571 0), p1:(EQ s3216 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 1018 ms.
Product exploration explored 100000 steps with 2 reset in 1231 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 114044 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114044 steps, saw 104741 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 21:16:13] [INFO ] Invariant cache hit.
[2024-05-29 21:16:14] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 21:16:15] [INFO ] [Nat]Absence check using 401 positive place invariants in 233 ms returned sat
[2024-05-29 21:16:18] [INFO ] After 2853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 21:16:19] [INFO ] Deduced a trap composed of 24 places in 1242 ms of which 2 ms to minimize.
[2024-05-29 21:16:21] [INFO ] Deduced a trap composed of 29 places in 1282 ms of which 3 ms to minimize.
[2024-05-29 21:16:22] [INFO ] Deduced a trap composed of 23 places in 1348 ms of which 3 ms to minimize.
[2024-05-29 21:16:24] [INFO ] Deduced a trap composed of 21 places in 1323 ms of which 3 ms to minimize.
[2024-05-29 21:16:25] [INFO ] Deduced a trap composed of 39 places in 1282 ms of which 2 ms to minimize.
[2024-05-29 21:16:27] [INFO ] Deduced a trap composed of 22 places in 1361 ms of which 2 ms to minimize.
[2024-05-29 21:16:28] [INFO ] Deduced a trap composed of 43 places in 1298 ms of which 2 ms to minimize.
[2024-05-29 21:16:29] [INFO ] Deduced a trap composed of 31 places in 1316 ms of which 3 ms to minimize.
[2024-05-29 21:16:31] [INFO ] Deduced a trap composed of 54 places in 1131 ms of which 2 ms to minimize.
[2024-05-29 21:16:32] [INFO ] Deduced a trap composed of 49 places in 1219 ms of which 2 ms to minimize.
[2024-05-29 21:16:33] [INFO ] Deduced a trap composed of 39 places in 1288 ms of which 2 ms to minimize.
[2024-05-29 21:16:35] [INFO ] Deduced a trap composed of 28 places in 1263 ms of which 2 ms to minimize.
[2024-05-29 21:16:36] [INFO ] Deduced a trap composed of 59 places in 1222 ms of which 12 ms to minimize.
[2024-05-29 21:16:38] [INFO ] Deduced a trap composed of 39 places in 1227 ms of which 3 ms to minimize.
[2024-05-29 21:16:39] [INFO ] Deduced a trap composed of 31 places in 1209 ms of which 2 ms to minimize.
[2024-05-29 21:16:40] [INFO ] Deduced a trap composed of 22 places in 1185 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 21:16:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 21:16:40] [INFO ] After 26214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 308 ms.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 6 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 666 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 666 ms. Remains : 804/3902 places, 1394/3902 transitions.
Finished random walk after 2251 steps, including 1 resets, run visited all 4 properties in 46 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 3902 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 345 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
[2024-05-29 21:16:42] [INFO ] Invariant cache hit.
[2024-05-29 21:16:43] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-29 21:16:43] [INFO ] Invariant cache hit.
[2024-05-29 21:16:45] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
[2024-05-29 21:16:45] [INFO ] Invariant cache hit.
[2024-05-29 21:16:48] [INFO ] Dead Transitions using invariants and state equation in 2704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5825 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 8894 steps, including 2 resets, run visited all 4 properties in 149 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 927 ms.
Product exploration explored 100000 steps with 3 reset in 1152 ms.
Built C files in :
/tmp/ltsmin15385066314096770248
[2024-05-29 21:16:51] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15385066314096770248
Running compilation step : cd /tmp/ltsmin15385066314096770248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15385066314096770248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15385066314096770248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3901 transition count 3901
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3901 transition count 3901
Applied a total of 2 rules in 686 ms. Remains 3901 /3902 variables (removed 1) and now considering 3901/3902 (removed 1) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2024-05-29 21:16:55] [INFO ] Computed 401 invariants in 25 ms
[2024-05-29 21:16:56] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2024-05-29 21:16:56] [INFO ] Invariant cache hit.
[2024-05-29 21:16:58] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
[2024-05-29 21:16:58] [INFO ] Invariant cache hit.
[2024-05-29 21:17:01] [INFO ] Dead Transitions using invariants and state equation in 2526 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3902 places, 3901/3902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6119 ms. Remains : 3901/3902 places, 3901/3902 transitions.
Built C files in :
/tmp/ltsmin15821310423448295447
[2024-05-29 21:17:01] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15821310423448295447
Running compilation step : cd /tmp/ltsmin15821310423448295447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15821310423448295447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15821310423448295447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 21:17:04] [INFO ] Flatten gal took : 110 ms
[2024-05-29 21:17:04] [INFO ] Flatten gal took : 110 ms
[2024-05-29 21:17:04] [INFO ] Time to serialize gal into /tmp/LTL11606552718656398447.gal : 24 ms
[2024-05-29 21:17:04] [INFO ] Time to serialize properties into /tmp/LTL17544439448578306607.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11606552718656398447.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3436545038381991177.hoa' '-atoms' '/tmp/LTL17544439448578306607.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17544439448578306607.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3436545038381991177.hoa
Detected timeout of ITS tools.
[2024-05-29 21:17:19] [INFO ] Flatten gal took : 95 ms
[2024-05-29 21:17:19] [INFO ] Flatten gal took : 87 ms
[2024-05-29 21:17:19] [INFO ] Time to serialize gal into /tmp/LTL3515287750525795510.gal : 22 ms
[2024-05-29 21:17:19] [INFO ] Time to serialize properties into /tmp/LTL12689979525957538405.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3515287750525795510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12689979525957538405.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(p1039==0)")&&(X(G(("(p4115==0)")||(X("(p4572==0)"))))))))
Formula 0 simplified : X(!"(p1039==0)" | XF(!"(p4115==0)" & X!"(p4572==0)"))
Detected timeout of ITS tools.
[2024-05-29 21:17:35] [INFO ] Flatten gal took : 85 ms
[2024-05-29 21:17:35] [INFO ] Applying decomposition
[2024-05-29 21:17:35] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13744177110042280235.txt' '-o' '/tmp/graph13744177110042280235.bin' '-w' '/tmp/graph13744177110042280235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13744177110042280235.bin' '-l' '-1' '-v' '-w' '/tmp/graph13744177110042280235.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:17:35] [INFO ] Decomposing Gal with order
[2024-05-29 21:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:17:36] [INFO ] Removed a total of 985 redundant transitions.
[2024-05-29 21:17:36] [INFO ] Flatten gal took : 267 ms
[2024-05-29 21:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-29 21:17:36] [INFO ] Time to serialize gal into /tmp/LTL15576397410319844809.gal : 53 ms
[2024-05-29 21:17:36] [INFO ] Time to serialize properties into /tmp/LTL12944522377266708478.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15576397410319844809.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12944522377266708478.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(("(i17.u332.p1039==0)")&&(X(G(("(i45.i0.i5.u1262.p4115==0)")||(X("(i49.u1400.p4572==0)"))))))))
Formula 0 simplified : X(!"(i17.u332.p1039==0)" | XF(!"(i45.i0.i5.u1262.p4115==0)" & X!"(i49.u1400.p4572==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7880794255789054850
[2024-05-29 21:17:51] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7880794255789054850
Running compilation step : cd /tmp/ltsmin7880794255789054850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7880794255789054850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7880794255789054850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-100B-LTLFireability-00 finished in 113502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3907 transition count 2809
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2809 transition count 2809
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2196 place count 2809 transition count 2013
Deduced a syphon composed of 796 places in 17 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3788 place count 2013 transition count 2013
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 3793 place count 2008 transition count 2008
Iterating global reduction 2 with 5 rules applied. Total rules applied 3798 place count 2008 transition count 2008
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 3798 place count 2008 transition count 2003
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 3808 place count 2003 transition count 2003
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 1 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5606 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5607 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5609 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5811 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6013 place count 901 transition count 1303
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6207 place count 804 transition count 1399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6209 place count 802 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6210 place count 801 transition count 1397
Applied a total of 6210 rules in 984 ms. Remains 801 /3908 variables (removed 3107) and now considering 1397/3908 (removed 2511) transitions.
// Phase 1: matrix 1397 rows 801 cols
[2024-05-29 21:17:55] [INFO ] Computed 400 invariants in 4 ms
[2024-05-29 21:17:56] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-29 21:17:56] [INFO ] Invariant cache hit.
[2024-05-29 21:17:57] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
[2024-05-29 21:17:57] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 21:17:57] [INFO ] Invariant cache hit.
[2024-05-29 21:17:58] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/3908 places, 1397/3908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3587 ms. Remains : 801/3908 places, 1397/3908 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s666 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 18761 steps with 3 reset in 182 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-01 finished in 3878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 676 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:17:59] [INFO ] Computed 401 invariants in 20 ms
[2024-05-29 21:18:00] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2024-05-29 21:18:00] [INFO ] Invariant cache hit.
[2024-05-29 21:18:02] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2754 ms to find 0 implicit places.
[2024-05-29 21:18:02] [INFO ] Invariant cache hit.
[2024-05-29 21:18:04] [INFO ] Dead Transitions using invariants and state equation in 2644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6079 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1542 1) (EQ s3400 1) (EQ s3409 1) (EQ s3434 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 94079 steps with 8 reset in 853 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-03 finished in 7063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((p1 U G(p2)))))'
Support contains 3 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 699 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:18:06] [INFO ] Computed 401 invariants in 28 ms
[2024-05-29 21:18:07] [INFO ] Implicit Places using invariants in 1161 ms returned []
[2024-05-29 21:18:07] [INFO ] Invariant cache hit.
[2024-05-29 21:18:09] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2890 ms to find 0 implicit places.
[2024-05-29 21:18:09] [INFO ] Invariant cache hit.
[2024-05-29 21:18:11] [INFO ] Dead Transitions using invariants and state equation in 2614 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6210 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s257 1), p2:(EQ s2744 1), p1:(EQ s811 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 53 reset in 792 ms.
Product exploration explored 100000 steps with 52 reset in 916 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3902 stabilizing places and 1198/3902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 190 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 21:18:14] [INFO ] Invariant cache hit.
[2024-05-29 21:18:15] [INFO ] [Real]Absence check using 401 positive place invariants in 248 ms returned sat
[2024-05-29 21:18:15] [INFO ] After 1092ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 21:18:16] [INFO ] [Nat]Absence check using 401 positive place invariants in 240 ms returned sat
[2024-05-29 21:18:20] [INFO ] After 3094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 21:18:21] [INFO ] Deduced a trap composed of 44 places in 1068 ms of which 2 ms to minimize.
[2024-05-29 21:18:22] [INFO ] Deduced a trap composed of 23 places in 1032 ms of which 3 ms to minimize.
[2024-05-29 21:18:23] [INFO ] Deduced a trap composed of 21 places in 973 ms of which 2 ms to minimize.
[2024-05-29 21:18:24] [INFO ] Deduced a trap composed of 37 places in 1053 ms of which 2 ms to minimize.
[2024-05-29 21:18:25] [INFO ] Deduced a trap composed of 36 places in 1006 ms of which 2 ms to minimize.
[2024-05-29 21:18:26] [INFO ] Deduced a trap composed of 35 places in 1005 ms of which 6 ms to minimize.
[2024-05-29 21:18:28] [INFO ] Deduced a trap composed of 22 places in 992 ms of which 5 ms to minimize.
[2024-05-29 21:18:29] [INFO ] Deduced a trap composed of 46 places in 988 ms of which 2 ms to minimize.
[2024-05-29 21:18:30] [INFO ] Deduced a trap composed of 29 places in 965 ms of which 2 ms to minimize.
[2024-05-29 21:18:31] [INFO ] Deduced a trap composed of 39 places in 983 ms of which 2 ms to minimize.
[2024-05-29 21:18:32] [INFO ] Deduced a trap composed of 41 places in 956 ms of which 2 ms to minimize.
[2024-05-29 21:18:33] [INFO ] Deduced a trap composed of 23 places in 924 ms of which 2 ms to minimize.
[2024-05-29 21:18:34] [INFO ] Deduced a trap composed of 27 places in 938 ms of which 2 ms to minimize.
[2024-05-29 21:18:35] [INFO ] Deduced a trap composed of 32 places in 917 ms of which 2 ms to minimize.
[2024-05-29 21:18:36] [INFO ] Deduced a trap composed of 22 places in 940 ms of which 1 ms to minimize.
[2024-05-29 21:18:37] [INFO ] Deduced a trap composed of 39 places in 885 ms of which 2 ms to minimize.
[2024-05-29 21:18:38] [INFO ] Deduced a trap composed of 30 places in 896 ms of which 2 ms to minimize.
[2024-05-29 21:18:39] [INFO ] Deduced a trap composed of 44 places in 893 ms of which 3 ms to minimize.
[2024-05-29 21:18:40] [INFO ] Deduced a trap composed of 53 places in 802 ms of which 2 ms to minimize.
[2024-05-29 21:18:41] [INFO ] Deduced a trap composed of 47 places in 862 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 21:18:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 21:18:41] [INFO ] After 25871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 329 ms.
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 2804
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 42 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5592 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5593 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5595 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5797 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5999 place count 903 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6193 place count 806 transition count 1402
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1400
Applied a total of 6196 rules in 794 ms. Remains 804 /3902 variables (removed 3098) and now considering 1400/3902 (removed 2502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 794 ms. Remains : 804/3902 places, 1400/3902 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 133172 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133172 steps, saw 82446 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1400 rows 804 cols
[2024-05-29 21:18:46] [INFO ] Computed 400 invariants in 2 ms
[2024-05-29 21:18:46] [INFO ] [Real]Absence check using 400 positive place invariants in 58 ms returned sat
[2024-05-29 21:18:46] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 21:18:47] [INFO ] [Nat]Absence check using 400 positive place invariants in 70 ms returned sat
[2024-05-29 21:18:47] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 21:18:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 21:18:48] [INFO ] After 220ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 21:18:48] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-29 21:18:48] [INFO ] After 1538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 672 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 42 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 804/804 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 132457 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132457 steps, saw 81937 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 21:18:52] [INFO ] Invariant cache hit.
[2024-05-29 21:18:53] [INFO ] [Real]Absence check using 400 positive place invariants in 57 ms returned sat
[2024-05-29 21:18:53] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:18:53] [INFO ] [Nat]Absence check using 400 positive place invariants in 61 ms returned sat
[2024-05-29 21:18:53] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:18:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 21:18:53] [INFO ] After 80ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 21:18:53] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 21:18:54] [INFO ] After 1026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 380 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 27 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 804/804 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 27 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 21:18:54] [INFO ] Invariant cache hit.
[2024-05-29 21:18:55] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-05-29 21:18:55] [INFO ] Invariant cache hit.
[2024-05-29 21:18:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 21:18:56] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
[2024-05-29 21:18:56] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-29 21:18:56] [INFO ] Invariant cache hit.
[2024-05-29 21:18:57] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3009 ms. Remains : 804/804 places, 1400/1400 transitions.
Graph (trivial) has 399 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2787 edges and 802 vertex of which 800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 396 edges and 798 vertex of which 4 / 798 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 796 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 395 edges and 794 vertex of which 6 / 794 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 791 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 393 edges and 788 vertex of which 8 / 788 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 784 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 389 edges and 780 vertex of which 8 / 780 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 776 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 385 edges and 772 vertex of which 8 / 772 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 768 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 764 vertex of which 8 / 764 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 760 transition count 1329
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 756 vertex of which 8 / 756 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 752 transition count 1315
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 748 vertex of which 8 / 748 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 744 transition count 1301
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 736 transition count 1287
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 732 vertex of which 8 / 732 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 728 transition count 1273
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 724 vertex of which 8 / 724 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 720 transition count 1259
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 716 vertex of which 8 / 716 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 712 transition count 1245
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 708 vertex of which 8 / 708 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 704 transition count 1231
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 700 vertex of which 8 / 700 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 696 transition count 1217
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 692 vertex of which 8 / 692 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 688 transition count 1203
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 684 vertex of which 8 / 684 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 680 transition count 1189
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 676 vertex of which 8 / 676 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 672 transition count 1175
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 668 vertex of which 8 / 668 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 664 transition count 1161
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 660 vertex of which 8 / 660 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 656 transition count 1147
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 652 vertex of which 8 / 652 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 648 transition count 1133
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 644 vertex of which 8 / 644 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 640 transition count 1119
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 636 vertex of which 8 / 636 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 632 transition count 1105
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 628 vertex of which 8 / 628 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 624 transition count 1091
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 620 vertex of which 8 / 620 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 616 transition count 1077
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 612 vertex of which 8 / 612 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 608 transition count 1063
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 604 vertex of which 8 / 604 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 600 transition count 1049
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 596 vertex of which 8 / 596 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 592 transition count 1035
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 588 vertex of which 8 / 588 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 584 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 580 vertex of which 8 / 580 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 576 transition count 1007
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 572 vertex of which 6 / 572 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 569 transition count 993
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 282 edges and 566 vertex of which 6 / 566 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 14 rules applied. Total rules applied 562 place count 563 transition count 983
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 279 edges and 560 vertex of which 6 / 560 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 16 rules applied. Total rules applied 578 place count 557 transition count 971
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 277 edges and 554 vertex of which 8 / 554 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 15 rules applied. Total rules applied 593 place count 550 transition count 960
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 274 edges and 546 vertex of which 10 / 546 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 33 with 20 rules applied. Total rules applied 613 place count 541 transition count 945
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 268 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 34 with 25 rules applied. Total rules applied 638 place count 532 transition count 926
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 263 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 21 rules applied. Total rules applied 659 place count 523 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 515 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 255 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 507 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 251 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 499 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 247 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 491 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 243 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 483 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 239 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 475 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 235 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 467 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 231 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 459 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 227 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 451 transition count 785
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 223 edges and 447 vertex of which 8 / 447 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 849 place count 443 transition count 771
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 219 edges and 439 vertex of which 8 / 439 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 868 place count 435 transition count 757
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 215 edges and 431 vertex of which 8 / 431 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 887 place count 427 transition count 743
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 211 edges and 423 vertex of which 8 / 423 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 906 place count 419 transition count 729
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 207 edges and 415 vertex of which 8 / 415 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 49 with 19 rules applied. Total rules applied 925 place count 411 transition count 715
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 203 edges and 407 vertex of which 8 / 407 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 50 with 19 rules applied. Total rules applied 944 place count 403 transition count 701
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 199 edges and 399 vertex of which 8 / 399 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 51 with 19 rules applied. Total rules applied 963 place count 395 transition count 687
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 195 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 52 with 19 rules applied. Total rules applied 982 place count 387 transition count 673
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 191 edges and 383 vertex of which 8 / 383 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 53 with 19 rules applied. Total rules applied 1001 place count 379 transition count 659
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 375 vertex of which 8 / 375 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 54 with 19 rules applied. Total rules applied 1020 place count 371 transition count 645
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 19 rules applied. Total rules applied 1039 place count 363 transition count 631
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 359 vertex of which 8 / 359 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 56 with 19 rules applied. Total rules applied 1058 place count 355 transition count 617
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 351 vertex of which 8 / 351 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 57 with 19 rules applied. Total rules applied 1077 place count 347 transition count 603
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 343 vertex of which 8 / 343 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 58 with 19 rules applied. Total rules applied 1096 place count 339 transition count 589
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 59 with 19 rules applied. Total rules applied 1115 place count 331 transition count 575
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 327 vertex of which 8 / 327 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 60 with 19 rules applied. Total rules applied 1134 place count 323 transition count 561
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 319 vertex of which 8 / 319 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 61 with 19 rules applied. Total rules applied 1153 place count 315 transition count 547
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 311 vertex of which 8 / 311 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 62 with 19 rules applied. Total rules applied 1172 place count 307 transition count 533
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 303 vertex of which 8 / 303 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 63 with 19 rules applied. Total rules applied 1191 place count 299 transition count 519
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 295 vertex of which 8 / 295 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 64 with 19 rules applied. Total rules applied 1210 place count 291 transition count 505
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 287 vertex of which 8 / 287 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 65 with 19 rules applied. Total rules applied 1229 place count 283 transition count 491
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 279 vertex of which 8 / 279 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 66 with 19 rules applied. Total rules applied 1248 place count 275 transition count 477
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 271 vertex of which 8 / 271 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 67 with 19 rules applied. Total rules applied 1267 place count 267 transition count 463
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 263 vertex of which 8 / 263 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 68 with 19 rules applied. Total rules applied 1286 place count 259 transition count 449
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 255 vertex of which 8 / 255 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 69 with 19 rules applied. Total rules applied 1305 place count 251 transition count 435
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 247 vertex of which 8 / 247 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 70 with 19 rules applied. Total rules applied 1324 place count 243 transition count 421
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 239 vertex of which 8 / 239 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 71 with 19 rules applied. Total rules applied 1343 place count 235 transition count 407
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 231 vertex of which 8 / 231 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 72 with 19 rules applied. Total rules applied 1362 place count 227 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 73 with 19 rules applied. Total rules applied 1381 place count 219 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 74 with 19 rules applied. Total rules applied 1400 place count 211 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 75 with 19 rules applied. Total rules applied 1419 place count 203 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 76 with 19 rules applied. Total rules applied 1438 place count 195 transition count 337
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 77 with 19 rules applied. Total rules applied 1457 place count 187 transition count 323
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 78 with 19 rules applied. Total rules applied 1476 place count 179 transition count 309
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 79 with 19 rules applied. Total rules applied 1495 place count 171 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 80 with 19 rules applied. Total rules applied 1514 place count 164 transition count 281
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 79 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 81 with 14 rules applied. Total rules applied 1528 place count 159 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 76 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 82 with 9 rules applied. Total rules applied 1537 place count 156 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 83 with 5 rules applied. Total rules applied 1542 place count 155 transition count 261
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 84 with 2 Pre rules applied. Total rules applied 1542 place count 155 transition count 259
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 84 with 5 rules applied. Total rules applied 1547 place count 152 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 84 with 3 rules applied. Total rules applied 1550 place count 150 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 84 with 4 rules applied. Total rules applied 1554 place count 150 transition count 254
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1555 place count 150 transition count 254
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1556 place count 150 transition count 253
Applied a total of 1556 rules in 271 ms. Remains 150 /804 variables (removed 654) and now considering 253/1400 (removed 1147) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 253 rows 150 cols
[2024-05-29 21:18:57] [INFO ] Computed 74 invariants in 1 ms
[2024-05-29 21:18:58] [INFO ] [Real]Absence check using 74 positive place invariants in 38 ms returned sat
[2024-05-29 21:18:58] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:18:58] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2024-05-29 21:18:58] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:18:58] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 21:18:58] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p0), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 12 factoid took 409 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:18:58] [INFO ] Computed 401 invariants in 13 ms
[2024-05-29 21:19:02] [INFO ] [Real]Absence check using 401 positive place invariants in 938 ms returned sat
[2024-05-29 21:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 21:19:14] [INFO ] [Real]Absence check using state equation in 11945 ms returned unknown
Could not prove EG (NOT p2)
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 339 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
[2024-05-29 21:19:14] [INFO ] Invariant cache hit.
[2024-05-29 21:19:15] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2024-05-29 21:19:15] [INFO ] Invariant cache hit.
[2024-05-29 21:19:17] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2754 ms to find 0 implicit places.
[2024-05-29 21:19:17] [INFO ] Invariant cache hit.
[2024-05-29 21:19:19] [INFO ] Dead Transitions using invariants and state equation in 2598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5700 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3902 stabilizing places and 1198/3902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 193 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 21:19:20] [INFO ] Invariant cache hit.
[2024-05-29 21:19:21] [INFO ] [Real]Absence check using 401 positive place invariants in 241 ms returned sat
[2024-05-29 21:19:21] [INFO ] After 1007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 21:19:22] [INFO ] [Nat]Absence check using 401 positive place invariants in 238 ms returned sat
[2024-05-29 21:19:25] [INFO ] After 2980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 21:19:26] [INFO ] Deduced a trap composed of 44 places in 1031 ms of which 2 ms to minimize.
[2024-05-29 21:19:27] [INFO ] Deduced a trap composed of 23 places in 1048 ms of which 3 ms to minimize.
[2024-05-29 21:19:28] [INFO ] Deduced a trap composed of 21 places in 1020 ms of which 2 ms to minimize.
[2024-05-29 21:19:30] [INFO ] Deduced a trap composed of 37 places in 1000 ms of which 2 ms to minimize.
[2024-05-29 21:19:31] [INFO ] Deduced a trap composed of 36 places in 989 ms of which 2 ms to minimize.
[2024-05-29 21:19:32] [INFO ] Deduced a trap composed of 35 places in 996 ms of which 2 ms to minimize.
[2024-05-29 21:19:33] [INFO ] Deduced a trap composed of 22 places in 957 ms of which 4 ms to minimize.
[2024-05-29 21:19:34] [INFO ] Deduced a trap composed of 46 places in 955 ms of which 14 ms to minimize.
[2024-05-29 21:19:35] [INFO ] Deduced a trap composed of 29 places in 962 ms of which 2 ms to minimize.
[2024-05-29 21:19:36] [INFO ] Deduced a trap composed of 39 places in 957 ms of which 2 ms to minimize.
[2024-05-29 21:19:37] [INFO ] Deduced a trap composed of 41 places in 955 ms of which 2 ms to minimize.
[2024-05-29 21:19:38] [INFO ] Deduced a trap composed of 23 places in 945 ms of which 1 ms to minimize.
[2024-05-29 21:19:39] [INFO ] Deduced a trap composed of 27 places in 943 ms of which 2 ms to minimize.
[2024-05-29 21:19:40] [INFO ] Deduced a trap composed of 32 places in 907 ms of which 2 ms to minimize.
[2024-05-29 21:19:41] [INFO ] Deduced a trap composed of 22 places in 912 ms of which 1 ms to minimize.
[2024-05-29 21:19:43] [INFO ] Deduced a trap composed of 39 places in 925 ms of which 2 ms to minimize.
[2024-05-29 21:19:44] [INFO ] Deduced a trap composed of 30 places in 893 ms of which 2 ms to minimize.
[2024-05-29 21:19:45] [INFO ] Deduced a trap composed of 44 places in 899 ms of which 1 ms to minimize.
[2024-05-29 21:19:46] [INFO ] Deduced a trap composed of 53 places in 848 ms of which 2 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 47 places in 897 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 21:19:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 21:19:47] [INFO ] After 25547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 307 ms.
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 2804
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 5 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5592 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5593 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5595 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5797 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5999 place count 903 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6193 place count 806 transition count 1402
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1400
Applied a total of 6196 rules in 560 ms. Remains 804 /3902 variables (removed 3098) and now considering 1400/3902 (removed 2502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 804/3902 places, 1400/3902 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 147369 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147369 steps, saw 91831 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1400 rows 804 cols
[2024-05-29 21:19:51] [INFO ] Computed 400 invariants in 2 ms
[2024-05-29 21:19:51] [INFO ] [Real]Absence check using 400 positive place invariants in 59 ms returned sat
[2024-05-29 21:19:51] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 21:19:51] [INFO ] [Nat]Absence check using 400 positive place invariants in 57 ms returned sat
[2024-05-29 21:19:52] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 21:19:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 21:19:52] [INFO ] After 168ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 21:19:52] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 166 ms.
[2024-05-29 21:19:53] [INFO ] After 1450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 544 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 26 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 804/804 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 131515 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131515 steps, saw 81352 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 21:19:57] [INFO ] Invariant cache hit.
[2024-05-29 21:19:57] [INFO ] [Real]Absence check using 400 positive place invariants in 57 ms returned sat
[2024-05-29 21:19:57] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:19:57] [INFO ] [Nat]Absence check using 400 positive place invariants in 59 ms returned sat
[2024-05-29 21:19:58] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:19:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 21:19:58] [INFO ] After 90ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 21:19:58] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-29 21:19:58] [INFO ] After 1020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 583 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 25 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 804/804 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 26 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 21:19:58] [INFO ] Invariant cache hit.
[2024-05-29 21:19:59] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-29 21:19:59] [INFO ] Invariant cache hit.
[2024-05-29 21:20:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 21:20:00] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1878 ms to find 0 implicit places.
[2024-05-29 21:20:00] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 21:20:00] [INFO ] Invariant cache hit.
[2024-05-29 21:20:01] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2697 ms. Remains : 804/804 places, 1400/1400 transitions.
Graph (trivial) has 399 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2787 edges and 802 vertex of which 800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 396 edges and 798 vertex of which 4 / 798 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 796 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 395 edges and 794 vertex of which 6 / 794 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 791 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 393 edges and 788 vertex of which 8 / 788 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 784 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 389 edges and 780 vertex of which 8 / 780 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 776 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 385 edges and 772 vertex of which 8 / 772 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 768 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 764 vertex of which 8 / 764 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 760 transition count 1329
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 756 vertex of which 8 / 756 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 752 transition count 1315
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 748 vertex of which 8 / 748 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 744 transition count 1301
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 736 transition count 1287
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 732 vertex of which 8 / 732 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 728 transition count 1273
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 724 vertex of which 8 / 724 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 720 transition count 1259
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 716 vertex of which 8 / 716 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 712 transition count 1245
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 708 vertex of which 8 / 708 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 704 transition count 1231
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 700 vertex of which 8 / 700 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 696 transition count 1217
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 692 vertex of which 8 / 692 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 688 transition count 1203
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 684 vertex of which 8 / 684 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 680 transition count 1189
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 676 vertex of which 8 / 676 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 672 transition count 1175
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 668 vertex of which 8 / 668 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 664 transition count 1161
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 660 vertex of which 8 / 660 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 656 transition count 1147
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 652 vertex of which 8 / 652 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 648 transition count 1133
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 644 vertex of which 8 / 644 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 640 transition count 1119
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 636 vertex of which 8 / 636 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 632 transition count 1105
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 628 vertex of which 8 / 628 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 624 transition count 1091
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 620 vertex of which 8 / 620 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 616 transition count 1077
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 612 vertex of which 8 / 612 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 608 transition count 1063
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 604 vertex of which 8 / 604 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 600 transition count 1049
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 596 vertex of which 8 / 596 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 592 transition count 1035
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 588 vertex of which 8 / 588 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 584 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 580 vertex of which 8 / 580 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 576 transition count 1007
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 572 vertex of which 6 / 572 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 569 transition count 993
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 282 edges and 566 vertex of which 6 / 566 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 14 rules applied. Total rules applied 562 place count 563 transition count 983
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 279 edges and 560 vertex of which 6 / 560 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 16 rules applied. Total rules applied 578 place count 557 transition count 971
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 277 edges and 554 vertex of which 8 / 554 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 15 rules applied. Total rules applied 593 place count 550 transition count 960
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 274 edges and 546 vertex of which 10 / 546 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 33 with 20 rules applied. Total rules applied 613 place count 541 transition count 945
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 268 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 34 with 25 rules applied. Total rules applied 638 place count 532 transition count 926
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 263 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 21 rules applied. Total rules applied 659 place count 523 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 515 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 255 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 507 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 251 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 499 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 247 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 491 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 243 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 483 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 239 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 475 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 235 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 467 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 231 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 459 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 227 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 451 transition count 785
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 223 edges and 447 vertex of which 8 / 447 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 849 place count 443 transition count 771
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 219 edges and 439 vertex of which 8 / 439 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 868 place count 435 transition count 757
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 215 edges and 431 vertex of which 8 / 431 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 887 place count 427 transition count 743
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 211 edges and 423 vertex of which 8 / 423 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 906 place count 419 transition count 729
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 207 edges and 415 vertex of which 8 / 415 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 49 with 19 rules applied. Total rules applied 925 place count 411 transition count 715
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 203 edges and 407 vertex of which 8 / 407 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 50 with 19 rules applied. Total rules applied 944 place count 403 transition count 701
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 199 edges and 399 vertex of which 8 / 399 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 51 with 19 rules applied. Total rules applied 963 place count 395 transition count 687
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 195 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 52 with 19 rules applied. Total rules applied 982 place count 387 transition count 673
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 191 edges and 383 vertex of which 8 / 383 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 53 with 19 rules applied. Total rules applied 1001 place count 379 transition count 659
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 375 vertex of which 8 / 375 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 54 with 19 rules applied. Total rules applied 1020 place count 371 transition count 645
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 19 rules applied. Total rules applied 1039 place count 363 transition count 631
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 359 vertex of which 8 / 359 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 56 with 19 rules applied. Total rules applied 1058 place count 355 transition count 617
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 351 vertex of which 8 / 351 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 57 with 19 rules applied. Total rules applied 1077 place count 347 transition count 603
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 343 vertex of which 8 / 343 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 58 with 19 rules applied. Total rules applied 1096 place count 339 transition count 589
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 59 with 19 rules applied. Total rules applied 1115 place count 331 transition count 575
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 327 vertex of which 8 / 327 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 60 with 19 rules applied. Total rules applied 1134 place count 323 transition count 561
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 319 vertex of which 8 / 319 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 61 with 19 rules applied. Total rules applied 1153 place count 315 transition count 547
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 311 vertex of which 8 / 311 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 62 with 19 rules applied. Total rules applied 1172 place count 307 transition count 533
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 303 vertex of which 8 / 303 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 63 with 19 rules applied. Total rules applied 1191 place count 299 transition count 519
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 295 vertex of which 8 / 295 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 64 with 19 rules applied. Total rules applied 1210 place count 291 transition count 505
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 287 vertex of which 8 / 287 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 65 with 19 rules applied. Total rules applied 1229 place count 283 transition count 491
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 279 vertex of which 8 / 279 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 66 with 19 rules applied. Total rules applied 1248 place count 275 transition count 477
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 271 vertex of which 8 / 271 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 67 with 19 rules applied. Total rules applied 1267 place count 267 transition count 463
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 263 vertex of which 8 / 263 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 68 with 19 rules applied. Total rules applied 1286 place count 259 transition count 449
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 255 vertex of which 8 / 255 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 69 with 19 rules applied. Total rules applied 1305 place count 251 transition count 435
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 247 vertex of which 8 / 247 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 70 with 19 rules applied. Total rules applied 1324 place count 243 transition count 421
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 239 vertex of which 8 / 239 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 71 with 19 rules applied. Total rules applied 1343 place count 235 transition count 407
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 231 vertex of which 8 / 231 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 72 with 19 rules applied. Total rules applied 1362 place count 227 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 73 with 19 rules applied. Total rules applied 1381 place count 219 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 74 with 19 rules applied. Total rules applied 1400 place count 211 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 75 with 19 rules applied. Total rules applied 1419 place count 203 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 76 with 19 rules applied. Total rules applied 1438 place count 195 transition count 337
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 77 with 19 rules applied. Total rules applied 1457 place count 187 transition count 323
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 78 with 19 rules applied. Total rules applied 1476 place count 179 transition count 309
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 79 with 19 rules applied. Total rules applied 1495 place count 171 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 80 with 19 rules applied. Total rules applied 1514 place count 164 transition count 281
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 79 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 81 with 14 rules applied. Total rules applied 1528 place count 159 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 76 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 82 with 9 rules applied. Total rules applied 1537 place count 156 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 83 with 5 rules applied. Total rules applied 1542 place count 155 transition count 261
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 84 with 2 Pre rules applied. Total rules applied 1542 place count 155 transition count 259
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 84 with 5 rules applied. Total rules applied 1547 place count 152 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 84 with 3 rules applied. Total rules applied 1550 place count 150 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 84 with 4 rules applied. Total rules applied 1554 place count 150 transition count 254
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1555 place count 150 transition count 254
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1556 place count 150 transition count 253
Applied a total of 1556 rules in 172 ms. Remains 150 /804 variables (removed 654) and now considering 253/1400 (removed 1147) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 253 rows 150 cols
[2024-05-29 21:20:01] [INFO ] Computed 74 invariants in 0 ms
[2024-05-29 21:20:01] [INFO ] [Real]Absence check using 74 positive place invariants in 8 ms returned sat
[2024-05-29 21:20:01] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:20:01] [INFO ] [Nat]Absence check using 74 positive place invariants in 9 ms returned sat
[2024-05-29 21:20:02] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:20:02] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 21:20:02] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p0), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 12 factoid took 396 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:20:03] [INFO ] Computed 401 invariants in 22 ms
[2024-05-29 21:20:06] [INFO ] [Real]Absence check using 401 positive place invariants in 1003 ms returned sat
[2024-05-29 21:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 21:20:18] [INFO ] [Real]Absence check using state equation in 11811 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 53 reset in 662 ms.
Product exploration explored 100000 steps with 53 reset in 798 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Performed 1098 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 3902
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1098 place count 3902 transition count 4301
Deduced a syphon composed of 1498 places in 12 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1498 place count 3902 transition count 4301
Performed 1199 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2697 places in 8 ms
Iterating global reduction 1 with 1199 rules applied. Total rules applied 2697 place count 3902 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2698 place count 3902 transition count 4301
Renaming transitions due to excessive name length > 1024 char.
Discarding 799 places :
Symmetric choice reduction at 2 with 799 rule applications. Total rules 3497 place count 3103 transition count 3502
Deduced a syphon composed of 1898 places in 23 ms
Iterating global reduction 2 with 799 rules applied. Total rules applied 4296 place count 3103 transition count 3502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1899 places in 24 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4297 place count 3103 transition count 3502
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4299 place count 3101 transition count 3500
Deduced a syphon composed of 1897 places in 17 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4301 place count 3101 transition count 3500
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1998 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4402 place count 3101 transition count 4232
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4503 place count 3000 transition count 4030
Deduced a syphon composed of 1897 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4604 place count 3000 transition count 4030
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -727
Deduced a syphon composed of 1998 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4705 place count 3000 transition count 4757
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4806 place count 2899 transition count 4555
Deduced a syphon composed of 1897 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4907 place count 2899 transition count 4555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -743
Deduced a syphon composed of 1998 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5008 place count 2899 transition count 5298
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5109 place count 2798 transition count 5096
Deduced a syphon composed of 1897 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5210 place count 2798 transition count 5096
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1992 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5305 place count 2798 transition count 5779
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 5400 place count 2703 transition count 5589
Deduced a syphon composed of 1897 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5495 place count 2703 transition count 5589
Deduced a syphon composed of 1897 places in 2 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5498 place count 2703 transition count 5586
Deduced a syphon composed of 1897 places in 1 ms
Applied a total of 5498 rules in 5246 ms. Remains 2703 /3902 variables (removed 1199) and now considering 5586/3902 (removed -1684) transitions.
[2024-05-29 21:20:25] [INFO ] Redundant transitions in 327 ms returned []
// Phase 1: matrix 5586 rows 2703 cols
[2024-05-29 21:20:25] [INFO ] Computed 401 invariants in 74 ms
[2024-05-29 21:20:29] [INFO ] Dead Transitions using invariants and state equation in 3832 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2703/3902 places, 5586/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9438 ms. Remains : 2703/3902 places, 5586/3902 transitions.
Built C files in :
/tmp/ltsmin17648361653684851043
[2024-05-29 21:20:29] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17648361653684851043
Running compilation step : cd /tmp/ltsmin17648361653684851043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17648361653684851043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17648361653684851043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 635 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:20:33] [INFO ] Computed 401 invariants in 18 ms
[2024-05-29 21:20:34] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2024-05-29 21:20:34] [INFO ] Invariant cache hit.
[2024-05-29 21:20:35] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 2866 ms to find 0 implicit places.
[2024-05-29 21:20:35] [INFO ] Invariant cache hit.
[2024-05-29 21:20:38] [INFO ] Dead Transitions using invariants and state equation in 2560 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6077 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Built C files in :
/tmp/ltsmin3898367437787153583
[2024-05-29 21:20:38] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3898367437787153583
Running compilation step : cd /tmp/ltsmin3898367437787153583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3898367437787153583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3898367437787153583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 21:20:41] [INFO ] Flatten gal took : 191 ms
[2024-05-29 21:20:42] [INFO ] Flatten gal took : 168 ms
[2024-05-29 21:20:42] [INFO ] Time to serialize gal into /tmp/LTL17624178287351594170.gal : 58 ms
[2024-05-29 21:20:42] [INFO ] Time to serialize properties into /tmp/LTL16812283846630393554.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17624178287351594170.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14308497804953784457.hoa' '-atoms' '/tmp/LTL16812283846630393554.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16812283846630393554.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14308497804953784457.hoa
Detected timeout of ITS tools.
[2024-05-29 21:20:57] [INFO ] Flatten gal took : 76 ms
[2024-05-29 21:20:57] [INFO ] Flatten gal took : 123 ms
[2024-05-29 21:20:57] [INFO ] Time to serialize gal into /tmp/LTL2712598709357205794.gal : 26 ms
[2024-05-29 21:20:57] [INFO ] Time to serialize properties into /tmp/LTL17406820135427898967.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2712598709357205794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17406820135427898967.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p301==1)"))U(X(("(p1014==1)")U(G("(p3506==1)"))))))
Formula 0 simplified : G!"(p301==1)" R X(!"(p1014==1)" R F!"(p3506==1)")
Detected timeout of ITS tools.
[2024-05-29 21:21:12] [INFO ] Flatten gal took : 93 ms
[2024-05-29 21:21:12] [INFO ] Applying decomposition
[2024-05-29 21:21:12] [INFO ] Flatten gal took : 107 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5767598234495156795.txt' '-o' '/tmp/graph5767598234495156795.bin' '-w' '/tmp/graph5767598234495156795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5767598234495156795.bin' '-l' '-1' '-v' '-w' '/tmp/graph5767598234495156795.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:21:13] [INFO ] Decomposing Gal with order
[2024-05-29 21:21:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:21:13] [INFO ] Removed a total of 997 redundant transitions.
[2024-05-29 21:21:14] [INFO ] Flatten gal took : 235 ms
[2024-05-29 21:21:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 31 ms.
[2024-05-29 21:21:14] [INFO ] Time to serialize gal into /tmp/LTL6606568821515100185.gal : 73 ms
[2024-05-29 21:21:14] [INFO ] Time to serialize properties into /tmp/LTL13405298296110255870.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6606568821515100185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13405298296110255870.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i12.i1.i0.u106.p301==1)"))U(X(("(i19.u326.p1014==1)")U(G("(i40.i1.i2.u1086.p3506==1)"))))))
Formula 0 simplified : G!"(i12.i1.i0.u106.p301==1)" R X(!"(i19.u326.p1014==1)" R F!"(i40.i1.i2.u1086.p3506==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13317173774504395862
[2024-05-29 21:21:29] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13317173774504395862
Running compilation step : cd /tmp/ltsmin13317173774504395862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13317173774504395862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13317173774504395862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-100B-LTLFireability-05 finished in 206777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 3908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1097 transitions
Trivial Post-agglo rules discarded 1097 transitions
Performed 1097 trivial Post agglomeration. Transition count delta: 1097
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3907 transition count 2810
Reduce places removed 1097 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2195 place count 2810 transition count 2809
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2196 place count 2809 transition count 2809
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2196 place count 2809 transition count 2014
Deduced a syphon composed of 795 places in 5 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 3786 place count 2014 transition count 2014
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3792 place count 2008 transition count 2008
Iterating global reduction 3 with 6 rules applied. Total rules applied 3798 place count 2008 transition count 2008
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3798 place count 2008 transition count 2002
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 3810 place count 2002 transition count 2002
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 0 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 5604 place count 1105 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5605 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5607 place count 1104 transition count 1103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5809 place count 1003 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6011 place count 902 transition count 1304
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 6205 place count 805 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6207 place count 803 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6208 place count 802 transition count 1399
Applied a total of 6208 rules in 787 ms. Remains 802 /3908 variables (removed 3106) and now considering 1399/3908 (removed 2509) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2024-05-29 21:21:33] [INFO ] Computed 400 invariants in 3 ms
[2024-05-29 21:21:33] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-29 21:21:33] [INFO ] Invariant cache hit.
[2024-05-29 21:21:35] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2024-05-29 21:21:35] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 21:21:35] [INFO ] Invariant cache hit.
[2024-05-29 21:21:35] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/3908 places, 1399/3908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3387 ms. Remains : 802/3908 places, 1399/3908 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s422 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-10 finished in 3451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 2 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3901 transition count 3901
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3901 transition count 3901
Applied a total of 14 rules in 526 ms. Remains 3901 /3908 variables (removed 7) and now considering 3901/3908 (removed 7) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2024-05-29 21:21:36] [INFO ] Computed 401 invariants in 8 ms
[2024-05-29 21:21:37] [INFO ] Implicit Places using invariants in 951 ms returned []
[2024-05-29 21:21:37] [INFO ] Invariant cache hit.
[2024-05-29 21:21:38] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 2492 ms to find 0 implicit places.
[2024-05-29 21:21:39] [INFO ] Invariant cache hit.
[2024-05-29 21:21:41] [INFO ] Dead Transitions using invariants and state equation in 2477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3908 places, 3901/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5496 ms. Remains : 3901/3908 places, 3901/3908 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s1245 1), p1:(NEQ s580 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 36 reset in 885 ms.
Product exploration explored 100000 steps with 3 reset in 1246 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3901 stabilizing places and 1198/3901 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 21:21:44] [INFO ] Invariant cache hit.
[2024-05-29 21:21:45] [INFO ] [Real]Absence check using 401 positive place invariants in 238 ms returned sat
[2024-05-29 21:21:47] [INFO ] After 2667ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 21:21:49] [INFO ] Deduced a trap composed of 30 places in 1164 ms of which 2 ms to minimize.
[2024-05-29 21:21:50] [INFO ] Deduced a trap composed of 32 places in 1163 ms of which 2 ms to minimize.
[2024-05-29 21:21:51] [INFO ] Deduced a trap composed of 22 places in 1160 ms of which 2 ms to minimize.
[2024-05-29 21:21:53] [INFO ] Deduced a trap composed of 26 places in 1168 ms of which 3 ms to minimize.
[2024-05-29 21:21:54] [INFO ] Deduced a trap composed of 22 places in 1144 ms of which 2 ms to minimize.
[2024-05-29 21:21:55] [INFO ] Deduced a trap composed of 19 places in 1204 ms of which 3 ms to minimize.
[2024-05-29 21:21:56] [INFO ] Deduced a trap composed of 33 places in 1186 ms of which 2 ms to minimize.
[2024-05-29 21:21:58] [INFO ] Deduced a trap composed of 48 places in 1269 ms of which 2 ms to minimize.
[2024-05-29 21:21:59] [INFO ] Deduced a trap composed of 48 places in 1213 ms of which 2 ms to minimize.
[2024-05-29 21:22:01] [INFO ] Deduced a trap composed of 39 places in 1221 ms of which 3 ms to minimize.
[2024-05-29 21:22:02] [INFO ] Deduced a trap composed of 20 places in 1054 ms of which 2 ms to minimize.
[2024-05-29 21:22:03] [INFO ] Deduced a trap composed of 46 places in 1190 ms of which 2 ms to minimize.
[2024-05-29 21:22:04] [INFO ] Deduced a trap composed of 30 places in 1144 ms of which 2 ms to minimize.
[2024-05-29 21:22:06] [INFO ] Deduced a trap composed of 24 places in 1105 ms of which 2 ms to minimize.
[2024-05-29 21:22:07] [INFO ] Deduced a trap composed of 26 places in 1130 ms of which 2 ms to minimize.
[2024-05-29 21:22:08] [INFO ] Deduced a trap composed of 33 places in 1111 ms of which 2 ms to minimize.
[2024-05-29 21:22:09] [INFO ] Deduced a trap composed of 24 places in 1075 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 21:22:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 21:22:09] [INFO ] After 25469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Finished Parikh walk after 930 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 23 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 3901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3901/3901 places, 3901/3901 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1097 transitions
Trivial Post-agglo rules discarded 1097 transitions
Performed 1097 trivial Post agglomeration. Transition count delta: 1097
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3900 transition count 2803
Reduce places removed 1097 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2195 place count 2803 transition count 2802
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2196 place count 2802 transition count 2802
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 801 Pre rules applied. Total rules applied 2196 place count 2802 transition count 2001
Deduced a syphon composed of 801 places in 4 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 3 with 1602 rules applied. Total rules applied 3798 place count 2001 transition count 2001
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 1 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 3 with 1788 rules applied. Total rules applied 5586 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5587 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5589 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5791 place count 1005 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5993 place count 904 transition count 1306
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 6187 place count 807 transition count 1403
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6189 place count 805 transition count 1401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6190 place count 804 transition count 1401
Applied a total of 6190 rules in 474 ms. Remains 804 /3901 variables (removed 3097) and now considering 1401/3901 (removed 2500) transitions.
// Phase 1: matrix 1401 rows 804 cols
[2024-05-29 21:22:10] [INFO ] Computed 400 invariants in 3 ms
[2024-05-29 21:22:11] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-29 21:22:11] [INFO ] Invariant cache hit.
[2024-05-29 21:22:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 21:22:12] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
[2024-05-29 21:22:12] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-29 21:22:12] [INFO ] Invariant cache hit.
[2024-05-29 21:22:13] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/3901 places, 1401/3901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2997 ms. Remains : 804/3901 places, 1401/3901 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/804 stabilizing places and 4/1401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 435 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 572 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-11 finished in 39065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1))))))'
Support contains 1 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 531 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:22:15] [INFO ] Computed 401 invariants in 19 ms
[2024-05-29 21:22:16] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-29 21:22:16] [INFO ] Invariant cache hit.
[2024-05-29 21:22:18] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2024-05-29 21:22:18] [INFO ] Invariant cache hit.
[2024-05-29 21:22:20] [INFO ] Dead Transitions using invariants and state equation in 2494 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5498 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2681 1), p1:(EQ s2681 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20023 reset in 571 ms.
Product exploration explored 100000 steps with 20019 reset in 619 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 191658 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191658 steps, saw 176875 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 21:22:25] [INFO ] Invariant cache hit.
[2024-05-29 21:22:26] [INFO ] [Real]Absence check using 401 positive place invariants in 258 ms returned sat
[2024-05-29 21:22:29] [INFO ] After 3970ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:22:30] [INFO ] [Nat]Absence check using 401 positive place invariants in 242 ms returned sat
[2024-05-29 21:22:33] [INFO ] After 2982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:22:34] [INFO ] Deduced a trap composed of 34 places in 1317 ms of which 2 ms to minimize.
[2024-05-29 21:22:36] [INFO ] Deduced a trap composed of 31 places in 1252 ms of which 2 ms to minimize.
[2024-05-29 21:22:37] [INFO ] Deduced a trap composed of 31 places in 1279 ms of which 2 ms to minimize.
[2024-05-29 21:22:38] [INFO ] Deduced a trap composed of 25 places in 1233 ms of which 3 ms to minimize.
[2024-05-29 21:22:40] [INFO ] Deduced a trap composed of 32 places in 1225 ms of which 2 ms to minimize.
[2024-05-29 21:22:41] [INFO ] Deduced a trap composed of 54 places in 1211 ms of which 2 ms to minimize.
[2024-05-29 21:22:42] [INFO ] Deduced a trap composed of 25 places in 1181 ms of which 2 ms to minimize.
[2024-05-29 21:22:44] [INFO ] Deduced a trap composed of 38 places in 1193 ms of which 2 ms to minimize.
[2024-05-29 21:22:45] [INFO ] Deduced a trap composed of 32 places in 1164 ms of which 2 ms to minimize.
[2024-05-29 21:22:46] [INFO ] Deduced a trap composed of 23 places in 1127 ms of which 2 ms to minimize.
[2024-05-29 21:22:47] [INFO ] Deduced a trap composed of 44 places in 1091 ms of which 2 ms to minimize.
[2024-05-29 21:22:49] [INFO ] Deduced a trap composed of 44 places in 1044 ms of which 2 ms to minimize.
[2024-05-29 21:22:50] [INFO ] Deduced a trap composed of 52 places in 1030 ms of which 2 ms to minimize.
[2024-05-29 21:22:51] [INFO ] Deduced a trap composed of 69 places in 1019 ms of which 2 ms to minimize.
[2024-05-29 21:22:52] [INFO ] Deduced a trap composed of 61 places in 976 ms of which 2 ms to minimize.
[2024-05-29 21:22:53] [INFO ] Deduced a trap composed of 43 places in 992 ms of which 1 ms to minimize.
[2024-05-29 21:22:54] [INFO ] Deduced a trap composed of 39 places in 983 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 21:22:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 21:22:54] [INFO ] After 25247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 199 ms.
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1099 transitions
Trivial Post-agglo rules discarded 1099 transitions
Performed 1099 trivial Post agglomeration. Transition count delta: 1099
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 2803
Reduce places removed 1099 places and 0 transitions.
Iterating post reduction 1 with 1099 rules applied. Total rules applied 2198 place count 2803 transition count 2803
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2198 place count 2803 transition count 2004
Deduced a syphon composed of 799 places in 5 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5598 place count 1103 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5601 place count 1102 transition count 1101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5803 place count 1001 transition count 1201
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6005 place count 900 transition count 1302
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6197 place count 804 transition count 1397
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6198 place count 804 transition count 1396
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6199 place count 804 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6200 place count 803 transition count 1395
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 6201 place count 803 transition count 1394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6202 place count 802 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6203 place count 801 transition count 1393
Applied a total of 6203 rules in 572 ms. Remains 801 /3902 variables (removed 3101) and now considering 1393/3902 (removed 2509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 801/3902 places, 1393/3902 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162993 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162993 steps, saw 102558 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1393 rows 801 cols
[2024-05-29 21:22:58] [INFO ] Computed 400 invariants in 2 ms
[2024-05-29 21:22:59] [INFO ] [Real]Absence check using 400 positive place invariants in 61 ms returned sat
[2024-05-29 21:22:59] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:22:59] [INFO ] [Nat]Absence check using 400 positive place invariants in 69 ms returned sat
[2024-05-29 21:23:00] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:23:00] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 21:23:00] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 262 ms.
Support contains 1 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 20 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 801/801 places, 1393/1393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 20 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
[2024-05-29 21:23:00] [INFO ] Invariant cache hit.
[2024-05-29 21:23:01] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-29 21:23:01] [INFO ] Invariant cache hit.
[2024-05-29 21:23:02] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
[2024-05-29 21:23:02] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-29 21:23:02] [INFO ] Invariant cache hit.
[2024-05-29 21:23:03] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2625 ms. Remains : 801/801 places, 1393/1393 transitions.
Graph (trivial) has 398 edges and 801 vertex of which 4 / 801 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2781 edges and 799 vertex of which 797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 395 edges and 795 vertex of which 4 / 795 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 793 transition count 1384
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 394 edges and 791 vertex of which 6 / 791 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 788 transition count 1375
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 392 edges and 785 vertex of which 8 / 785 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 781 transition count 1364
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 388 edges and 777 vertex of which 8 / 777 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 773 transition count 1350
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 384 edges and 769 vertex of which 8 / 769 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 765 transition count 1336
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 380 edges and 761 vertex of which 8 / 761 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 757 transition count 1322
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 376 edges and 753 vertex of which 8 / 753 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 749 transition count 1308
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 372 edges and 745 vertex of which 8 / 745 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 741 transition count 1294
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 368 edges and 737 vertex of which 8 / 737 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 733 transition count 1280
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 364 edges and 729 vertex of which 8 / 729 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 725 transition count 1266
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 721 vertex of which 8 / 721 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 717 transition count 1252
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 713 vertex of which 8 / 713 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 709 transition count 1238
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 705 vertex of which 8 / 705 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 701 transition count 1224
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 697 vertex of which 8 / 697 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 693 transition count 1210
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 689 vertex of which 8 / 689 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 685 transition count 1196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 681 vertex of which 8 / 681 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 677 transition count 1182
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 673 vertex of which 8 / 673 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 669 transition count 1168
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 665 vertex of which 8 / 665 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 661 transition count 1154
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 657 vertex of which 8 / 657 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 653 transition count 1140
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 649 vertex of which 8 / 649 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 645 transition count 1126
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 641 vertex of which 8 / 641 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 637 transition count 1112
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 633 vertex of which 8 / 633 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 629 transition count 1098
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 625 vertex of which 8 / 625 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 621 transition count 1084
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 617 vertex of which 8 / 617 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 613 transition count 1070
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 609 vertex of which 8 / 609 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 605 transition count 1056
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 601 vertex of which 8 / 601 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 597 transition count 1042
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 593 vertex of which 8 / 593 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 589 transition count 1028
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 585 vertex of which 8 / 585 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 581 transition count 1014
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 577 vertex of which 8 / 577 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 573 transition count 1000
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 569 vertex of which 8 / 569 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 565 transition count 986
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 561 vertex of which 6 / 561 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 558 transition count 972
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 276 edges and 555 vertex of which 4 / 555 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 31 with 14 rules applied. Total rules applied 581 place count 553 transition count 962
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 273 edges and 551 vertex of which 2 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 32 with 9 rules applied. Total rules applied 590 place count 550 transition count 956
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 5 rules applied. Total rules applied 595 place count 549 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 34 with 1 Pre rules applied. Total rules applied 595 place count 549 transition count 951
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 598 place count 547 transition count 951
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 601 place count 545 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 34 with 3 rules applied. Total rules applied 604 place count 545 transition count 947
Applied a total of 604 rules in 119 ms. Remains 545 /801 variables (removed 256) and now considering 947/1393 (removed 446) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 947 rows 545 cols
[2024-05-29 21:23:03] [INFO ] Computed 272 invariants in 2 ms
[2024-05-29 21:23:03] [INFO ] [Real]Absence check using 272 positive place invariants in 40 ms returned sat
[2024-05-29 21:23:04] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:23:04] [INFO ] [Nat]Absence check using 272 positive place invariants in 34 ms returned sat
[2024-05-29 21:23:04] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:23:04] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-29 21:23:04] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 256 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:23:05] [INFO ] Computed 401 invariants in 14 ms
[2024-05-29 21:23:06] [INFO ] Implicit Places using invariants in 991 ms returned []
[2024-05-29 21:23:06] [INFO ] Invariant cache hit.
[2024-05-29 21:23:07] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
[2024-05-29 21:23:07] [INFO ] Invariant cache hit.
[2024-05-29 21:23:10] [INFO ] Dead Transitions using invariants and state equation in 2517 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5401 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 191137 steps, run timeout after 3004 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191137 steps, saw 176677 distinct states, run finished after 3004 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 21:23:14] [INFO ] Invariant cache hit.
[2024-05-29 21:23:14] [INFO ] [Real]Absence check using 401 positive place invariants in 261 ms returned sat
[2024-05-29 21:23:18] [INFO ] After 3998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:23:18] [INFO ] [Nat]Absence check using 401 positive place invariants in 243 ms returned sat
[2024-05-29 21:23:21] [INFO ] After 3011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:23:23] [INFO ] Deduced a trap composed of 34 places in 1370 ms of which 2 ms to minimize.
[2024-05-29 21:23:24] [INFO ] Deduced a trap composed of 31 places in 1283 ms of which 4 ms to minimize.
[2024-05-29 21:23:26] [INFO ] Deduced a trap composed of 31 places in 1223 ms of which 2 ms to minimize.
[2024-05-29 21:23:27] [INFO ] Deduced a trap composed of 25 places in 1155 ms of which 2 ms to minimize.
[2024-05-29 21:23:28] [INFO ] Deduced a trap composed of 32 places in 1252 ms of which 2 ms to minimize.
[2024-05-29 21:23:30] [INFO ] Deduced a trap composed of 54 places in 1239 ms of which 2 ms to minimize.
[2024-05-29 21:23:31] [INFO ] Deduced a trap composed of 25 places in 1131 ms of which 2 ms to minimize.
[2024-05-29 21:23:32] [INFO ] Deduced a trap composed of 38 places in 1214 ms of which 5 ms to minimize.
[2024-05-29 21:23:34] [INFO ] Deduced a trap composed of 32 places in 1200 ms of which 2 ms to minimize.
[2024-05-29 21:23:35] [INFO ] Deduced a trap composed of 23 places in 1174 ms of which 2 ms to minimize.
[2024-05-29 21:23:36] [INFO ] Deduced a trap composed of 44 places in 1163 ms of which 2 ms to minimize.
[2024-05-29 21:23:37] [INFO ] Deduced a trap composed of 44 places in 1149 ms of which 2 ms to minimize.
[2024-05-29 21:23:39] [INFO ] Deduced a trap composed of 52 places in 1166 ms of which 2 ms to minimize.
[2024-05-29 21:23:40] [INFO ] Deduced a trap composed of 69 places in 1048 ms of which 2 ms to minimize.
[2024-05-29 21:23:41] [INFO ] Deduced a trap composed of 61 places in 1071 ms of which 2 ms to minimize.
[2024-05-29 21:23:42] [INFO ] Deduced a trap composed of 43 places in 1079 ms of which 2 ms to minimize.
[2024-05-29 21:23:43] [INFO ] Deduced a trap composed of 39 places in 1008 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 21:23:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 21:23:43] [INFO ] After 25891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 191 ms.
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1099 transitions
Trivial Post-agglo rules discarded 1099 transitions
Performed 1099 trivial Post agglomeration. Transition count delta: 1099
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 2803
Reduce places removed 1099 places and 0 transitions.
Iterating post reduction 1 with 1099 rules applied. Total rules applied 2198 place count 2803 transition count 2803
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2198 place count 2803 transition count 2004
Deduced a syphon composed of 799 places in 6 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5598 place count 1103 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5601 place count 1102 transition count 1101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5803 place count 1001 transition count 1201
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6005 place count 900 transition count 1302
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6197 place count 804 transition count 1397
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6198 place count 804 transition count 1396
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6199 place count 804 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6200 place count 803 transition count 1395
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 6201 place count 803 transition count 1394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6202 place count 802 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6203 place count 801 transition count 1393
Applied a total of 6203 rules in 520 ms. Remains 801 /3902 variables (removed 3101) and now considering 1393/3902 (removed 2509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 801/3902 places, 1393/3902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 148833 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148833 steps, saw 93959 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1393 rows 801 cols
[2024-05-29 21:23:47] [INFO ] Computed 400 invariants in 2 ms
[2024-05-29 21:23:48] [INFO ] [Real]Absence check using 400 positive place invariants in 65 ms returned sat
[2024-05-29 21:23:48] [INFO ] After 745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 21:23:48] [INFO ] [Nat]Absence check using 400 positive place invariants in 63 ms returned sat
[2024-05-29 21:23:49] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 21:23:49] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 21:23:49] [INFO ] After 971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 11546 steps, including 617 resets, run visited all 2 properties in 166 ms. (steps per millisecond=69 )
Parikh walk visited 2 properties in 165 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20028 reset in 598 ms.
Product exploration explored 100000 steps with 19963 reset in 603 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Performed 1099 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 3902
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1099 place count 3902 transition count 4302
Deduced a syphon composed of 1499 places in 11 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1499 place count 3902 transition count 4302
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2699 places in 8 ms
Iterating global reduction 1 with 1200 rules applied. Total rules applied 2699 place count 3902 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2700 place count 3902 transition count 4301
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 3500 place count 3102 transition count 3501
Deduced a syphon composed of 1899 places in 7 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 4300 place count 3102 transition count 3501
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1900 places in 6 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4301 place count 3102 transition count 3501
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4303 place count 3100 transition count 3499
Deduced a syphon composed of 1898 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4305 place count 3100 transition count 3499
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1999 places in 18 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4406 place count 3100 transition count 4231
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4507 place count 2999 transition count 4029
Deduced a syphon composed of 1898 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4608 place count 2999 transition count 4029
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -727
Deduced a syphon composed of 1999 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4709 place count 2999 transition count 4756
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4810 place count 2898 transition count 4554
Deduced a syphon composed of 1898 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4911 place count 2898 transition count 4554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -736
Deduced a syphon composed of 1999 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5012 place count 2898 transition count 5290
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5113 place count 2797 transition count 5088
Deduced a syphon composed of 1898 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5214 place count 2797 transition count 5088
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1993 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5309 place count 2797 transition count 5771
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 5404 place count 2702 transition count 5581
Deduced a syphon composed of 1898 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5499 place count 2702 transition count 5581
Deduced a syphon composed of 1898 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5502 place count 2702 transition count 5578
Deduced a syphon composed of 1898 places in 1 ms
Applied a total of 5502 rules in 2766 ms. Remains 2702 /3902 variables (removed 1200) and now considering 5578/3902 (removed -1676) transitions.
[2024-05-29 21:23:54] [INFO ] Redundant transitions in 203 ms returned []
// Phase 1: matrix 5578 rows 2702 cols
[2024-05-29 21:23:54] [INFO ] Computed 401 invariants in 61 ms
[2024-05-29 21:23:58] [INFO ] Dead Transitions using invariants and state equation in 3438 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2702/3902 places, 5578/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6421 ms. Remains : 2702/3902 places, 5578/3902 transitions.
Built C files in :
/tmp/ltsmin4138618115751879827
[2024-05-29 21:23:58] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4138618115751879827
Running compilation step : cd /tmp/ltsmin4138618115751879827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4138618115751879827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4138618115751879827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 264 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:24:01] [INFO ] Computed 401 invariants in 15 ms
[2024-05-29 21:24:02] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-29 21:24:02] [INFO ] Invariant cache hit.
[2024-05-29 21:24:04] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2724 ms to find 0 implicit places.
[2024-05-29 21:24:04] [INFO ] Invariant cache hit.
[2024-05-29 21:24:06] [INFO ] Dead Transitions using invariants and state equation in 2497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5490 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Built C files in :
/tmp/ltsmin17707764752490960747
[2024-05-29 21:24:06] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17707764752490960747
Running compilation step : cd /tmp/ltsmin17707764752490960747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17707764752490960747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17707764752490960747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 21:24:10] [INFO ] Flatten gal took : 67 ms
[2024-05-29 21:24:10] [INFO ] Flatten gal took : 81 ms
[2024-05-29 21:24:10] [INFO ] Time to serialize gal into /tmp/LTL6691711191934281304.gal : 29 ms
[2024-05-29 21:24:10] [INFO ] Time to serialize properties into /tmp/LTL14683038763648525925.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6691711191934281304.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7697814706435378926.hoa' '-atoms' '/tmp/LTL14683038763648525925.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14683038763648525925.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7697814706435378926.hoa
Detected timeout of ITS tools.
[2024-05-29 21:24:25] [INFO ] Flatten gal took : 69 ms
[2024-05-29 21:24:25] [INFO ] Flatten gal took : 69 ms
[2024-05-29 21:24:25] [INFO ] Time to serialize gal into /tmp/LTL15899007917642290848.gal : 13 ms
[2024-05-29 21:24:25] [INFO ] Time to serialize properties into /tmp/LTL15183796281419081862.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15899007917642290848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15183796281419081862.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(p3426==1)")||(X(X(X("(p3426==0)")))))))
Formula 0 simplified : F(!"(p3426==1)" & XXX!"(p3426==0)")
Detected timeout of ITS tools.
[2024-05-29 21:24:40] [INFO ] Flatten gal took : 63 ms
[2024-05-29 21:24:40] [INFO ] Applying decomposition
[2024-05-29 21:24:40] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1139897782442045215.txt' '-o' '/tmp/graph1139897782442045215.bin' '-w' '/tmp/graph1139897782442045215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1139897782442045215.bin' '-l' '-1' '-v' '-w' '/tmp/graph1139897782442045215.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:24:40] [INFO ] Decomposing Gal with order
[2024-05-29 21:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:24:41] [INFO ] Removed a total of 990 redundant transitions.
[2024-05-29 21:24:41] [INFO ] Flatten gal took : 156 ms
[2024-05-29 21:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2024-05-29 21:24:41] [INFO ] Time to serialize gal into /tmp/LTL10385883465349228498.gal : 38 ms
[2024-05-29 21:24:41] [INFO ] Time to serialize properties into /tmp/LTL17744939846571421187.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10385883465349228498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17744939846571421187.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("(i40.i1.i4.u1058.p3426==1)")||(X(X(X("(i40.i1.i4.u1058.p3426==0)")))))))
Formula 0 simplified : F(!"(i40.i1.i4.u1058.p3426==1)" & XXX!"(i40.i1.i4.u1058.p3426==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5428492325977206165
[2024-05-29 21:24:56] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5428492325977206165
Running compilation step : cd /tmp/ltsmin5428492325977206165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5428492325977206165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5428492325977206165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-100B-LTLFireability-12 finished in 164735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(G(p1))&&F(p2)))))'
Support contains 4 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 545 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-29 21:25:00] [INFO ] Computed 401 invariants in 15 ms
[2024-05-29 21:25:01] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-29 21:25:01] [INFO ] Invariant cache hit.
[2024-05-29 21:25:03] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
[2024-05-29 21:25:03] [INFO ] Invariant cache hit.
[2024-05-29 21:25:05] [INFO ] Dead Transitions using invariants and state equation in 2608 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5855 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s1262 1) (EQ s1276 1)), p2:(EQ s3849 1), p1:(NEQ s3241 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 82663 steps with 8 reset in 769 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-13 finished in 6965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 3908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3907 transition count 2812
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2812 transition count 2811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2811 transition count 2811
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2192 place count 2811 transition count 2016
Deduced a syphon composed of 795 places in 6 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 3782 place count 2016 transition count 2016
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 3788 place count 2010 transition count 2010
Iterating global reduction 3 with 6 rules applied. Total rules applied 3794 place count 2010 transition count 2010
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3794 place count 2010 transition count 2004
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 3806 place count 2004 transition count 2004
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 3 with 1798 rules applied. Total rules applied 5604 place count 1105 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5605 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5607 place count 1104 transition count 1103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5809 place count 1003 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6011 place count 902 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6201 place count 807 transition count 1397
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6203 place count 805 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6204 place count 804 transition count 1395
Applied a total of 6204 rules in 569 ms. Remains 804 /3908 variables (removed 3104) and now considering 1395/3908 (removed 2513) transitions.
// Phase 1: matrix 1395 rows 804 cols
[2024-05-29 21:25:07] [INFO ] Computed 400 invariants in 3 ms
[2024-05-29 21:25:07] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-29 21:25:07] [INFO ] Invariant cache hit.
[2024-05-29 21:25:09] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2024-05-29 21:25:09] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-29 21:25:09] [INFO ] Invariant cache hit.
[2024-05-29 21:25:09] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/3908 places, 1395/3908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3092 ms. Remains : 804/3908 places, 1395/3908 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s427 1) (EQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-14 finished in 3144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(F(p0)) U G((p1 U p2)))) U p3)))'
Support contains 6 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3901 transition count 3901
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3901 transition count 3901
Applied a total of 14 rules in 547 ms. Remains 3901 /3908 variables (removed 7) and now considering 3901/3908 (removed 7) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2024-05-29 21:25:10] [INFO ] Computed 401 invariants in 27 ms
[2024-05-29 21:25:11] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2024-05-29 21:25:11] [INFO ] Invariant cache hit.
[2024-05-29 21:25:12] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2024-05-29 21:25:12] [INFO ] Invariant cache hit.
[2024-05-29 21:25:15] [INFO ] Dead Transitions using invariants and state equation in 2597 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3908 places, 3901/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5669 ms. Remains : 3901/3908 places, 3901/3908 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(OR (EQ s851 1) (EQ s1240 1)), p2:(AND (EQ s3648 1) (EQ s3652 1) (EQ s3665 1)), p1:(EQ s851 1), p0:(EQ s1623 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 91 reset in 656 ms.
Product exploration explored 100000 steps with 93 reset in 738 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3901 stabilizing places and 1198/3901 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p3)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p2) p1))), true, (X (X (NOT p0))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 131 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter sensitive) to 6 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 21:25:18] [INFO ] Invariant cache hit.
[2024-05-29 21:25:19] [INFO ] [Real]Absence check using 401 positive place invariants in 250 ms returned sat
[2024-05-29 21:25:19] [INFO ] After 1031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 21:25:20] [INFO ] [Nat]Absence check using 401 positive place invariants in 252 ms returned sat
[2024-05-29 21:25:24] [INFO ] After 3899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 21:25:25] [INFO ] Deduced a trap composed of 20 places in 1087 ms of which 2 ms to minimize.
[2024-05-29 21:25:26] [INFO ] Deduced a trap composed of 31 places in 1057 ms of which 2 ms to minimize.
[2024-05-29 21:25:27] [INFO ] Deduced a trap composed of 34 places in 1004 ms of which 2 ms to minimize.
[2024-05-29 21:25:28] [INFO ] Deduced a trap composed of 21 places in 1145 ms of which 2 ms to minimize.
[2024-05-29 21:25:30] [INFO ] Deduced a trap composed of 36 places in 1015 ms of which 3 ms to minimize.
[2024-05-29 21:25:31] [INFO ] Deduced a trap composed of 36 places in 1044 ms of which 2 ms to minimize.
[2024-05-29 21:25:32] [INFO ] Deduced a trap composed of 31 places in 1072 ms of which 2 ms to minimize.
[2024-05-29 21:25:33] [INFO ] Deduced a trap composed of 58 places in 1021 ms of which 2 ms to minimize.
[2024-05-29 21:25:34] [INFO ] Deduced a trap composed of 44 places in 1079 ms of which 3 ms to minimize.
[2024-05-29 21:25:35] [INFO ] Deduced a trap composed of 44 places in 995 ms of which 2 ms to minimize.
[2024-05-29 21:25:37] [INFO ] Deduced a trap composed of 48 places in 1005 ms of which 2 ms to minimize.
[2024-05-29 21:25:38] [INFO ] Deduced a trap composed of 32 places in 986 ms of which 2 ms to minimize.
[2024-05-29 21:25:39] [INFO ] Deduced a trap composed of 38 places in 967 ms of which 2 ms to minimize.
[2024-05-29 21:25:40] [INFO ] Deduced a trap composed of 40 places in 976 ms of which 2 ms to minimize.
[2024-05-29 21:25:41] [INFO ] Deduced a trap composed of 39 places in 965 ms of which 2 ms to minimize.
[2024-05-29 21:25:42] [INFO ] Deduced a trap composed of 45 places in 931 ms of which 2 ms to minimize.
[2024-05-29 21:25:43] [INFO ] Deduced a trap composed of 42 places in 952 ms of which 2 ms to minimize.
[2024-05-29 21:25:44] [INFO ] Deduced a trap composed of 54 places in 940 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 21:25:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 21:25:44] [INFO ] After 25457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 334 ms.
Support contains 5 out of 3901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3901/3901 places, 3901/3901 transitions.
Drop transitions removed 1094 transitions
Trivial Post-agglo rules discarded 1094 transitions
Performed 1094 trivial Post agglomeration. Transition count delta: 1094
Iterating post reduction 0 with 1094 rules applied. Total rules applied 1094 place count 3901 transition count 2807
Reduce places removed 1094 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2190 place count 2807 transition count 2805
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2192 place count 2805 transition count 2805
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2192 place count 2805 transition count 2007
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3788 place count 2007 transition count 2007
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5588 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5589 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5591 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5793 place count 1005 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5995 place count 904 transition count 1305
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6185 place count 809 transition count 1399
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6186 place count 809 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6187 place count 808 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6188 place count 807 transition count 1397
Applied a total of 6188 rules in 471 ms. Remains 807 /3901 variables (removed 3094) and now considering 1397/3901 (removed 2504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 807/3901 places, 1397/3901 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Finished probabilistic random walk after 50834 steps, run visited all 3 properties in 1218 ms. (steps per millisecond=41 )
Probabilistic random walk after 50834 steps, saw 31855 distinct states, run finished after 1219 ms. (steps per millisecond=41 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p3)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 (NOT p2) p1))), true, (X (X (NOT p0))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p0), (F (AND p1 (NOT p2) p3)), (F p3), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (F (AND p1 (NOT p2))), (F (OR p1 p2))]
Knowledge based reduction with 14 factoid took 445 ms. Reduced automaton from 6 states, 21 edges and 4 AP (stutter insensitive) to 6 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 264 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p2)]
[2024-05-29 21:25:48] [INFO ] Invariant cache hit.
[2024-05-29 21:25:51] [INFO ] [Real]Absence check using 401 positive place invariants in 936 ms returned sat
[2024-05-29 21:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 21:26:03] [INFO ] [Real]Absence check using state equation in 11854 ms returned unknown
Could not prove EG (NOT p3)
Support contains 6 out of 3901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3901/3901 places, 3901/3901 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1093 transitions
Trivial Post-agglo rules discarded 1093 transitions
Performed 1093 trivial Post agglomeration. Transition count delta: 1093
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 3900 transition count 2807
Reduce places removed 1093 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2189 place count 2807 transition count 2804
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2192 place count 2804 transition count 2804
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2192 place count 2804 transition count 2006
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3788 place count 2006 transition count 2006
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 0 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 3 with 1792 rules applied. Total rules applied 5580 place count 1110 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5581 place count 1110 transition count 1109
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5583 place count 1109 transition count 1108
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5785 place count 1008 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5987 place count 907 transition count 1308
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6177 place count 812 transition count 1402
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6179 place count 810 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6180 place count 809 transition count 1400
Applied a total of 6180 rules in 495 ms. Remains 809 /3901 variables (removed 3092) and now considering 1400/3901 (removed 2501) transitions.
// Phase 1: matrix 1400 rows 809 cols
[2024-05-29 21:26:03] [INFO ] Computed 400 invariants in 4 ms
[2024-05-29 21:26:04] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-05-29 21:26:04] [INFO ] Invariant cache hit.
[2024-05-29 21:26:04] [INFO ] State equation strengthened by 402 read => feed constraints.
[2024-05-29 21:26:08] [INFO ] Implicit Places using invariants and state equation in 3855 ms returned []
Implicit Place search using SMT with State Equation took 4379 ms to find 0 implicit places.
[2024-05-29 21:26:08] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-29 21:26:08] [INFO ] Invariant cache hit.
[2024-05-29 21:26:08] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 809/3901 places, 1400/3901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5624 ms. Remains : 809/3901 places, 1400/3901 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/809 stabilizing places and 2/1400 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) p3))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p3))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 375 ms. Reduced automaton from 6 states, 21 edges and 4 AP (stutter insensitive) to 6 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 21:26:10] [INFO ] Invariant cache hit.
[2024-05-29 21:26:10] [INFO ] [Real]Absence check using 400 positive place invariants in 67 ms returned sat
[2024-05-29 21:26:10] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 21:26:10] [INFO ] [Nat]Absence check using 400 positive place invariants in 61 ms returned sat
[2024-05-29 21:26:11] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 21:26:11] [INFO ] State equation strengthened by 402 read => feed constraints.
[2024-05-29 21:26:11] [INFO ] After 710ms SMT Verify possible using 402 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 21:26:11] [INFO ] After 920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-29 21:26:12] [INFO ] After 1834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 358 ms.
Support contains 5 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 1400/1400 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 809 transition count 1399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 808 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 807 transition count 1397
Applied a total of 4 rules in 69 ms. Remains 807 /809 variables (removed 2) and now considering 1397/1400 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 807/809 places, 1397/1400 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Finished probabilistic random walk after 26049 steps, run visited all 3 properties in 841 ms. (steps per millisecond=30 )
Probabilistic random walk after 26049 steps, saw 17544 distinct states, run finished after 842 ms. (steps per millisecond=30 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) p3))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p3))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p0), (F (AND p1 (NOT p2) p3)), (F p3), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (F (AND p1 (NOT p2))), (F (OR p1 p2))]
Knowledge based reduction with 11 factoid took 631 ms. Reduced automaton from 6 states, 21 edges and 4 AP (stutter insensitive) to 6 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p2)]
[2024-05-29 21:26:14] [INFO ] Invariant cache hit.
[2024-05-29 21:26:16] [INFO ] [Real]Absence check using 400 positive place invariants in 224 ms returned sat
[2024-05-29 21:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 21:26:17] [INFO ] [Real]Absence check using state equation in 1247 ms returned sat
[2024-05-29 21:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:26:18] [INFO ] [Nat]Absence check using 400 positive place invariants in 209 ms returned sat
[2024-05-29 21:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 21:26:19] [INFO ] [Nat]Absence check using state equation in 1316 ms returned sat
[2024-05-29 21:26:19] [INFO ] State equation strengthened by 402 read => feed constraints.
[2024-05-29 21:26:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-29 21:26:25] [INFO ] [Nat]Added 402 Read/Feed constraints in 6056 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 281 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (NOT p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-15 finished in 76227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p1||X(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((p1 U G(p2)))))'
Found a Lengthening insensitive property : ShieldRVt-PT-100B-LTLFireability-05
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 3 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1097 transitions
Trivial Post-agglo rules discarded 1097 transitions
Performed 1097 trivial Post agglomeration. Transition count delta: 1097
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3907 transition count 2810
Reduce places removed 1097 places and 0 transitions.
Iterating post reduction 1 with 1097 rules applied. Total rules applied 2194 place count 2810 transition count 2810
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2194 place count 2810 transition count 2014
Deduced a syphon composed of 796 places in 5 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3786 place count 2014 transition count 2014
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 3791 place count 2009 transition count 2009
Iterating global reduction 2 with 5 rules applied. Total rules applied 3796 place count 2009 transition count 2009
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 3796 place count 2009 transition count 2004
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 3806 place count 2004 transition count 2004
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 0 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 2 with 1794 rules applied. Total rules applied 5600 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5601 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5603 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5805 place count 1005 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6007 place count 904 transition count 1306
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6201 place count 807 transition count 1403
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6203 place count 805 transition count 1401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6204 place count 804 transition count 1401
Applied a total of 6204 rules in 592 ms. Remains 804 /3908 variables (removed 3104) and now considering 1401/3908 (removed 2507) transitions.
// Phase 1: matrix 1401 rows 804 cols
[2024-05-29 21:26:27] [INFO ] Computed 400 invariants in 3 ms
[2024-05-29 21:26:27] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-29 21:26:27] [INFO ] Invariant cache hit.
[2024-05-29 21:26:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 21:26:28] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2024-05-29 21:26:28] [INFO ] Invariant cache hit.
[2024-05-29 21:26:29] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 804/3908 places, 1401/3908 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3222 ms. Remains : 804/3908 places, 1401/3908 transitions.
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s35 1), p2:(EQ s561 1), p1:(EQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldRVt-PT-100B-LTLFireability-05 finished in 3473 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1))))))'
[2024-05-29 21:26:29] [INFO ] Flatten gal took : 64 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16619349698322309595
[2024-05-29 21:26:29] [INFO ] Too many transitions (3908) to apply POR reductions. Disabling POR matrices.
[2024-05-29 21:26:29] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16619349698322309595
Running compilation step : cd /tmp/ltsmin16619349698322309595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 21:26:29] [INFO ] Applying decomposition
[2024-05-29 21:26:29] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16780364917827320520.txt' '-o' '/tmp/graph16780364917827320520.bin' '-w' '/tmp/graph16780364917827320520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16780364917827320520.bin' '-l' '-1' '-v' '-w' '/tmp/graph16780364917827320520.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:26:30] [INFO ] Decomposing Gal with order
[2024-05-29 21:26:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:26:30] [INFO ] Removed a total of 986 redundant transitions.
[2024-05-29 21:26:30] [INFO ] Flatten gal took : 149 ms
[2024-05-29 21:26:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-29 21:26:30] [INFO ] Time to serialize gal into /tmp/LTLFireability10630357010665468259.gal : 35 ms
[2024-05-29 21:26:30] [INFO ] Time to serialize properties into /tmp/LTLFireability8214658444440657966.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10630357010665468259.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8214658444440657966.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(("(i17.u334.p1039==0)")&&(X(G(("(i47.i1.i4.u1272.p4115==0)")||(X("(i51.i0.i2.u1410.p4572==0)"))))))))
Formula 0 simplified : X(!"(i17.u334.p1039==0)" | XF(!"(i47.i1.i4.u1272.p4115==0)" & X!"(i51.i0.i2.u1410.p4572==0)"))
Compilation finished in 10766 ms.
Running link step : cd /tmp/ltsmin16619349698322309595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin16619349698322309595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&X([](((LTLAPp1==true)||X((LTLAPp2==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 21:50:25] [INFO ] Applying decomposition
[2024-05-29 21:50:26] [INFO ] Flatten gal took : 293 ms
[2024-05-29 21:50:26] [INFO ] Decomposing Gal with order
[2024-05-29 21:50:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:50:28] [INFO ] Removed a total of 297 redundant transitions.
[2024-05-29 21:50:28] [INFO ] Flatten gal took : 461 ms
[2024-05-29 21:50:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-29 21:50:29] [INFO ] Time to serialize gal into /tmp/LTLFireability13579933249174503433.gal : 78 ms
[2024-05-29 21:50:29] [INFO ] Time to serialize properties into /tmp/LTLFireability7309895587039071636.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13579933249174503433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7309895587039071636.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....440
Formula 0 simplified : X(!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...430
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin16619349698322309595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&X([](((LTLAPp1==true)||X((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16619349698322309595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp6==true)||X(X(X((LTLAPp7==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 22:14:25] [INFO ] Flatten gal took : 137 ms
[2024-05-29 22:14:25] [INFO ] Input system was already deterministic with 3908 transitions.
[2024-05-29 22:14:25] [INFO ] Transformed 3908 places.
[2024-05-29 22:14:25] [INFO ] Transformed 3908 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 22:14:27] [INFO ] Time to serialize gal into /tmp/LTLFireability3761626786385829756.gal : 19 ms
[2024-05-29 22:14:27] [INFO ] Time to serialize properties into /tmp/LTLFireability3940133303865314314.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3761626786385829756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3940133303865314314.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("(p1039==0)")&&(X(G(("(p4115==0)")||(X("(p4572==0)"))))))))
Formula 0 simplified : X(!"(p1039==0)" | XF(!"(p4115==0)" & X!"(p4572==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12634648 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14375068 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVt-PT-100B, 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 r373-tall-171683789900658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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