Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418300067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HypertorusGrid-PT-d5k3p2b10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418300067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 22:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 22:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 21:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 21:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 14M Mar 5 18:22 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 HypertorusGrid-PT-d5k3p2b10-LTLCardinality-00
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-01
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-02
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-03
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-04
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-05
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-06
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-07
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-08
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-09
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-10
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-11
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-13
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679444161787

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HypertorusGrid-PT-d5k3p2b10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 00:16:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 00:16:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:16:04] [INFO ] Load time of PNML (sax parser for PT used): 540 ms
[2023-03-22 00:16:04] [INFO ] Transformed 7533 places.
[2023-03-22 00:16:04] [INFO ] Transformed 24300 transitions.
[2023-03-22 00:16:04] [INFO ] Parsed PT model containing 7533 places and 24300 transitions and 97200 arcs in 723 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1812 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
// Phase 1: matrix 24300 rows 7533 cols
[2023-03-22 00:16:07] [INFO ] Computed 2674 place invariants in 945 ms
[2023-03-22 00:16:08] [INFO ] Implicit Places using invariants in 1832 ms returned []
Implicit Place search using SMT only with invariants took 1855 ms to find 0 implicit places.
[2023-03-22 00:16:08] [INFO ] Invariant cache hit.
[2023-03-22 00:16:24] [INFO ] Dead Transitions using invariants and state equation in 16629 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20309 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Support contains 46 out of 7533 places after structural reductions.
[2023-03-22 00:16:26] [INFO ] Flatten gal took : 1253 ms
[2023-03-22 00:16:27] [INFO ] Flatten gal took : 816 ms
[2023-03-22 00:16:29] [INFO ] Input system was already deterministic with 24300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8880 ms. (steps per millisecond=1 ) properties (out of 28) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=14 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=15 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 00:16:45] [INFO ] Invariant cache hit.
[2023-03-22 00:16:48] [INFO ] [Real]Absence check using 2673 positive place invariants in 792 ms returned sat
[2023-03-22 00:16:48] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 626 ms returned sat
[2023-03-22 00:16:48] [INFO ] After 2875ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:2
[2023-03-22 00:16:50] [INFO ] [Nat]Absence check using 2673 positive place invariants in 832 ms returned sat
[2023-03-22 00:16:50] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 631 ms returned sat
[2023-03-22 00:17:09] [INFO ] After 18876ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-22 00:17:11] [INFO ] After 19967ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 664 ms.
[2023-03-22 00:17:11] [INFO ] After 23045ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2019 ms.
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1527 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1530 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7783 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Probabilistic random walk after 244378 steps, saw 244230 distinct states, run finished after 24064 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:17:47] [INFO ] Invariant cache hit.
[2023-03-22 00:17:48] [INFO ] After 662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:17:49] [INFO ] [Nat]Absence check using 2673 positive place invariants in 808 ms returned sat
[2023-03-22 00:17:50] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 632 ms returned sat
[2023-03-22 00:18:07] [INFO ] After 16578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:18:08] [INFO ] After 17635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 587 ms.
[2023-03-22 00:18:08] [INFO ] After 20483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2013 ms.
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1653 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1653 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1364 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:18:13] [INFO ] Invariant cache hit.
[2023-03-22 00:18:19] [INFO ] Implicit Places using invariants in 5913 ms returned []
Implicit Place search using SMT only with invariants took 5916 ms to find 0 implicit places.
[2023-03-22 00:18:19] [INFO ] Invariant cache hit.
[2023-03-22 00:18:36] [INFO ] Dead Transitions using invariants and state equation in 16382 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23668 ms. Remains : 7533/7533 places, 24300/24300 transitions.
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1311 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:18:37] [INFO ] Invariant cache hit.
[2023-03-22 00:18:44] [INFO ] Implicit Places using invariants in 6572 ms returned []
Implicit Place search using SMT only with invariants took 6574 ms to find 0 implicit places.
[2023-03-22 00:18:44] [INFO ] Invariant cache hit.
[2023-03-22 00:19:00] [INFO ] Dead Transitions using invariants and state equation in 16366 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24257 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GT 2 s5962) (LEQ s4409 s5007)), p0:(LEQ s4409 s5007)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 241 steps with 0 reset in 200 ms.
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-01 finished in 24871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1534 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:19:03] [INFO ] Invariant cache hit.
[2023-03-22 00:19:09] [INFO ] Implicit Places using invariants in 6429 ms returned []
Implicit Place search using SMT only with invariants took 6430 ms to find 0 implicit places.
[2023-03-22 00:19:09] [INFO ] Invariant cache hit.
[2023-03-22 00:19:26] [INFO ] Dead Transitions using invariants and state equation in 17024 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24991 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s295)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 11810 steps with 0 reset in 10007 ms.
Product exploration timeout after 11070 steps with 1 reset in 10007 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 6849 steps, including 2 resets, run visited all 1 properties in 5525 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-22 00:19:52] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 989 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:20:08] [INFO ] Invariant cache hit.
[2023-03-22 00:20:15] [INFO ] Implicit Places using invariants in 6336 ms returned []
Implicit Place search using SMT only with invariants took 6337 ms to find 0 implicit places.
[2023-03-22 00:20:15] [INFO ] Invariant cache hit.
[2023-03-22 00:20:31] [INFO ] Dead Transitions using invariants and state equation in 16353 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23685 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 7681 steps, including 2 resets, run visited all 1 properties in 6143 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-22 00:20:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration timeout after 11270 steps with 0 reset in 10008 ms.
Product exploration timeout after 11160 steps with 0 reset in 10006 ms.
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1340 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:21:14] [INFO ] Invariant cache hit.
[2023-03-22 00:21:15] [INFO ] Implicit Places using invariants in 808 ms returned []
Implicit Place search using SMT only with invariants took 810 ms to find 0 implicit places.
[2023-03-22 00:21:15] [INFO ] Invariant cache hit.
[2023-03-22 00:21:32] [INFO ] Dead Transitions using invariants and state equation in 16805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18957 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-02 finished in 152377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||F(p2))))'
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1267 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:21:35] [INFO ] Invariant cache hit.
[2023-03-22 00:21:35] [INFO ] Implicit Places using invariants in 804 ms returned []
Implicit Place search using SMT only with invariants took 805 ms to find 0 implicit places.
[2023-03-22 00:21:35] [INFO ] Invariant cache hit.
[2023-03-22 00:21:36] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2861 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 3 s140), p1:(LEQ 1 s3800), p0:(LEQ s118 s3167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 11390 steps with 0 reset in 10001 ms.
Product exploration timeout after 11260 steps with 1 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8237 ms. (steps per millisecond=1 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:22:06] [INFO ] Invariant cache hit.
[2023-03-22 00:22:07] [INFO ] [Real]Absence check using 2673 positive place invariants in 811 ms returned sat
[2023-03-22 00:22:08] [INFO ] [Real]Absence check using 2673 positive and 1 generalized place invariants in 635 ms returned sat
[2023-03-22 00:22:24] [INFO ] After 16032ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:22:25] [INFO ] After 17091ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 608 ms.
[2023-03-22 00:22:26] [INFO ] After 20015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1371 steps, including 0 resets, run visited all 1 properties in 1031 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 1040 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
[2023-03-22 00:22:27] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 2 out of 7533 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1152 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:22:44] [INFO ] Invariant cache hit.
[2023-03-22 00:22:50] [INFO ] Implicit Places using invariants in 6029 ms returned []
Implicit Place search using SMT only with invariants took 6030 ms to find 0 implicit places.
[2023-03-22 00:22:50] [INFO ] Invariant cache hit.
[2023-03-22 00:22:50] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7875 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 599 steps, including 0 resets, run visited all 2 properties in 436 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p2) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
[2023-03-22 00:22:52] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p2) (NOT p1))
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration timeout after 11310 steps with 0 reset in 10002 ms.
Product exploration timeout after 11350 steps with 1 reset in 10005 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1160 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:23:28] [INFO ] Invariant cache hit.
[2023-03-22 00:23:45] [INFO ] Dead Transitions using invariants and state equation in 17021 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18182 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1094 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:23:47] [INFO ] Invariant cache hit.
[2023-03-22 00:23:53] [INFO ] Implicit Places using invariants in 6371 ms returned []
Implicit Place search using SMT only with invariants took 6376 ms to find 0 implicit places.
[2023-03-22 00:23:53] [INFO ] Invariant cache hit.
[2023-03-22 00:24:10] [INFO ] Dead Transitions using invariants and state equation in 17191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24668 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-03 finished in 157796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (F(p1) U !p2)))'
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1268 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:24:12] [INFO ] Invariant cache hit.
[2023-03-22 00:24:19] [INFO ] Implicit Places using invariants in 6409 ms returned []
Implicit Place search using SMT only with invariants took 6414 ms to find 0 implicit places.
[2023-03-22 00:24:19] [INFO ] Invariant cache hit.
[2023-03-22 00:24:37] [INFO ] Dead Transitions using invariants and state equation in 17956 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25641 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p2) p1), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=4, aps=[p1:(AND (GT 3 s4577) (LEQ 1 s3970)), p2:(AND (LEQ s3450 s1511) (LEQ 1 s3970)), p0:(LEQ s5541 s7050)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 875 steps with 0 reset in 638 ms.
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-04 finished in 26530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p1))))))'
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 972 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:24:39] [INFO ] Invariant cache hit.
[2023-03-22 00:24:39] [INFO ] Implicit Places using invariants in 787 ms returned []
Implicit Place search using SMT only with invariants took 788 ms to find 0 implicit places.
[2023-03-22 00:24:39] [INFO ] Invariant cache hit.
[2023-03-22 00:24:56] [INFO ] Dead Transitions using invariants and state equation in 16241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18002 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (LEQ 2 s626) (LEQ 1 s6677)), p1:(LEQ s3002 s5479)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 28790 steps with 14384 reset in 10002 ms.
Product exploration timeout after 27440 steps with 13710 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 7402 steps, including 2 resets, run visited all 2 properties in 5974 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1020 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:25:24] [INFO ] Invariant cache hit.
[2023-03-22 00:25:30] [INFO ] Implicit Places using invariants in 6532 ms returned []
Implicit Place search using SMT only with invariants took 6533 ms to find 0 implicit places.
[2023-03-22 00:25:30] [INFO ] Invariant cache hit.
[2023-03-22 00:25:47] [INFO ] Dead Transitions using invariants and state equation in 16824 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24394 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 293 steps, including 0 resets, run visited all 2 properties in 193 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 29220 steps with 14594 reset in 10001 ms.
Product exploration timeout after 27580 steps with 13779 reset in 10002 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1070 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:26:10] [INFO ] Invariant cache hit.
[2023-03-22 00:26:26] [INFO ] Dead Transitions using invariants and state equation in 16415 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17487 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 999 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:26:27] [INFO ] Invariant cache hit.
[2023-03-22 00:26:33] [INFO ] Implicit Places using invariants in 5990 ms returned []
Implicit Place search using SMT only with invariants took 5991 ms to find 0 implicit places.
[2023-03-22 00:26:33] [INFO ] Invariant cache hit.
[2023-03-22 00:26:50] [INFO ] Dead Transitions using invariants and state equation in 16999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23992 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-06 finished in 133397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(X(!p0)||F(p1))))))'
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 891 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:26:52] [INFO ] Invariant cache hit.
[2023-03-22 00:26:58] [INFO ] Implicit Places using invariants in 6481 ms returned []
Implicit Place search using SMT only with invariants took 6482 ms to find 0 implicit places.
[2023-03-22 00:26:58] [INFO ] Invariant cache hit.
[2023-03-22 00:27:15] [INFO ] Dead Transitions using invariants and state equation in 16071 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23457 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (AND (NOT p1) p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(GT s7190 s7224), p0:(LEQ s3915 s6121)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-10 finished in 23736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1190 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:27:16] [INFO ] Invariant cache hit.
[2023-03-22 00:27:22] [INFO ] Implicit Places using invariants in 5956 ms returned []
Implicit Place search using SMT only with invariants took 5960 ms to find 0 implicit places.
[2023-03-22 00:27:22] [INFO ] Invariant cache hit.
[2023-03-22 00:27:38] [INFO ] Dead Transitions using invariants and state equation in 16522 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23678 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s568 s3900)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 11400 steps with 0 reset in 10005 ms.
Product exploration timeout after 11780 steps with 3 reset in 10008 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3001 steps, including 0 resets, run visited all 1 properties in 2412 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2023-03-22 00:28:02] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1053 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:28:18] [INFO ] Invariant cache hit.
[2023-03-22 00:28:24] [INFO ] Implicit Places using invariants in 6393 ms returned []
Implicit Place search using SMT only with invariants took 6394 ms to find 0 implicit places.
[2023-03-22 00:28:24] [INFO ] Invariant cache hit.
[2023-03-22 00:28:40] [INFO ] Dead Transitions using invariants and state equation in 15670 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23119 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8098 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Finished Best-First random walk after 2431 steps, including 0 resets, run visited all 1 properties in 153 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2023-03-22 00:28:49] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 11580 steps with 0 reset in 10004 ms.
Product exploration timeout after 11650 steps with 1 reset in 10006 ms.
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1023 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:29:25] [INFO ] Invariant cache hit.
[2023-03-22 00:29:31] [INFO ] Implicit Places using invariants in 6050 ms returned []
Implicit Place search using SMT only with invariants took 6056 ms to find 0 implicit places.
[2023-03-22 00:29:31] [INFO ] Invariant cache hit.
[2023-03-22 00:29:48] [INFO ] Dead Transitions using invariants and state equation in 16876 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23958 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-11 finished in 154150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&F(p1))))||G(p2)))'
Support contains 5 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 886 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:29:50] [INFO ] Invariant cache hit.
[2023-03-22 00:29:56] [INFO ] Implicit Places using invariants in 6338 ms returned []
Implicit Place search using SMT only with invariants took 6339 ms to find 0 implicit places.
[2023-03-22 00:29:56] [INFO ] Invariant cache hit.
[2023-03-22 00:30:13] [INFO ] Dead Transitions using invariants and state equation in 16997 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24223 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (LEQ s2023 s6621) (LEQ s2948 s2791)), p0:(GT s2948 s2791), p2:(LEQ 1 s5477)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 11700 steps with 1 reset in 10002 ms.
Product exploration timeout after 11740 steps with 0 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 287 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 3257 steps, including 0 resets, run visited all 3 properties in 2526 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 366 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-22 00:30:37] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-22 00:30:52] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4 out of 7533 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 954 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:31:08] [INFO ] Invariant cache hit.
[2023-03-22 00:31:15] [INFO ] Implicit Places using invariants in 6221 ms returned []
Implicit Place search using SMT only with invariants took 6222 ms to find 0 implicit places.
[2023-03-22 00:31:15] [INFO ] Invariant cache hit.
[2023-03-22 00:31:31] [INFO ] Dead Transitions using invariants and state equation in 16507 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23684 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 4493 steps, including 1 resets, run visited all 3 properties in 3501 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-22 00:31:36] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-22 00:31:51] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration timeout after 12180 steps with 1 reset in 10003 ms.
Product exploration timeout after 12140 steps with 2 reset in 10002 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 919 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:32:27] [INFO ] Invariant cache hit.
[2023-03-22 00:32:43] [INFO ] Dead Transitions using invariants and state equation in 16317 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17236 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 849 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:32:44] [INFO ] Invariant cache hit.
[2023-03-22 00:32:51] [INFO ] Implicit Places using invariants in 6369 ms returned []
Implicit Place search using SMT only with invariants took 6370 ms to find 0 implicit places.
[2023-03-22 00:32:51] [INFO ] Invariant cache hit.
[2023-03-22 00:33:07] [INFO ] Dead Transitions using invariants and state equation in 16329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23551 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12 finished in 198728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(G(p0) U (!p0 U p1)))||F(p2))))'
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1016 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:33:09] [INFO ] Invariant cache hit.
[2023-03-22 00:33:15] [INFO ] Implicit Places using invariants in 6370 ms returned []
Implicit Place search using SMT only with invariants took 6371 ms to find 0 implicit places.
[2023-03-22 00:33:15] [INFO ] Invariant cache hit.
[2023-03-22 00:33:32] [INFO ] Dead Transitions using invariants and state equation in 16690 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24079 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0)]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s353 s904), p1:(LEQ s2531 s1478), p0:(GT s6283 s2443)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 18840 steps with 4561 reset in 10001 ms.
Product exploration timeout after 22410 steps with 8511 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8218 ms. (steps per millisecond=1 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:34:03] [INFO ] Invariant cache hit.
[2023-03-22 00:34:03] [INFO ] After 890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:34:05] [INFO ] [Nat]Absence check using 2673 positive place invariants in 774 ms returned sat
[2023-03-22 00:34:06] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 615 ms returned sat
[2023-03-22 00:34:24] [INFO ] After 18006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:34:27] [INFO ] After 20805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1686 ms.
[2023-03-22 00:34:28] [INFO ] After 25089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2006 ms.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 997 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 997 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8216 ms. (steps per millisecond=1 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 263196 steps, run timeout after 27074 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 263196 steps, saw 263040 distinct states, run finished after 27075 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:35:09] [INFO ] Invariant cache hit.
[2023-03-22 00:35:10] [INFO ] After 1003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:35:11] [INFO ] [Nat]Absence check using 2673 positive place invariants in 811 ms returned sat
[2023-03-22 00:35:12] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 591 ms returned sat
[2023-03-22 00:35:30] [INFO ] After 17576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:35:33] [INFO ] After 20377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1681 ms.
[2023-03-22 00:35:34] [INFO ] After 24667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2005 ms.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1097 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1098 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1075 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:35:38] [INFO ] Invariant cache hit.
[2023-03-22 00:35:44] [INFO ] Implicit Places using invariants in 5910 ms returned []
Implicit Place search using SMT only with invariants took 5911 ms to find 0 implicit places.
[2023-03-22 00:35:44] [INFO ] Invariant cache hit.
[2023-03-22 00:35:45] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7744 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 179 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 946 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:35:47] [INFO ] Invariant cache hit.
[2023-03-22 00:35:53] [INFO ] Implicit Places using invariants in 6412 ms returned []
Implicit Place search using SMT only with invariants took 6412 ms to find 0 implicit places.
[2023-03-22 00:35:53] [INFO ] Invariant cache hit.
[2023-03-22 00:36:11] [INFO ] Dead Transitions using invariants and state equation in 17750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25111 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8248 ms. (steps per millisecond=1 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:36:22] [INFO ] Invariant cache hit.
[2023-03-22 00:36:23] [INFO ] After 995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:36:25] [INFO ] [Nat]Absence check using 2673 positive place invariants in 844 ms returned sat
[2023-03-22 00:36:25] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 626 ms returned sat
[2023-03-22 00:36:45] [INFO ] After 19623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:36:48] [INFO ] After 22272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 00:36:48] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2005 ms.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1093 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8291 ms. (steps per millisecond=1 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Probabilistic random walk after 287323 steps, saw 287159 distinct states, run finished after 30005 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:37:31] [INFO ] Invariant cache hit.
[2023-03-22 00:37:32] [INFO ] After 1037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:37:34] [INFO ] [Nat]Absence check using 2673 positive place invariants in 813 ms returned sat
[2023-03-22 00:37:34] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 609 ms returned sat
[2023-03-22 00:37:54] [INFO ] After 19085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:37:57] [INFO ] After 21887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 580 ms.
[2023-03-22 00:37:57] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2007 ms.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1126 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1126 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1132 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:38:02] [INFO ] Invariant cache hit.
[2023-03-22 00:38:08] [INFO ] Implicit Places using invariants in 6362 ms returned []
Implicit Place search using SMT only with invariants took 6363 ms to find 0 implicit places.
[2023-03-22 00:38:08] [INFO ] Invariant cache hit.
[2023-03-22 00:38:24] [INFO ] Dead Transitions using invariants and state equation in 16085 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23587 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 157 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 159 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Product exploration timeout after 24250 steps with 9719 reset in 10002 ms.
Product exploration timeout after 12370 steps with 786 reset in 10004 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 170 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1150 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:38:46] [INFO ] Invariant cache hit.
[2023-03-22 00:39:03] [INFO ] Dead Transitions using invariants and state equation in 16927 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18079 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 990 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:39:04] [INFO ] Invariant cache hit.
[2023-03-22 00:39:11] [INFO ] Implicit Places using invariants in 6288 ms returned []
Implicit Place search using SMT only with invariants took 6289 ms to find 0 implicit places.
[2023-03-22 00:39:11] [INFO ] Invariant cache hit.
[2023-03-22 00:39:27] [INFO ] Dead Transitions using invariants and state equation in 16899 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24181 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14 finished in 380510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1270 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:39:29] [INFO ] Invariant cache hit.
[2023-03-22 00:39:30] [INFO ] Implicit Places using invariants in 767 ms returned []
Implicit Place search using SMT only with invariants took 769 ms to find 0 implicit places.
[2023-03-22 00:39:30] [INFO ] Invariant cache hit.
[2023-03-22 00:39:46] [INFO ] Dead Transitions using invariants and state equation in 15856 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17901 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7014 s2285)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 12430 steps with 1 reset in 10008 ms.
Product exploration timeout after 12100 steps with 0 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7834 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Probabilistic random walk after 244378 steps, saw 244230 distinct states, run finished after 24009 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:40:39] [INFO ] Invariant cache hit.
[2023-03-22 00:40:40] [INFO ] After 822ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:40:42] [INFO ] [Nat]Absence check using 2673 positive place invariants in 885 ms returned sat
[2023-03-22 00:40:42] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 714 ms returned sat
[2023-03-22 00:41:01] [INFO ] After 18107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:41:02] [INFO ] After 19136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 667 ms.
[2023-03-22 00:41:02] [INFO ] After 22312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1044 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Finished random walk after 9002 steps, including 2 resets, run visited all 1 properties in 6882 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 930 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:41:14] [INFO ] Invariant cache hit.
[2023-03-22 00:41:20] [INFO ] Implicit Places using invariants in 6211 ms returned []
Implicit Place search using SMT only with invariants took 6212 ms to find 0 implicit places.
[2023-03-22 00:41:20] [INFO ] Invariant cache hit.
[2023-03-22 00:41:36] [INFO ] Dead Transitions using invariants and state equation in 16111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23258 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8102 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Probabilistic random walk after 250000 steps, saw 249850 distinct states, run finished after 24098 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:42:09] [INFO ] Invariant cache hit.
[2023-03-22 00:42:10] [INFO ] After 812ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:42:11] [INFO ] [Nat]Absence check using 2673 positive place invariants in 789 ms returned sat
[2023-03-22 00:42:12] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 625 ms returned sat
[2023-03-22 00:42:28] [INFO ] After 15292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:42:28] [INFO ] After 16199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 553 ms.
[2023-03-22 00:42:29] [INFO ] After 18976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1098 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1099 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7806 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263196 steps, run timeout after 24039 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 263196 steps, saw 263040 distinct states, run finished after 24040 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:43:05] [INFO ] Invariant cache hit.
[2023-03-22 00:43:05] [INFO ] After 686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:43:07] [INFO ] [Nat]Absence check using 2673 positive place invariants in 753 ms returned sat
[2023-03-22 00:43:07] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 630 ms returned sat
[2023-03-22 00:43:24] [INFO ] After 16993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:43:25] [INFO ] After 17978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 614 ms.
[2023-03-22 00:43:26] [INFO ] After 20768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2004 ms.
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 991 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 991 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1023 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:43:30] [INFO ] Invariant cache hit.
[2023-03-22 00:43:36] [INFO ] Implicit Places using invariants in 6426 ms returned []
Implicit Place search using SMT only with invariants took 6427 ms to find 0 implicit places.
[2023-03-22 00:43:36] [INFO ] Invariant cache hit.
[2023-03-22 00:43:52] [INFO ] Dead Transitions using invariants and state equation in 15983 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23438 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 11890 steps with 0 reset in 10007 ms.
Product exploration timeout after 12060 steps with 1 reset in 10003 ms.
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1055 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:44:14] [INFO ] Invariant cache hit.
[2023-03-22 00:44:20] [INFO ] Implicit Places using invariants in 6303 ms returned []
Implicit Place search using SMT only with invariants took 6304 ms to find 0 implicit places.
[2023-03-22 00:44:20] [INFO ] Invariant cache hit.
[2023-03-22 00:44:38] [INFO ] Dead Transitions using invariants and state equation in 17544 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24904 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-15 finished in 310376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&F(p1))))||G(p2)))'
Found a Shortening insensitive property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1354 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:44:41] [INFO ] Invariant cache hit.
[2023-03-22 00:44:41] [INFO ] Implicit Places using invariants in 796 ms returned []
Implicit Place search using SMT only with invariants took 799 ms to find 0 implicit places.
[2023-03-22 00:44:41] [INFO ] Invariant cache hit.
[2023-03-22 00:44:57] [INFO ] Dead Transitions using invariants and state equation in 15818 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 17975 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (LEQ s2023 s6621) (LEQ s2948 s2791)), p0:(GT s2948 s2791), p2:(LEQ 1 s5477)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 12170 steps with 0 reset in 10001 ms.
Product exploration timeout after 12300 steps with 2 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 316 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 4457 steps, including 1 resets, run visited all 3 properties in 3433 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 410 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-22 00:45:22] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-22 00:45:37] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4 out of 7533 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1073 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:45:53] [INFO ] Invariant cache hit.
[2023-03-22 00:46:00] [INFO ] Implicit Places using invariants in 6386 ms returned []
Implicit Place search using SMT only with invariants took 6387 ms to find 0 implicit places.
[2023-03-22 00:46:00] [INFO ] Invariant cache hit.
[2023-03-22 00:46:17] [INFO ] Dead Transitions using invariants and state equation in 17068 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24530 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 3229 steps, including 0 resets, run visited all 3 properties in 2680 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-22 00:46:21] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-22 00:46:36] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration timeout after 12000 steps with 1 reset in 10005 ms.
Product exploration timeout after 11360 steps with 0 reset in 10006 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1119 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:47:12] [INFO ] Invariant cache hit.
[2023-03-22 00:47:29] [INFO ] Dead Transitions using invariants and state equation in 17298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18419 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1060 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:47:31] [INFO ] Invariant cache hit.
[2023-03-22 00:47:31] [INFO ] Implicit Places using invariants in 810 ms returned []
Implicit Place search using SMT only with invariants took 812 ms to find 0 implicit places.
[2023-03-22 00:47:31] [INFO ] Invariant cache hit.
[2023-03-22 00:47:32] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2630 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12 finished in 173987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(G(p0) U (!p0 U p1)))||F(p2))))'
Found a Shortening insensitive property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14
Stuttering acceptance computed with spot in 190 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0)]
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1204 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:47:34] [INFO ] Invariant cache hit.
[2023-03-22 00:47:35] [INFO ] Implicit Places using invariants in 702 ms returned []
Implicit Place search using SMT only with invariants took 702 ms to find 0 implicit places.
[2023-03-22 00:47:35] [INFO ] Invariant cache hit.
[2023-03-22 00:47:51] [INFO ] Dead Transitions using invariants and state equation in 16373 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18284 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Running random walk in product with property : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s353 s904), p1:(LEQ s2531 s1478), p0:(GT s6283 s2443)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 25130 steps with 10605 reset in 10003 ms.
Product exploration timeout after 25800 steps with 9611 reset in 11640 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8120 ms. (steps per millisecond=1 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:48:24] [INFO ] Invariant cache hit.
[2023-03-22 00:48:25] [INFO ] After 884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:48:26] [INFO ] [Nat]Absence check using 2673 positive place invariants in 800 ms returned sat
[2023-03-22 00:48:27] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 652 ms returned sat
[2023-03-22 00:48:47] [INFO ] After 19362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:48:49] [INFO ] After 22150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-22 00:48:50] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2005 ms.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1081 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1081 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7854 ms. (steps per millisecond=1 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Probabilistic random walk after 244378 steps, saw 244230 distinct states, run finished after 27054 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:49:30] [INFO ] Invariant cache hit.
[2023-03-22 00:49:31] [INFO ] After 1004ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:49:32] [INFO ] [Nat]Absence check using 2673 positive place invariants in 825 ms returned sat
[2023-03-22 00:49:33] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 654 ms returned sat
[2023-03-22 00:49:54] [INFO ] After 20259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:50:20] [INFO ] Deduced a trap composed of 2 places in 23850 ms of which 9 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:50:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:50:20] [INFO ] After 48896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2002 ms.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1108 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1108 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1073 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:50:24] [INFO ] Invariant cache hit.
[2023-03-22 00:50:29] [INFO ] Implicit Places using invariants in 5720 ms returned []
Implicit Place search using SMT only with invariants took 5720 ms to find 0 implicit places.
[2023-03-22 00:50:29] [INFO ] Invariant cache hit.
[2023-03-22 00:50:45] [INFO ] Dead Transitions using invariants and state equation in 15210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22008 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 152 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 973 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:50:46] [INFO ] Invariant cache hit.
[2023-03-22 00:50:52] [INFO ] Implicit Places using invariants in 5777 ms returned []
Implicit Place search using SMT only with invariants took 5780 ms to find 0 implicit places.
[2023-03-22 00:50:52] [INFO ] Invariant cache hit.
[2023-03-22 00:51:08] [INFO ] Dead Transitions using invariants and state equation in 16390 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23144 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8045 ms. (steps per millisecond=1 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:51:19] [INFO ] Invariant cache hit.
[2023-03-22 00:51:20] [INFO ] After 941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:51:22] [INFO ] [Nat]Absence check using 2673 positive place invariants in 858 ms returned sat
[2023-03-22 00:51:22] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 660 ms returned sat
[2023-03-22 00:51:42] [INFO ] After 19541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:51:45] [INFO ] After 22325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 00:51:45] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2002 ms.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1050 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1050 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7762 ms. (steps per millisecond=1 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 268930 steps, run timeout after 27053 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 268930 steps, saw 268772 distinct states, run finished after 27053 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:52:25] [INFO ] Invariant cache hit.
[2023-03-22 00:52:26] [INFO ] After 929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:52:27] [INFO ] [Nat]Absence check using 2673 positive place invariants in 825 ms returned sat
[2023-03-22 00:52:28] [INFO ] [Nat]Absence check using 2673 positive and 1 generalized place invariants in 624 ms returned sat
[2023-03-22 00:52:48] [INFO ] After 19664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:52:51] [INFO ] After 22470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 00:52:51] [INFO ] After 25153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2009 ms.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1062 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1118 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:52:55] [INFO ] Invariant cache hit.
[2023-03-22 00:53:01] [INFO ] Implicit Places using invariants in 6086 ms returned []
Implicit Place search using SMT only with invariants took 6087 ms to find 0 implicit places.
[2023-03-22 00:53:01] [INFO ] Invariant cache hit.
[2023-03-22 00:53:17] [INFO ] Dead Transitions using invariants and state equation in 15802 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23014 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 172 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Product exploration timeout after 17880 steps with 4456 reset in 10005 ms.
Product exploration timeout after 13010 steps with 1194 reset in 10008 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0)]
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1082 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:53:39] [INFO ] Invariant cache hit.
[2023-03-22 00:53:40] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1787 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 24300/24300 transitions.
Applied a total of 0 rules in 1053 ms. Remains 7533 /7533 variables (removed 0) and now considering 24300/24300 (removed 0) transitions.
[2023-03-22 00:53:41] [INFO ] Invariant cache hit.
[2023-03-22 00:53:47] [INFO ] Implicit Places using invariants in 6388 ms returned []
Implicit Place search using SMT only with invariants took 6397 ms to find 0 implicit places.
[2023-03-22 00:53:47] [INFO ] Invariant cache hit.
[2023-03-22 00:54:03] [INFO ] Dead Transitions using invariants and state equation in 16056 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23508 ms. Remains : 7533/7533 places, 24300/24300 transitions.
Treatment of property HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14 finished in 391126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-22 00:54:05] [INFO ] Flatten gal took : 879 ms
[2023-03-22 00:54:05] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2023-03-22 00:54:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7533 places, 24300 transitions and 97200 arcs took 92 ms.
Total runtime 2282177 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2589/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2589/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2589/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2589/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2589/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2589/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2589/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-02
Could not compute solution for formula : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-03
Could not compute solution for formula : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-06
Could not compute solution for formula : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-11
Could not compute solution for formula : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12
Could not compute solution for formula : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14
Could not compute solution for formula : HypertorusGrid-PT-d5k3p2b10-LTLCardinality-15

BK_STOP 1679446574984

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name HypertorusGrid-PT-d5k3p2b10-LTLCardinality-02
ltl formula formula --ltl=/tmp/2589/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7533 places, 24300 transitions and 97200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2589/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2589/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2589/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.700 real 0.940 user 1.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2589/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name HypertorusGrid-PT-d5k3p2b10-LTLCardinality-03
ltl formula formula --ltl=/tmp/2589/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7533 places, 24300 transitions and 97200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.510 real 0.890 user 0.720 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2589/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2589/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2589/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2589/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x557424db73f4]
1: pnml2lts-mc(+0xa2496) [0x557424db7496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2edfe38140]
3: pnml2lts-mc(+0x405b30) [0x55742511ab30]
4: pnml2lts-mc(+0x16b3f9) [0x557424e803f9]
5: pnml2lts-mc(+0x164ac4) [0x557424e79ac4]
6: pnml2lts-mc(+0x272e0a) [0x557424f87e0a]
7: pnml2lts-mc(+0xb61f0) [0x557424dcb1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f2edfc8b4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f2edfc8b67a]
10: pnml2lts-mc(+0xa1581) [0x557424db6581]
11: pnml2lts-mc(+0xa1910) [0x557424db6910]
12: pnml2lts-mc(+0xa32a2) [0x557424db82a2]
13: pnml2lts-mc(+0xa50f4) [0x557424dba0f4]
14: pnml2lts-mc(+0xa516b) [0x557424dba16b]
15: pnml2lts-mc(+0x3f34b3) [0x5574251084b3]
16: pnml2lts-mc(+0x7c63d) [0x557424d9163d]
17: pnml2lts-mc(+0x67d86) [0x557424d7cd86]
18: pnml2lts-mc(+0x60a8a) [0x557424d75a8a]
19: pnml2lts-mc(+0x5eb15) [0x557424d73b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f2edfc73d0a]
21: pnml2lts-mc(+0x6075e) [0x557424d7575e]
ltl formula name HypertorusGrid-PT-d5k3p2b10-LTLCardinality-06
ltl formula formula --ltl=/tmp/2589/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7533 places, 24300 transitions and 97200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.420 real 0.820 user 0.750 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2589/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2589/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2589/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2589/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name HypertorusGrid-PT-d5k3p2b10-LTLCardinality-11
ltl formula formula --ltl=/tmp/2589/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7533 places, 24300 transitions and 97200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.430 real 0.780 user 0.840 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2589/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2589/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2589/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2589/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12
ltl formula formula --ltl=/tmp/2589/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7533 places, 24300 transitions and 97200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.310 real 0.840 user 0.870 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2589/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2589/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2589/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2589/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14
ltl formula formula --ltl=/tmp/2589/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7533 places, 24300 transitions and 97200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.480 real 0.870 user 0.830 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2589/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2589/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2589/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2589/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name HypertorusGrid-PT-d5k3p2b10-LTLCardinality-15
ltl formula formula --ltl=/tmp/2589/ltl_6_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7533 places, 24300 transitions and 97200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.610 real 0.830 user 0.890 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2589/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2589/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2589/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2589/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HypertorusGrid-PT-d5k3p2b10, 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 r233-tall-167856418300067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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