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.r224-tall-171649612400243.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 itstools
Input is LamportFastMutEx-COL-7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612400243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Apr 13 07:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 07:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 13 07:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 07:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 07:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 13 07:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716566282235

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-24 15:58:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 15:58:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:58:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 15:58:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 15:58:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 593 ms
[2024-05-24 15:58:04] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 15:58:04] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 9 ms.
[2024-05-24 15:58:04] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 7 formulas.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 17485 steps (3 resets) in 128 ms. (135 steps per ms) remains 0/19 properties
[2024-05-24 15:58:04] [INFO ] Flatten gal took : 32 ms
[2024-05-24 15:58:04] [INFO ] Flatten gal took : 3 ms
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 15:58:04] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 36 ms.
[2024-05-24 15:58:04] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 74 transitions.
Support contains 175 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 12 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2024-05-24 15:58:04] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2024-05-24 15:58:04] [INFO ] Computed 65 invariants in 17 ms
[2024-05-24 15:58:05] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-24 15:58:05] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-05-24 15:58:05] [INFO ] Invariant cache hit.
[2024-05-24 15:58:05] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-24 15:58:05] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-05-24 15:58:05] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-05-24 15:58:05] [INFO ] Invariant cache hit.
[2024-05-24 15:58:05] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-24 15:58:07] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 20 ms to minimize.
[2024-05-24 15:58:07] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 6 solved, 449 unsolved
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 15:58:10] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2024-05-24 15:58:10] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2024-05-24 15:58:10] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:58:10] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 1 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 9 solved, 446 unsolved
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 3 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-24 15:58:14] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:14] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-05-24 15:58:15] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:58:15] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-24 15:58:15] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 17 solved, 438 unsolved
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/165 constraints. Problems are: Problem set: 23 solved, 432 unsolved
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
Problem TDEAD121 is UNSAT
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/185 constraints. Problems are: Problem set: 41 solved, 414 unsolved
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/205 constraints. Problems are: Problem set: 41 solved, 414 unsolved
[2024-05-24 15:58:26] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-05-24 15:58:26] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-05-24 15:58:26] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:58:28] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-24 15:58:28] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:58:28] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-24 15:58:28] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:58:28] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/225 constraints. Problems are: Problem set: 41 solved, 414 unsolved
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-05-24 15:58:30] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:58:30] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:58:30] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:58:30] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:58:30] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/245 constraints. Problems are: Problem set: 42 solved, 413 unsolved
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:35] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-24 15:58:35] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:35] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:35] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:58:35] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
SMT process timed out in 30328ms, After SMT, problems are : Problem set: 42 solved, 413 unsolved
Search for dead transitions found 42 dead transitions in 30346ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 219/219 places, 420/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31038 ms. Remains : 219/219 places, 420/462 transitions.
Support contains 175 out of 219 places after structural reductions.
[2024-05-24 15:58:35] [INFO ] Flatten gal took : 40 ms
[2024-05-24 15:58:35] [INFO ] Flatten gal took : 34 ms
[2024-05-24 15:58:35] [INFO ] Input system was already deterministic with 420 transitions.
RANDOM walk for 10060 steps (1 resets) in 197 ms. (50 steps per ms) remains 0/18 properties
Computed a total of 1 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((p0&&(G(X(!(p0 U p1)))||p1))))))'
Support contains 70 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 20 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-24 15:58:36] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2024-05-24 15:58:36] [INFO ] Computed 65 invariants in 3 ms
[2024-05-24 15:58:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-24 15:58:36] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 15:58:36] [INFO ] Invariant cache hit.
[2024-05-24 15:58:36] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-24 15:58:36] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-24 15:58:36] [INFO ] Redundant transitions in 26 ms returned []
Running 413 sub problems to find dead transitions.
[2024-05-24 15:58:36] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 15:58:36] [INFO ] Invariant cache hit.
[2024-05-24 15:58:36] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:58:45] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:45] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-24 15:58:45] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:58:45] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-24 15:58:45] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-24 15:58:45] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 3 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 3 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:58:54] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:58:55] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2024-05-24 15:58:55] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:58:55] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-05-24 15:58:55] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-24 15:58:55] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-24 15:58:56] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:58:57] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-24 15:58:57] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:58:57] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:58:57] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:58:57] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:58:59] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:00] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:01] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:59:01] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 15:59:01] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-24 15:59:01] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-24 15:59:01] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:01] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-24 15:59:01] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:59:01] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-05-24 15:59:02] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-24 15:59:03] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:04] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:06] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-24 15:59:06] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-05-24 15:59:06] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 30228ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30233ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30673 ms. Remains : 219/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-01
Product exploration explored 100000 steps with 5664 reset in 510 ms.
Product exploration explored 100000 steps with 5640 reset in 367 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 260 steps (0 resets) in 7 ms. (32 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 308 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Support contains 70 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 21 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-24 15:59:08] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 15:59:08] [INFO ] Invariant cache hit.
[2024-05-24 15:59:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-24 15:59:09] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 15:59:09] [INFO ] Invariant cache hit.
[2024-05-24 15:59:09] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-24 15:59:09] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-24 15:59:09] [INFO ] Redundant transitions in 6 ms returned []
Running 413 sub problems to find dead transitions.
[2024-05-24 15:59:09] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 15:59:09] [INFO ] Invariant cache hit.
[2024-05-24 15:59:09] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:12] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:59:14] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:14] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-24 15:59:14] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:14] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:14] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:14] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-24 15:59:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:15] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-24 15:59:16] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:21] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:59:21] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:21] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:21] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 4 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:27] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:59:27] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-05-24 15:59:27] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:59:27] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:59:29] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-24 15:59:29] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:29] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-24 15:59:29] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:30] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 15:59:38] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-24 15:59:38] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-24 15:59:38] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:59:38] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
SMT process timed out in 30194ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30199ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30655 ms. Remains : 219/219 places, 420/420 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 222 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 174 steps (0 resets) in 8 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 5636 reset in 296 ms.
Product exploration explored 100000 steps with 5644 reset in 316 ms.
Built C files in :
/tmp/ltsmin7576408587952392934
[2024-05-24 15:59:41] [INFO ] Computing symmetric may disable matrix : 420 transitions.
[2024-05-24 15:59:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:59:41] [INFO ] Computing symmetric may enable matrix : 420 transitions.
[2024-05-24 15:59:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:59:41] [INFO ] Computing Do-Not-Accords matrix : 420 transitions.
[2024-05-24 15:59:41] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:59:41] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7576408587952392934
Running compilation step : cd /tmp/ltsmin7576408587952392934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1245 ms.
Running link step : cd /tmp/ltsmin7576408587952392934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7576408587952392934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15953671948571598127.hoa' '--buchi-type=spotba'
LTSmin run took 8465 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-01 finished in 74962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 50 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2024-05-24 15:59:51] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
// Phase 1: matrix 301 rows 212 cols
[2024-05-24 15:59:51] [INFO ] Computed 65 invariants in 2 ms
[2024-05-24 15:59:51] [INFO ] Implicit Places using invariants in 169 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 171 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 406
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 406
Applied a total of 14 rules in 18 ms. Remains 198 /205 variables (removed 7) and now considering 406/413 (removed 7) transitions.
[2024-05-24 15:59:51] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 198 cols
[2024-05-24 15:59:51] [INFO ] Computed 58 invariants in 2 ms
[2024-05-24 15:59:51] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-24 15:59:51] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2024-05-24 15:59:51] [INFO ] Invariant cache hit.
[2024-05-24 15:59:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-24 15:59:52] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 406/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 937 ms. Remains : 198/219 places, 406/420 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 246 ms.
Stack based approach found an accepted trace after 396 steps with 0 reset with depth 397 and stack size 397 in 2 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-02 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 16 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2024-05-24 15:59:52] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
// Phase 1: matrix 301 rows 212 cols
[2024-05-24 15:59:52] [INFO ] Computed 65 invariants in 2 ms
[2024-05-24 15:59:52] [INFO ] Implicit Places using invariants in 138 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 144 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 205/219 places, 413/420 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-04
Product exploration explored 100000 steps with 1839 reset in 257 ms.
Product exploration explored 100000 steps with 1869 reset in 276 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 113 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 49 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 413/413 transitions.
Applied a total of 0 rules in 14 ms. Remains 205 /205 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-05-24 15:59:53] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
// Phase 1: matrix 301 rows 205 cols
[2024-05-24 15:59:53] [INFO ] Computed 58 invariants in 3 ms
[2024-05-24 15:59:53] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-24 15:59:53] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
[2024-05-24 15:59:53] [INFO ] Invariant cache hit.
[2024-05-24 15:59:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-24 15:59:54] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-24 15:59:54] [INFO ] Redundant transitions in 1 ms returned []
Running 406 sub problems to find dead transitions.
[2024-05-24 15:59:54] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
[2024-05-24 15:59:54] [INFO ] Invariant cache hit.
[2024-05-24 15:59:54] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 7/205 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:05] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:05] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:00:05] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:05] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:05] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-24 16:00:05] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:06] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:00:09] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:09] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:09] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-24 16:00:09] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-24 16:00:09] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:00:09] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:11] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:11] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:00:11] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:11] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:11] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:11] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:13] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:00:14] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:00:14] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:00:14] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:16] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:00:16] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:00:16] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:00:16] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:16] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:16] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:00:16] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:17] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:00:17] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:00:17] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:00:17] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:17] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:00:17] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:17] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:00:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 16:00:18] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-24 16:00:18] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-24 16:00:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:00:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:00:18] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:19] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:00:19] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:00:19] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:00:19] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:00:20] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:00:20] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:20] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:00:20] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 1 ms to minimize.
[2024-05-24 16:00:20] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:00:20] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:00:20] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:00:20] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2024-05-24 16:00:21] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:00:21] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:00:21] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:00:21] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:00:21] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:21] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:00:21] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:00:21] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:22] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:00:22] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:00:22] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:00:22] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:23] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:00:23] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:23] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:23] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:00:23] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:00:23] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:23] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:23] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:24] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:00:24] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:24] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 205/506 variables, and 253 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/205 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 195/195 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 108/117 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 7/205 variables, 49/166 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 87/253 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:26] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-24 16:00:27] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:27] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:27] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:27] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:28] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:00:29] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:00:29] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:00:29] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:00:29] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:00:29] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:00:30] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:00:31] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:00:31] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:00:31] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:31] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:31] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:31] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:31] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:00:31] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:00:32] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:32] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:33] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:00:33] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:00:33] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:00:33] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:33] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:00:33] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:33] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:33] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:00:34] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:35] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:00:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:00:35] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:00:36] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:00:36] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:36] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:36] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:00:36] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:00:37] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:37] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 10/323 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:38] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:00:38] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:38] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:38] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 6 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-24 16:00:39] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:00:40] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:00:40] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:00:40] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:00:40] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:00:40] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:41] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 16:00:41] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 16:00:41] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:42] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:42] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:42] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:42] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:00:42] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:00:42] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:00:43] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 18/361 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:45] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:45] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:45] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:45] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-24 16:00:45] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 7 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:00:46] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:00:47] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-24 16:00:47] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:47] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:00:47] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:00:47] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:48] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:48] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-24 16:00:48] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:48] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:48] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-24 16:00:48] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:00:48] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:00:49] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:00:49] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:00:49] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-24 16:00:49] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:00:49] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:00:50] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:50] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 14/395 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:00:52] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:00:52] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:00:53] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:00:53] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:53] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:00:53] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:00:53] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:00:53] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:00:53] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:00:54] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:00:54] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:00:54] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:00:54] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 4 ms to minimize.
SMT process timed out in 60201ms, After SMT, problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60683 ms. Remains : 205/205 places, 413/413 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 117 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1838 reset in 272 ms.
Product exploration explored 100000 steps with 1826 reset in 390 ms.
Built C files in :
/tmp/ltsmin1512502402762733166
[2024-05-24 16:00:55] [INFO ] Computing symmetric may disable matrix : 413 transitions.
[2024-05-24 16:00:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:00:55] [INFO ] Computing symmetric may enable matrix : 413 transitions.
[2024-05-24 16:00:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:00:55] [INFO ] Computing Do-Not-Accords matrix : 413 transitions.
[2024-05-24 16:00:55] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:00:55] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1512502402762733166
Running compilation step : cd /tmp/ltsmin1512502402762733166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1020 ms.
Running link step : cd /tmp/ltsmin1512502402762733166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1512502402762733166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11853794026845857588.hoa' '--buchi-type=spotba'
LTSmin run took 3310 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-04 finished in 67684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 63 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-24 16:01:00] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2024-05-24 16:01:00] [INFO ] Computed 65 invariants in 2 ms
[2024-05-24 16:01:00] [INFO ] Implicit Places using invariants in 239 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 246 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 24 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-7-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-05 finished in 767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1))||((p0 U p1)&&F(p2)))))'
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-24 16:01:00] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 16:01:00] [INFO ] Invariant cache hit.
[2024-05-24 16:01:00] [INFO ] Implicit Places using invariants in 147 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 157 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 15 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-7-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-07 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U p1)||F(p2))))'
Support contains 70 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 12 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2024-05-24 16:01:01] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
// Phase 1: matrix 301 rows 212 cols
[2024-05-24 16:01:01] [INFO ] Computed 65 invariants in 1 ms
[2024-05-24 16:01:01] [INFO ] Implicit Places using invariants in 256 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 262 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Applied a total of 0 rules in 10 ms. Remains 205 /205 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 205/219 places, 413/420 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-10
Product exploration explored 100000 steps with 391 reset in 226 ms.
Product exploration explored 100000 steps with 375 reset in 242 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 (NOT p2))), (X (NOT p2)), (X p1), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 13 factoid took 254 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 601 ms. (66 steps per ms) remains 1/7 properties
BEST_FIRST walk for 16054 steps (3 resets) in 58 ms. (272 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (AND p0 (NOT p2))), (X (NOT p2)), (X p1), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (NOT p0)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 13 factoid took 496 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 70 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 413/413 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 413/413 (removed 0) transitions.
[2024-05-24 16:01:03] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
// Phase 1: matrix 301 rows 205 cols
[2024-05-24 16:01:03] [INFO ] Computed 58 invariants in 1 ms
[2024-05-24 16:01:04] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-24 16:01:04] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
[2024-05-24 16:01:04] [INFO ] Invariant cache hit.
[2024-05-24 16:01:04] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-24 16:01:04] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-24 16:01:04] [INFO ] Redundant transitions in 1 ms returned []
Running 406 sub problems to find dead transitions.
[2024-05-24 16:01:04] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
[2024-05-24 16:01:04] [INFO ] Invariant cache hit.
[2024-05-24 16:01:04] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 7/205 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:07] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:01:07] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:01:07] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:01:07] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 14 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:01:09] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-24 16:01:09] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:01:09] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:01:09] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:01:09] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:01:09] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:11] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 16:01:11] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-24 16:01:11] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:01:11] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:01:11] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:11] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:01:11] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:11] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:12] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:01:13] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:01:13] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:13] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 16:01:13] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-24 16:01:13] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:13] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:01:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:14] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:01:15] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:01:16] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:17] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:17] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-24 16:01:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:01:19] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:01:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:01:21] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:01:21] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:21] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:21] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:21] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:01:21] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:01:22] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2024-05-24 16:01:23] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:01:23] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:01:23] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:23] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:01:23] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:01:23] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:01:24] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:24] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:24] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:01:24] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:24] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:01:24] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:01:24] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:01:24] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:25] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-24 16:01:25] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:01:25] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:25] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:25] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:01:25] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:01:25] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:25] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:01:26] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:01:28] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:01:29] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:01:29] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:01:29] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:01:29] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:01:29] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:01:29] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-24 16:01:29] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:01:30] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-24 16:01:30] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:01:30] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:01:30] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:31] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:01:31] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:01:31] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:01:31] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-05-24 16:01:31] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2024-05-24 16:01:32] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:01:33] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:01:33] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:01:33] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:01:33] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:01:33] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:01:33] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-05-24 16:01:34] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:01:34] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 16:01:34] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
SMT process timed out in 30199ms, After SMT, problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30712 ms. Remains : 205/205 places, 413/413 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 13 factoid took 287 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/7 properties
BEST_FIRST walk for 13377 steps (2 resets) in 29 ms. (445 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 13 factoid took 559 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 407 reset in 363 ms.
Product exploration explored 100000 steps with 344 reset in 377 ms.
Built C files in :
/tmp/ltsmin5015071582410321153
[2024-05-24 16:01:36] [INFO ] Computing symmetric may disable matrix : 413 transitions.
[2024-05-24 16:01:36] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:01:36] [INFO ] Computing symmetric may enable matrix : 413 transitions.
[2024-05-24 16:01:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:01:37] [INFO ] Computing Do-Not-Accords matrix : 413 transitions.
[2024-05-24 16:01:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:01:37] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5015071582410321153
Running compilation step : cd /tmp/ltsmin5015071582410321153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 982 ms.
Running link step : cd /tmp/ltsmin5015071582410321153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5015071582410321153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14860897948791173855.hoa' '--buchi-type=spotba'
LTSmin run took 2186 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-10 finished in 38683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U X(p1)))||G((!p1&&X(p0))))))'
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-24 16:01:40] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2024-05-24 16:01:40] [INFO ] Computed 65 invariants in 1 ms
[2024-05-24 16:01:40] [INFO ] Implicit Places using invariants in 157 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 158 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 212/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-11
Product exploration explored 100000 steps with 33349 reset in 280 ms.
Product exploration explored 100000 steps with 33308 reset in 279 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 111 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 22772 steps (4 resets) in 336 ms. (67 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 282 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-24 16:01:42] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 212 cols
[2024-05-24 16:01:42] [INFO ] Computed 58 invariants in 2 ms
[2024-05-24 16:01:42] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-24 16:01:42] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 16:01:42] [INFO ] Invariant cache hit.
[2024-05-24 16:01:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-24 16:01:42] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-24 16:01:42] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 16:01:42] [INFO ] Invariant cache hit.
[2024-05-24 16:01:42] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/212 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:01:45] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:01:45] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:45] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:01:45] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:45] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:01:46] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:01:47] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:01:47] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:01:47] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:47] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:47] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 3 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:49] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:01:50] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:51] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-24 16:01:52] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-24 16:01:53] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:54] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:54] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:01:54] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:54] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:01:54] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:01:54] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:01:54] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:01:56] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:01:57] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:01:58] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 0 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:01:59] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-24 16:02:00] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-24 16:02:01] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:02:01] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 16:02:01] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:02:01] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:01] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:01] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:03] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:02:04] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 3 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:02:05] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-24 16:02:06] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:02:07] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:07] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:07] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:02:07] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:02:07] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:02:07] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:02:07] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:02:07] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:02:08] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:02:09] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:02:09] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:02:11] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-24 16:02:12] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:02:12] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:12] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:02:12] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:12] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:12] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:02:12] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:02:12] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
SMT process timed out in 30226ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30231ms
Finished structural reductions in LTL mode , in 1 iterations and 30660 ms. Remains : 212/212 places, 420/420 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 25605 steps (5 resets) in 90 ms. (281 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 294 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33244 reset in 293 ms.
Product exploration explored 100000 steps with 33287 reset in 273 ms.
Built C files in :
/tmp/ltsmin12816586004584342144
[2024-05-24 16:02:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12816586004584342144
Running compilation step : cd /tmp/ltsmin12816586004584342144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 725 ms.
Running link step : cd /tmp/ltsmin12816586004584342144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12816586004584342144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16090175249423272351.hoa' '--buchi-type=spotba'
LTSmin run took 406 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-11 finished in 35265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(p1)||p0))))))'
Support contains 56 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-24 16:02:15] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 219 cols
[2024-05-24 16:02:15] [INFO ] Computed 65 invariants in 1 ms
[2024-05-24 16:02:15] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-24 16:02:15] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 16:02:15] [INFO ] Invariant cache hit.
[2024-05-24 16:02:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-24 16:02:15] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-24 16:02:15] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
[2024-05-24 16:02:15] [INFO ] Invariant cache hit.
[2024-05-24 16:02:15] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 7/219 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:19] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:02:19] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-24 16:02:19] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:02:19] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:19] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:19] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:02:19] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2024-05-24 16:02:19] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-24 16:02:20] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-24 16:02:21] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:22] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:02:22] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:02:22] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:22] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:02:22] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:23] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:02:24] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:02:25] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:02:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:02:27] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:29] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-24 16:02:29] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:29] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:32] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:33] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:34] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:34] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:02:34] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:34] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-24 16:02:34] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:02:34] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 16:02:35] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-24 16:02:36] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:36] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-24 16:02:45] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-24 16:02:45] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:02:45] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-24 16:02:46] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-24 16:02:46] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Finished structural reductions in LTL mode , in 1 iterations and 30632 ms. Remains : 219/219 places, 420/420 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-12 finished in 30827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 413
Applied a total of 14 rules in 8 ms. Remains 212 /219 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2024-05-24 16:02:46] [INFO ] Flow matrix only has 301 transitions (discarded 112 similar events)
// Phase 1: matrix 301 rows 212 cols
[2024-05-24 16:02:46] [INFO ] Computed 65 invariants in 2 ms
[2024-05-24 16:02:46] [INFO ] Implicit Places using invariants in 258 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 268 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 413/420 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 406
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 406
Applied a total of 14 rules in 13 ms. Remains 198 /205 variables (removed 7) and now considering 406/413 (removed 7) transitions.
[2024-05-24 16:02:46] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
// Phase 1: matrix 294 rows 198 cols
[2024-05-24 16:02:46] [INFO ] Computed 58 invariants in 2 ms
[2024-05-24 16:02:46] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-24 16:02:46] [INFO ] Flow matrix only has 294 transitions (discarded 112 similar events)
[2024-05-24 16:02:46] [INFO ] Invariant cache hit.
[2024-05-24 16:02:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-24 16:02:47] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 406/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 968 ms. Remains : 198/219 places, 406/420 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 252 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 110 in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLCardinality-14 finished in 1335 ms.
All properties solved by simple procedures.
Total runtime 284299 ms.

BK_STOP 1716566567780

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LamportFastMutEx-COL-7"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-7, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-171649612400243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;