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.r576-smll-171734920100123.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 MedleyA-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 MedleyA-PT-16-LTLCardinality-00
FORMULA_NAME MedleyA-PT-16-LTLCardinality-01
FORMULA_NAME MedleyA-PT-16-LTLCardinality-02
FORMULA_NAME MedleyA-PT-16-LTLCardinality-03
FORMULA_NAME MedleyA-PT-16-LTLCardinality-04
FORMULA_NAME MedleyA-PT-16-LTLCardinality-05
FORMULA_NAME MedleyA-PT-16-LTLCardinality-06
FORMULA_NAME MedleyA-PT-16-LTLCardinality-07
FORMULA_NAME MedleyA-PT-16-LTLCardinality-08
FORMULA_NAME MedleyA-PT-16-LTLCardinality-09
FORMULA_NAME MedleyA-PT-16-LTLCardinality-10
FORMULA_NAME MedleyA-PT-16-LTLCardinality-11
FORMULA_NAME MedleyA-PT-16-LTLCardinality-12
FORMULA_NAME MedleyA-PT-16-LTLCardinality-13
FORMULA_NAME MedleyA-PT-16-LTLCardinality-14
FORMULA_NAME MedleyA-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717371309662

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 23:35:12] [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-06-02 23:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:35:12] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-06-02 23:35:12] [INFO ] Transformed 196 places.
[2024-06-02 23:35:12] [INFO ] Transformed 392 transitions.
[2024-06-02 23:35:12] [INFO ] Found NUPN structural information;
[2024-06-02 23:35:12] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 612 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 166 transition count 341
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 166 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 70 place count 166 transition count 331
Applied a total of 70 rules in 83 ms. Remains 166 /196 variables (removed 30) and now considering 331/390 (removed 59) transitions.
// Phase 1: matrix 331 rows 166 cols
[2024-06-02 23:35:13] [INFO ] Computed 7 invariants in 35 ms
[2024-06-02 23:35:13] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-06-02 23:35:13] [INFO ] Invariant cache hit.
[2024-06-02 23:35:14] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-02 23:35:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:35:19] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 21 ms to minimize.
[2024-06-02 23:35:19] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:35:19] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-06-02 23:35:19] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 4 ms to minimize.
[2024-06-02 23:35:20] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:35:20] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2024-06-02 23:35:20] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-06-02 23:35:20] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-06-02 23:35:20] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 4 ms to minimize.
[2024-06-02 23:35:20] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:35:21] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:35:21] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:35:21] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-06-02 23:35:22] [INFO ] Deduced a trap composed of 109 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:35:22] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:35:22] [INFO ] Deduced a trap composed of 123 places in 100 ms of which 3 ms to minimize.
[2024-06-02 23:35:22] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:35:22] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:35:22] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:35:22] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:35:23] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:35:23] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-06-02 23:35:24] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 331/497 variables, 166/196 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:35:30] [INFO ] Deduced a trap composed of 96 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:35:30] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:35:40] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
[2024-06-02 23:35:41] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/497 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 200 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:35:48] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:35:50] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:35:51] [INFO ] Deduced a trap composed of 114 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:35:53] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 331/497 variables, 166/204 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 330/534 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:36:01] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:36:03] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:36:04] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 23:36:13] [INFO ] Deduced a trap composed of 114 places in 152 ms of which 8 ms to minimize.
[2024-06-02 23:36:13] [INFO ] Deduced a trap composed of 111 places in 168 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 539 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 36/36 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Starting structural reductions in LTL mode, iteration 1 : 166/196 places, 331/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61829 ms. Remains : 166/196 places, 331/390 transitions.
Support contains 27 out of 166 places after structural reductions.
[2024-06-02 23:36:15] [INFO ] Flatten gal took : 111 ms
[2024-06-02 23:36:15] [INFO ] Flatten gal took : 51 ms
[2024-06-02 23:36:15] [INFO ] Input system was already deterministic with 331 transitions.
Support contains 25 out of 166 places (down from 27) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 2211 ms. (18 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1017 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 289 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 362 ms. (110 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 128 ms. (310 steps per ms) remains 11/12 properties
[2024-06-02 23:36:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 129/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 16/166 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 331/497 variables, 166/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 173 constraints, problems are : Problem set: 0 solved, 11 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 129/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 23:36:18] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 3 ms to minimize.
[2024-06-02 23:36:18] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 16/166 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 331/497 variables, 166/175 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 11/186 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 23:36:19] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/497 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 187 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2058 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 2782ms problems are : Problem set: 0 solved, 11 unsolved
Finished Parikh walk after 10182 steps, including 462 resets, run visited all 2 properties in 118 ms. (steps per millisecond=86 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 4526 ms.
Computed a total of 14 stabilizing places and 14 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(p0)||X(X(F(!p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 155 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 155 transition count 310
Applied a total of 27 rules in 34 ms. Remains 155 /166 variables (removed 11) and now considering 310/331 (removed 21) transitions.
// Phase 1: matrix 310 rows 155 cols
[2024-06-02 23:36:25] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:36:25] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 23:36:25] [INFO ] Invariant cache hit.
[2024-06-02 23:36:25] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:36:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:36:29] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 4 ms to minimize.
[2024-06-02 23:36:29] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:36:29] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-02 23:36:29] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:36:29] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
[2024-06-02 23:36:29] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:36:30] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:36:30] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:36:30] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:36:30] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2024-06-02 23:36:30] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:36:30] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 3 ms to minimize.
[2024-06-02 23:36:31] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:36:31] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-02 23:36:31] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:36:31] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:36:33] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 6 ms to minimize.
[2024-06-02 23:36:33] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:36:33] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:36:34] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:36:34] [INFO ] Deduced a trap composed of 114 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:36:34] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:36:38] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:36:40] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 3 ms to minimize.
[2024-06-02 23:36:41] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/465 variables, 155/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/465 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 187 constraints, problems are : Problem set: 0 solved, 309 unsolved in 27419 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/465 variables, 155/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 309/496 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:37:00] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 497 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 26/26 constraints]
After SMT, in 57620ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 57633ms
Starting structural reductions in LTL mode, iteration 1 : 155/166 places, 310/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58131 ms. Remains : 155/166 places, 310/331 transitions.
Stuttering acceptance computed with spot in 464 ms :[p0, false, p0, false]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 438 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 28 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLCardinality-02 finished in 59539 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(p0))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 4 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 155 transition count 290
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 125 transition count 288
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 124 transition count 285
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 72 place count 121 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 120 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 73 place count 120 transition count 274
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 91 place count 111 transition count 274
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 99 place count 103 transition count 259
Iterating global reduction 5 with 8 rules applied. Total rules applied 107 place count 103 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 113 place count 103 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 102 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 114 place count 102 transition count 252
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 116 place count 101 transition count 252
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 118 place count 99 transition count 246
Iterating global reduction 7 with 2 rules applied. Total rules applied 120 place count 99 transition count 246
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 162 place count 78 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 167 place count 78 transition count 220
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 170 place count 75 transition count 213
Iterating global reduction 8 with 3 rules applied. Total rules applied 173 place count 75 transition count 213
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 211 place count 56 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 225 place count 56 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 253 place count 56 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 257 place count 54 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 258 place count 53 transition count 321
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 49 edges and 51 vertex of which 16 / 51 are part of one of the 7 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 261 place count 42 transition count 321
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 10 with 37 rules applied. Total rules applied 298 place count 42 transition count 284
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 300 place count 40 transition count 260
Iterating global reduction 11 with 2 rules applied. Total rules applied 302 place count 40 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 11 with 74 rules applied. Total rules applied 376 place count 40 transition count 186
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 378 place count 38 transition count 176
Iterating global reduction 11 with 2 rules applied. Total rules applied 380 place count 38 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 384 place count 36 transition count 174
Applied a total of 384 rules in 202 ms. Remains 36 /166 variables (removed 130) and now considering 174/331 (removed 157) transitions.
[2024-06-02 23:37:24] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
// Phase 1: matrix 154 rows 36 cols
[2024-06-02 23:37:24] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 23:37:24] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 23:37:24] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
[2024-06-02 23:37:24] [INFO ] Invariant cache hit.
[2024-06-02 23:37:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:37:25] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-06-02 23:37:25] [INFO ] Redundant transitions in 58 ms returned [95, 123, 169, 173]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 166 sub problems to find dead transitions.
[2024-06-02 23:37:25] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 23:37:25] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:37:25] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 23:37:25] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 149/185 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 23:37:28] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 82 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6696 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 149/185 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 166/248 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 23:37:37] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:37:37] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:37:37] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/185 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 251 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11842 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 8/8 constraints]
After SMT, in 18787ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 18797ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/166 places, 170/331 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 169
Applied a total of 2 rules in 8 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2024-06-02 23:37:43] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2024-06-02 23:37:43] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 23:37:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 23:37:43] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2024-06-02 23:37:43] [INFO ] Invariant cache hit.
[2024-06-02 23:37:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:37:44] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/166 places, 169/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19620 ms. Remains : 35/166 places, 169/331 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-03 finished in 19691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 154 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 154 transition count 309
Applied a total of 29 rules in 12 ms. Remains 154 /166 variables (removed 12) and now considering 309/331 (removed 22) transitions.
// Phase 1: matrix 309 rows 154 cols
[2024-06-02 23:37:44] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:37:44] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 23:37:44] [INFO ] Invariant cache hit.
[2024-06-02 23:37:44] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 23:37:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:37:48] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:37:48] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:37:48] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:37:49] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:37:49] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:37:49] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 3 ms to minimize.
[2024-06-02 23:37:49] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:37:49] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-06-02 23:37:49] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:37:51] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:37:51] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:37:51] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:37:51] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:37:52] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:37:52] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:37:52] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:37:53] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:37:53] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 3 ms to minimize.
[2024-06-02 23:37:53] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:37:54] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:37:57] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 309/463 variables, 154/187 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:38:04] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:38:06] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:38:06] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:38:06] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/463 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 191 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 308/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 499 constraints, problems are : Problem set: 0 solved, 308 unsolved in 27137 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 30/30 constraints]
After SMT, in 57287ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 57291ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 309/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57721 ms. Remains : 154/166 places, 309/331 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-04 finished in 57926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 317
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 154 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 154 transition count 310
Applied a total of 29 rules in 5 ms. Remains 154 /166 variables (removed 12) and now considering 310/331 (removed 21) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 23:38:42] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:38:42] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:38:42] [INFO ] Invariant cache hit.
[2024-06-02 23:38:42] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:38:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:38:46] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:38:46] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:38:46] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:38:46] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:38:46] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:38:47] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:38:47] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:38:47] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:38:47] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-06-02 23:38:47] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:38:48] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:38:48] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:38:49] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:38:49] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:38:49] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:38:49] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:38:49] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:38:49] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-06-02 23:38:50] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:38:51] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:38:56] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:38:58] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/464 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/464 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 183 constraints, problems are : Problem set: 0 solved, 309 unsolved in 28291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:39:18] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 493 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints]
After SMT, in 58454ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 58460ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 310/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58782 ms. Remains : 154/166 places, 310/331 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-06 finished in 59077 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' '!(((p0 U p1)&&F((G(F(p3))||p2))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 289
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 124 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 123 transition count 287
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 66 place count 123 transition count 278
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 84 place count 114 transition count 278
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 106 transition count 263
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 106 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 106 place count 106 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 105 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 107 place count 105 transition count 256
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 104 transition count 256
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 111 place count 102 transition count 250
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 102 transition count 250
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 151 place count 83 transition count 231
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 156 place count 83 transition count 226
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 159 place count 80 transition count 219
Iterating global reduction 6 with 3 rules applied. Total rules applied 162 place count 80 transition count 219
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 198 place count 62 transition count 329
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 211 place count 62 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 239 place count 62 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 243 place count 60 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 59 transition count 313
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 57 edges and 57 vertex of which 19 / 57 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 247 place count 46 transition count 313
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 290 place count 46 transition count 270
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 292 place count 44 transition count 247
Iterating global reduction 9 with 2 rules applied. Total rules applied 294 place count 44 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 9 with 78 rules applied. Total rules applied 372 place count 44 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 372 place count 44 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 374 place count 43 transition count 168
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 376 place count 41 transition count 160
Iterating global reduction 9 with 2 rules applied. Total rules applied 378 place count 41 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 382 place count 39 transition count 158
Applied a total of 382 rules in 93 ms. Remains 39 /166 variables (removed 127) and now considering 158/331 (removed 173) transitions.
[2024-06-02 23:39:41] [INFO ] Flow matrix only has 146 transitions (discarded 12 similar events)
// Phase 1: matrix 146 rows 39 cols
[2024-06-02 23:39:41] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:39:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:39:41] [INFO ] Flow matrix only has 146 transitions (discarded 12 similar events)
[2024-06-02 23:39:41] [INFO ] Invariant cache hit.
[2024-06-02 23:39:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 23:39:41] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 23:39:41] [INFO ] Redundant transitions in 39 ms returned [114, 115, 157]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 153 sub problems to find dead transitions.
[2024-06-02 23:39:41] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
// Phase 1: matrix 143 rows 39 cols
[2024-06-02 23:39:41] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:39:41] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 23:39:42] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:39:42] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:39:43] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:39:43] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:39:43] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:39:43] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:39:43] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 23:39:44] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 142/181 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 30/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 82 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6923 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 142/181 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 30/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 153/235 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 23:39:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 23:39:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:39:53] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 238 constraints, problems are : Problem set: 0 solved, 153 unsolved in 11435 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 11/11 constraints]
After SMT, in 18564ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 18567ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/166 places, 155/331 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 154
Applied a total of 2 rules in 5 ms. Remains 38 /39 variables (removed 1) and now considering 154/155 (removed 1) transitions.
[2024-06-02 23:40:00] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
// Phase 1: matrix 142 rows 38 cols
[2024-06-02 23:40:00] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:40:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 23:40:00] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
[2024-06-02 23:40:00] [INFO ] Invariant cache hit.
[2024-06-02 23:40:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 23:40:00] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/166 places, 154/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19139 ms. Remains : 38/166 places, 154/331 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-07 finished in 19425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))&&((!p1&&F(!p2)) U (G((!p1&&F(!p2)))||(!p1&&G(!p2))))))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 159 transition count 321
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 159 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 320
Applied a total of 16 rules in 8 ms. Remains 158 /166 variables (removed 8) and now considering 320/331 (removed 11) transitions.
// Phase 1: matrix 320 rows 158 cols
[2024-06-02 23:40:00] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:40:00] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:40:00] [INFO ] Invariant cache hit.
[2024-06-02 23:40:01] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-06-02 23:40:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 23:40:05] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:40:05] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:40:05] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:40:05] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:40:05] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-06-02 23:40:05] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:40:06] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:40:06] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:40:06] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:40:06] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:40:07] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-06-02 23:40:07] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:40:07] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-06-02 23:40:07] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:40:08] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:40:08] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:40:08] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 23:40:10] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:40:10] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:40:10] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:40:11] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:40:11] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:40:11] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:40:11] [INFO ] Deduced a trap composed of 113 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:40:12] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:40:12] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:40:12] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 23:40:16] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:40:17] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 23:40:18] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:40:19] [INFO ] Deduced a trap composed of 121 places in 183 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 320/478 variables, 158/196 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 23:40:25] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 23:40:31] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 3 ms to minimize.
SMT process timed out in 30222ms, After SMT, problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 30228ms
Starting structural reductions in LTL mode, iteration 1 : 158/166 places, 320/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30562 ms. Remains : 158/166 places, 320/331 transitions.
Stuttering acceptance computed with spot in 2017 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1 p2), (NOT p0), p2, p2, p1, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), p2, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 280 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA MedleyA-PT-16-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-12 finished in 32954 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 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 176 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 155 transition count 286
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 73 place count 121 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 119 transition count 282
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 75 place count 119 transition count 274
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 91 place count 111 transition count 274
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 100 place count 102 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 102 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 115 place count 102 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 101 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 116 place count 101 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 99 transition count 248
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 99 transition count 248
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 160 place count 79 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 166 place count 79 transition count 222
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 169 place count 76 transition count 214
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 76 transition count 214
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 206 place count 59 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 207 place count 59 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 237 place count 59 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 241 place count 57 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 56 transition count 323
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 54 vertex of which 19 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 245 place count 43 transition count 323
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 288 place count 43 transition count 280
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 290 place count 41 transition count 258
Iterating global reduction 9 with 2 rules applied. Total rules applied 292 place count 41 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 367 place count 41 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 367 place count 41 transition count 182
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 369 place count 40 transition count 182
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 371 place count 38 transition count 174
Iterating global reduction 9 with 2 rules applied. Total rules applied 373 place count 38 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 377 place count 36 transition count 172
Applied a total of 377 rules in 87 ms. Remains 36 /166 variables (removed 130) and now considering 172/331 (removed 159) transitions.
[2024-06-02 23:40:33] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
// Phase 1: matrix 152 rows 36 cols
[2024-06-02 23:40:33] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:40:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:40:33] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
[2024-06-02 23:40:33] [INFO ] Invariant cache hit.
[2024-06-02 23:40:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:40:33] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-02 23:40:34] [INFO ] Redundant transitions in 57 ms returned [129, 171]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 168 sub problems to find dead transitions.
[2024-06-02 23:40:34] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 23:40:34] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:40:34] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-02 23:40:34] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:40:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-06-02 23:40:35] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:40:35] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:40:35] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:40:35] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:40:35] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:40:35] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 149/185 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 105 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6428 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 149/185 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 168/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 273 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7162 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints]
After SMT, in 13741ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 13744ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/166 places, 170/331 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 169
Applied a total of 2 rules in 6 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2024-06-02 23:40:47] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2024-06-02 23:40:47] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:40:47] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:40:47] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2024-06-02 23:40:47] [INFO ] Invariant cache hit.
[2024-06-02 23:40:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:40:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/166 places, 169/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14342 ms. Remains : 35/166 places, 169/331 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-14 finished in 14446 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&&(p1||X(p2))))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 158 transition count 320
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 158 transition count 320
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 21 place count 158 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 157 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 157 transition count 314
Applied a total of 23 rules in 4 ms. Remains 157 /166 variables (removed 9) and now considering 314/331 (removed 17) transitions.
// Phase 1: matrix 314 rows 157 cols
[2024-06-02 23:40:48] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:40:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:40:48] [INFO ] Invariant cache hit.
[2024-06-02 23:40:48] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 23:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:40:52] [INFO ] Deduced a trap composed of 103 places in 80 ms of which 3 ms to minimize.
[2024-06-02 23:40:53] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:40:53] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:40:53] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:40:53] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:40:53] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:40:53] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:40:54] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:40:55] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:40:55] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:40:58] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:40:58] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:40:59] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:40:59] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:41:02] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/192 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:41:09] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:41:21] [INFO ] Deduced a trap composed of 120 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 30/30 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 157/166 places, 314/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60420 ms. Remains : 157/166 places, 314/331 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 414 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 218 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 691 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 574 ms. (69 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 269 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 310 ms. (128 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 46982 steps, run visited all 8 properties in 454 ms. (steps per millisecond=103 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 465 ms. (steps per millisecond=101 ) properties seen :8
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 677 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-02 23:41:52] [INFO ] Invariant cache hit.
[2024-06-02 23:41:52] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 23:41:52] [INFO ] Invariant cache hit.
[2024-06-02 23:41:52] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 23:41:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:41:56] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:41:58] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:41:58] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:41:58] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:41:58] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-06-02 23:41:58] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:41:59] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:41:59] [INFO ] Deduced a trap composed of 103 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:41:59] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:41:59] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:41:59] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-06-02 23:42:00] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:42:00] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:42:00] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:42:00] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 3 ms to minimize.
[2024-06-02 23:42:01] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:42:01] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:42:03] [INFO ] Deduced a trap composed of 95 places in 165 ms of which 5 ms to minimize.
[2024-06-02 23:42:04] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:42:04] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:42:05] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:42:07] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/192 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 109 places in 154 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:42:26] [INFO ] Deduced a trap composed of 120 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 30/30 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 157/157 places, 314/314 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 153 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 288 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 333 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 227 ms. (175 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 206 ms. (193 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 46982 steps, run visited all 8 properties in 350 ms. (steps per millisecond=134 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 350 ms. (steps per millisecond=134 ) properties seen :8
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 688 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 299 ms.
Product exploration explored 100000 steps with 0 reset in 356 ms.
Built C files in :
/tmp/ltsmin7607214745773594519
[2024-06-02 23:42:56] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7607214745773594519
Running compilation step : cd /tmp/ltsmin7607214745773594519;'/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 1111 ms.
Running link step : cd /tmp/ltsmin7607214745773594519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7607214745773594519;'/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/stateBased16553528218528511766.hoa' '--buchi-type=spotba'
LTSmin run took 334 ms.
FORMULA MedleyA-PT-16-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLCardinality-15 finished in 129977 ms.
All properties solved by simple procedures.
Total runtime 466044 ms.

BK_STOP 1717371778110

--------------------
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="MedleyA-PT-16"
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 MedleyA-PT-16, 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 r576-smll-171734920100123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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