Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025800811.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800811
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.7K Apr 30 06:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 06:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 244K May 10 09:34 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 ShieldRVs-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653052580981

Running Version 202205111006
[2022-05-20 13:16:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 13:16:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 13:16:22] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-05-20 13:16:22] [INFO ] Transformed 803 places.
[2022-05-20 13:16:22] [INFO ] Transformed 903 transitions.
[2022-05-20 13:16:22] [INFO ] Found NUPN structural information;
[2022-05-20 13:16:22] [INFO ] Parsed PT model containing 803 places and 903 transitions in 242 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 4 formulas.
FORMULA ShieldRVs-PT-020B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 903/903 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 675 transition count 775
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 675 transition count 775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 257 place count 674 transition count 774
Iterating global reduction 0 with 1 rules applied. Total rules applied 258 place count 674 transition count 774
Applied a total of 258 rules in 126 ms. Remains 674 /803 variables (removed 129) and now considering 774/903 (removed 129) transitions.
// Phase 1: matrix 774 rows 674 cols
[2022-05-20 13:16:22] [INFO ] Computed 81 place invariants in 26 ms
[2022-05-20 13:16:23] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 774 rows 674 cols
[2022-05-20 13:16:23] [INFO ] Computed 81 place invariants in 9 ms
[2022-05-20 13:16:23] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
// Phase 1: matrix 774 rows 674 cols
[2022-05-20 13:16:23] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 13:16:24] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 674/803 places, 774/903 transitions.
Finished structural reductions, in 1 iterations. Remains : 674/803 places, 774/903 transitions.
Support contains 40 out of 674 places after structural reductions.
[2022-05-20 13:16:24] [INFO ] Flatten gal took : 122 ms
[2022-05-20 13:16:24] [INFO ] Flatten gal took : 70 ms
[2022-05-20 13:16:24] [INFO ] Input system was already deterministic with 774 transitions.
Support contains 38 out of 674 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 774 rows 674 cols
[2022-05-20 13:16:25] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 13:16:25] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 13:16:25] [INFO ] [Nat]Absence check using 81 positive place invariants in 27 ms returned sat
[2022-05-20 13:16:26] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-05-20 13:16:26] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 4 ms to minimize.
[2022-05-20 13:16:26] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2022-05-20 13:16:26] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2022-05-20 13:16:26] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 0 ms to minimize.
[2022-05-20 13:16:27] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 1 ms to minimize.
[2022-05-20 13:16:27] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2022-05-20 13:16:27] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2022-05-20 13:16:27] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2022-05-20 13:16:27] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2022-05-20 13:16:27] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2022-05-20 13:16:27] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2022-05-20 13:16:28] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2022-05-20 13:16:28] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2022-05-20 13:16:28] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2022-05-20 13:16:28] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2022-05-20 13:16:28] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2022-05-20 13:16:28] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2022-05-20 13:16:28] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-05-20 13:16:28] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2022-05-20 13:16:29] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2022-05-20 13:16:29] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2810 ms
[2022-05-20 13:16:29] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2022-05-20 13:16:29] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2022-05-20 13:16:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2022-05-20 13:16:29] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2022-05-20 13:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-20 13:16:29] [INFO ] After 3783ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 171 ms.
[2022-05-20 13:16:29] [INFO ] After 4182ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 13 out of 674 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 674/674 places, 774/774 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 674 transition count 698
Reduce places removed 76 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 78 rules applied. Total rules applied 154 place count 598 transition count 696
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 596 transition count 696
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 156 place count 596 transition count 596
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 356 place count 496 transition count 596
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 364 place count 488 transition count 588
Iterating global reduction 3 with 8 rules applied. Total rules applied 372 place count 488 transition count 588
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 372 place count 488 transition count 582
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 384 place count 482 transition count 582
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 4 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 746 place count 301 transition count 401
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 785 place count 301 transition count 401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 786 place count 300 transition count 400
Applied a total of 786 rules in 152 ms. Remains 300 /674 variables (removed 374) and now considering 400/774 (removed 374) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/674 places, 400/774 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 400 rows 300 cols
[2022-05-20 13:16:30] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:16:30] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 13:16:30] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2022-05-20 13:16:30] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 13:16:30] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2022-05-20 13:16:30] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2022-05-20 13:16:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2022-05-20 13:16:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2022-05-20 13:16:30] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-20 13:16:30] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 300/300 places, 400/400 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 300 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 299 transition count 399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 299 transition count 398
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 298 transition count 398
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 294 transition count 394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 293 transition count 393
Applied a total of 13 rules in 44 ms. Remains 293 /300 variables (removed 7) and now considering 393/400 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 293/300 places, 393/400 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 557046 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 557046 steps, saw 110864 distinct states, run finished after 3003 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 393 rows 293 cols
[2022-05-20 13:16:34] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:16:34] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 13:16:34] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2022-05-20 13:16:34] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 13:16:34] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2022-05-20 13:16:34] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2022-05-20 13:16:34] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-05-20 13:16:34] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-20 13:16:34] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2022-05-20 13:16:34] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2022-05-20 13:16:34] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2022-05-20 13:16:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 402 ms
[2022-05-20 13:16:34] [INFO ] After 595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-20 13:16:34] [INFO ] After 705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 293 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 293/293 places, 393/393 transitions.
Applied a total of 0 rules in 10 ms. Remains 293 /293 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 293/293 places, 393/393 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 293/293 places, 393/393 transitions.
Applied a total of 0 rules in 11 ms. Remains 293 /293 variables (removed 0) and now considering 393/393 (removed 0) transitions.
// Phase 1: matrix 393 rows 293 cols
[2022-05-20 13:16:34] [INFO ] Computed 81 place invariants in 8 ms
[2022-05-20 13:16:35] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 393 rows 293 cols
[2022-05-20 13:16:35] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:16:35] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2022-05-20 13:16:35] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 393 rows 293 cols
[2022-05-20 13:16:35] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:16:35] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 293/293 places, 393/393 transitions.
Applied a total of 0 rules in 16 ms. Remains 293 /293 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 393 rows 293 cols
[2022-05-20 13:16:35] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:16:35] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 13:16:35] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-05-20 13:16:35] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 13:16:36] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2022-05-20 13:16:36] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-20 13:16:36] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-05-20 13:16:36] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2022-05-20 13:16:36] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2022-05-20 13:16:36] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2022-05-20 13:16:36] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2022-05-20 13:16:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 429 ms
[2022-05-20 13:16:36] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-20 13:16:36] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 13:16:36] [INFO ] Flatten gal took : 28 ms
[2022-05-20 13:16:36] [INFO ] Flatten gal took : 25 ms
[2022-05-20 13:16:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6991958945211645375.gal : 25 ms
[2022-05-20 13:16:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3948702169125083339.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17577340748500365490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6991958945211645375.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3948702169125083339.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3948702169125083339.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 333
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :333 after 445
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :445 after 1324
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1324 after 18220
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :18220 after 482323
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :482323 after 7.38789e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7.38789e+06 after 1.63963e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.63963e+08 after 1.56762e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.56762e+10 after 1.50147e+12
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.50147e+12 after 5.52358e+14
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :5.52358e+14 after 6.1579e+18
Detected timeout of ITS tools.
[2022-05-20 13:16:51] [INFO ] Flatten gal took : 25 ms
[2022-05-20 13:16:51] [INFO ] Applying decomposition
[2022-05-20 13:16:51] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16238960737295684871.txt' '-o' '/tmp/graph16238960737295684871.bin' '-w' '/tmp/graph16238960737295684871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16238960737295684871.bin' '-l' '-1' '-v' '-w' '/tmp/graph16238960737295684871.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:16:51] [INFO ] Decomposing Gal with order
[2022-05-20 13:16:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:16:51] [INFO ] Removed a total of 442 redundant transitions.
[2022-05-20 13:16:51] [INFO ] Flatten gal took : 110 ms
[2022-05-20 13:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 450 labels/synchronizations in 17 ms.
[2022-05-20 13:16:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15683945986572677121.gal : 5 ms
[2022-05-20 13:16:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6344349614622727598.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17577340748500365490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15683945986572677121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6344349614622727598.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality6344349614622727598.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3 after 4131
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :12888 after 8.18726e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2298496449115806934
[2022-05-20 13:17:07] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2298496449115806934
Running compilation step : cd /tmp/ltsmin2298496449115806934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 740 ms.
Running link step : cd /tmp/ltsmin2298496449115806934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2298496449115806934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA ShieldRVs-PT-020B-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA ShieldRVs-PT-020B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 167 stabilizing places and 167 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 673 transition count 692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 592 transition count 692
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 592 transition count 592
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 492 transition count 592
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 374 place count 480 transition count 580
Iterating global reduction 2 with 12 rules applied. Total rules applied 386 place count 480 transition count 580
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 386 place count 480 transition count 572
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 402 place count 472 transition count 572
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 187
Deduced a syphon composed of 187 places in 1 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 2 with 374 rules applied. Total rules applied 776 place count 285 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 778 place count 283 transition count 383
Applied a total of 778 rules in 70 ms. Remains 283 /674 variables (removed 391) and now considering 383/774 (removed 391) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:17:22] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:17:22] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:17:22] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:17:22] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2022-05-20 13:17:22] [INFO ] Redundant transitions in 71 ms returned [382]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:17:22] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:17:23] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/674 places, 382/774 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 283/674 places, 382/774 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 251 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-020B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLCardinality-00 finished in 972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(F(G(p0)))))))'
Support contains 4 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 673 transition count 695
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 157 place count 595 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 594 transition count 694
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 158 place count 594 transition count 593
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 360 place count 493 transition count 593
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 370 place count 483 transition count 583
Iterating global reduction 3 with 10 rules applied. Total rules applied 380 place count 483 transition count 583
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 380 place count 483 transition count 576
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 394 place count 476 transition count 576
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 372 rules applied. Total rules applied 766 place count 290 transition count 390
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 768 place count 288 transition count 388
Applied a total of 768 rules in 67 ms. Remains 288 /674 variables (removed 386) and now considering 388/774 (removed 386) transitions.
// Phase 1: matrix 388 rows 288 cols
[2022-05-20 13:17:23] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:17:23] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 388 rows 288 cols
[2022-05-20 13:17:23] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:17:23] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2022-05-20 13:17:23] [INFO ] Redundant transitions in 67 ms returned [387]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:17:23] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:17:24] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 288/674 places, 387/774 transitions.
Applied a total of 0 rules in 15 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 288/674 places, 387/774 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s256 0) (EQ s197 1) (EQ s145 0) (EQ s216 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 355 reset in 368 ms.
Product exploration explored 100000 steps with 357 reset in 371 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 830471 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 830471 steps, saw 119976 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:17:28] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:17:28] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:17:28] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-05-20 13:17:28] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:17:28] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-20 13:17:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-20 13:17:28] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-20 13:17:28] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 387/387 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 288 transition count 387
Applied a total of 40 rules in 13 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 723115 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 723115 steps, saw 138169 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:17:31] [INFO ] Computed 81 place invariants in 5 ms
[2022-05-20 13:17:31] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:17:31] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2022-05-20 13:17:31] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:17:31] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2022-05-20 13:17:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-05-20 13:17:31] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-20 13:17:31] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 9 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 6 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:17:31] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:17:31] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:17:31] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:17:32] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2022-05-20 13:17:32] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:17:32] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:17:32] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 6 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:17:32] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:17:32] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:17:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-05-20 13:17:32] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:17:32] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2022-05-20 13:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-05-20 13:17:32] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-20 13:17:32] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 13:17:32] [INFO ] Flatten gal took : 23 ms
[2022-05-20 13:17:32] [INFO ] Flatten gal took : 21 ms
[2022-05-20 13:17:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12588097141778666960.gal : 3 ms
[2022-05-20 13:17:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9353280507966569847.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13442590754998791247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12588097141778666960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9353280507966569847.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9353280507966569847.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 85
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :85 after 118
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :118 after 298
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :298 after 1987
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1987 after 18046
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18046 after 565380
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :565380 after 7.36001e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.36001e+06 after 4.53489e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.53489e+08 after 4.59603e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.59603e+10 after 5.79804e+12
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.79804e+12 after 4.84053e+15
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.84053e+15 after 1.3473e+20
Detected timeout of ITS tools.
[2022-05-20 13:17:47] [INFO ] Flatten gal took : 19 ms
[2022-05-20 13:17:47] [INFO ] Applying decomposition
[2022-05-20 13:17:47] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5315757596343174191.txt' '-o' '/tmp/graph5315757596343174191.bin' '-w' '/tmp/graph5315757596343174191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5315757596343174191.bin' '-l' '-1' '-v' '-w' '/tmp/graph5315757596343174191.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:17:47] [INFO ] Decomposing Gal with order
[2022-05-20 13:17:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:17:48] [INFO ] Removed a total of 433 redundant transitions.
[2022-05-20 13:17:48] [INFO ] Flatten gal took : 36 ms
[2022-05-20 13:17:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 483 labels/synchronizations in 7 ms.
[2022-05-20 13:17:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6687286997152449688.gal : 3 ms
[2022-05-20 13:17:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5759007156411181432.prop : 163 ms
Invoking ITS tools like this :cd /tmp/redAtoms13442590754998791247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6687286997152449688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5759007156411181432.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5759007156411181432.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4278 after 42915
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :42915 after 1.34374e+18
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14893562367472714558
[2022-05-20 13:18:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14893562367472714558
Running compilation step : cd /tmp/ltsmin14893562367472714558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 622 ms.
Running link step : cd /tmp/ltsmin14893562367472714558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14893562367472714558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 11 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:18] [INFO ] Computed 81 place invariants in 6 ms
[2022-05-20 13:18:18] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:18] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:18:18] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2022-05-20 13:18:19] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:19] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:18:19] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 834510 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{}
Probabilistic random walk after 834510 steps, saw 120585 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:22] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:18:22] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:18:22] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-05-20 13:18:22] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:18:22] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-05-20 13:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-20 13:18:22] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-20 13:18:22] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 387/387 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 288 transition count 387
Applied a total of 40 rules in 10 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 701260 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 701260 steps, saw 134970 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:25] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:18:25] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:18:26] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-05-20 13:18:26] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:18:26] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2022-05-20 13:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2022-05-20 13:18:26] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-20 13:18:26] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 7 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 15 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:26] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:18:26] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:26] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:18:26] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2022-05-20 13:18:26] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:26] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:18:26] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 5 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:18:26] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:18:26] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:18:26] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-05-20 13:18:27] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:18:27] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2022-05-20 13:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-05-20 13:18:27] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 13:18:27] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 13:18:27] [INFO ] Flatten gal took : 17 ms
[2022-05-20 13:18:27] [INFO ] Flatten gal took : 17 ms
[2022-05-20 13:18:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1535168269315702917.gal : 3 ms
[2022-05-20 13:18:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11056517659810854788.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2297214891872692099;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1535168269315702917.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11056517659810854788.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11056517659810854788.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 85
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :85 after 118
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :118 after 298
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :298 after 1987
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1987 after 18046
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18046 after 565380
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :565380 after 7.36001e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.36001e+06 after 4.53489e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.53489e+08 after 4.59603e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.59603e+10 after 5.79804e+12
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.79804e+12 after 4.84053e+15
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.84053e+15 after 1.3473e+20
Detected timeout of ITS tools.
[2022-05-20 13:18:42] [INFO ] Flatten gal took : 18 ms
[2022-05-20 13:18:42] [INFO ] Applying decomposition
[2022-05-20 13:18:42] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10300268393284037807.txt' '-o' '/tmp/graph10300268393284037807.bin' '-w' '/tmp/graph10300268393284037807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10300268393284037807.bin' '-l' '-1' '-v' '-w' '/tmp/graph10300268393284037807.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:18:42] [INFO ] Decomposing Gal with order
[2022-05-20 13:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:18:42] [INFO ] Removed a total of 433 redundant transitions.
[2022-05-20 13:18:42] [INFO ] Flatten gal took : 55 ms
[2022-05-20 13:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 475 labels/synchronizations in 6 ms.
[2022-05-20 13:18:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15637426839730576752.gal : 9 ms
[2022-05-20 13:18:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14814204274169592967.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2297214891872692099;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15637426839730576752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14814204274169592967.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality14814204274169592967.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4278 after 268695
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :268695 after 2.43486e+18
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6003354928728762361
[2022-05-20 13:18:57] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6003354928728762361
Running compilation step : cd /tmp/ltsmin6003354928728762361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 634 ms.
Running link step : cd /tmp/ltsmin6003354928728762361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6003354928728762361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 356 reset in 315 ms.
Product exploration explored 100000 steps with 358 reset in 334 ms.
Built C files in :
/tmp/ltsmin13967763180784207677
[2022-05-20 13:19:13] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2022-05-20 13:19:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:13] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2022-05-20 13:19:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:13] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2022-05-20 13:19:13] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:13] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13967763180784207677
Running compilation step : cd /tmp/ltsmin13967763180784207677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 795 ms.
Running link step : cd /tmp/ltsmin13967763180784207677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13967763180784207677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8589828467292240618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 387/387 transitions.
Applied a total of 0 rules in 9 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:19:28] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:19:28] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:19:28] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:19:28] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2022-05-20 13:19:29] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:19:29] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:19:29] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 288/288 places, 387/387 transitions.
Built C files in :
/tmp/ltsmin1965370170675317985
[2022-05-20 13:19:29] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2022-05-20 13:19:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:29] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2022-05-20 13:19:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:29] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2022-05-20 13:19:29] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:19:29] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1965370170675317985
Running compilation step : cd /tmp/ltsmin1965370170675317985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 792 ms.
Running link step : cd /tmp/ltsmin1965370170675317985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1965370170675317985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14654792025285362244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 13:19:44] [INFO ] Flatten gal took : 17 ms
[2022-05-20 13:19:44] [INFO ] Flatten gal took : 16 ms
[2022-05-20 13:19:44] [INFO ] Time to serialize gal into /tmp/LTL17048738964600758203.gal : 2 ms
[2022-05-20 13:19:44] [INFO ] Time to serialize properties into /tmp/LTL8811040784519252391.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17048738964600758203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8811040784519252391.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1704873...267
Read 1 LTL properties
Checking formula 0 : !((G(X(F(X(F(G("(((p714==0)||(p561==1))||((p422==0)||(p610==1)))"))))))))
Formula 0 simplified : !GXFXFG"(((p714==0)||(p561==1))||((p422==0)||(p610==1)))"
Detected timeout of ITS tools.
[2022-05-20 13:19:59] [INFO ] Flatten gal took : 15 ms
[2022-05-20 13:19:59] [INFO ] Applying decomposition
[2022-05-20 13:19:59] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7184174421403077513.txt' '-o' '/tmp/graph7184174421403077513.bin' '-w' '/tmp/graph7184174421403077513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7184174421403077513.bin' '-l' '-1' '-v' '-w' '/tmp/graph7184174421403077513.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:19:59] [INFO ] Decomposing Gal with order
[2022-05-20 13:19:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:19:59] [INFO ] Removed a total of 418 redundant transitions.
[2022-05-20 13:19:59] [INFO ] Flatten gal took : 43 ms
[2022-05-20 13:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 410 labels/synchronizations in 21 ms.
[2022-05-20 13:19:59] [INFO ] Time to serialize gal into /tmp/LTL1825615751686022574.gal : 15 ms
[2022-05-20 13:19:59] [INFO ] Time to serialize properties into /tmp/LTL6918159934917187728.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1825615751686022574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6918159934917187728.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1825615...245
Read 1 LTL properties
Checking formula 0 : !((G(X(F(X(F(G("(((i9.i1.u74.p714==0)||(i7.i0.u56.p561==1))||((i5.i1.u41.p422==0)||(i8.u61.p610==1)))"))))))))
Formula 0 simplified : !GXFXFG"(((i9.i1.u74.p714==0)||(i7.i0.u56.p561==1))||((i5.i1.u41.p422==0)||(i8.u61.p610==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12945006184726330936
[2022-05-20 13:20:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12945006184726330936
Running compilation step : cd /tmp/ltsmin12945006184726330936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 618 ms.
Running link step : cd /tmp/ltsmin12945006184726330936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12945006184726330936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>(X(<>([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-020B-LTLCardinality-01 finished in 186470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(X(X(p0)))))))'
Support contains 2 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 673 transition count 692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 592 transition count 692
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 592 transition count 592
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 492 transition count 592
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 373 place count 481 transition count 581
Iterating global reduction 2 with 11 rules applied. Total rules applied 384 place count 481 transition count 581
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 384 place count 481 transition count 573
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 400 place count 473 transition count 573
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 187
Deduced a syphon composed of 187 places in 0 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 2 with 374 rules applied. Total rules applied 774 place count 286 transition count 386
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 776 place count 284 transition count 384
Applied a total of 776 rules in 53 ms. Remains 284 /674 variables (removed 390) and now considering 384/774 (removed 390) transitions.
// Phase 1: matrix 384 rows 284 cols
[2022-05-20 13:20:29] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:30] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 384 rows 284 cols
[2022-05-20 13:20:30] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:30] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2022-05-20 13:20:30] [INFO ] Redundant transitions in 61 ms returned [383]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 383 rows 284 cols
[2022-05-20 13:20:30] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:30] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/674 places, 383/774 transitions.
Applied a total of 0 rules in 13 ms. Remains 284 /284 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 284/674 places, 383/774 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-03 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:(AND (EQ s171 0) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 267 steps with 2 reset in 4 ms.
FORMULA ShieldRVs-PT-020B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLCardinality-03 finished in 746 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p1 U (X(X(p2))&&p3))&&p0)))'
Support contains 5 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 663 transition count 763
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 663 transition count 763
Applied a total of 22 rules in 21 ms. Remains 663 /674 variables (removed 11) and now considering 763/774 (removed 11) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:30] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:20:30] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:30] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:31] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:31] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:31] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/674 places, 763/774 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/674 places, 763/774 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND p2 p3)), (OR (AND (NOT p0) p2) (AND p2 p3)), (AND p2 p3), (OR (AND (NOT p0) p2) (AND p2 p3)), (OR (AND (NOT p0) p2) (AND p2 p3)), (AND p2 p3)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p3), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p3), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=p3, acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p3 p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p3 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p3 p2), acceptance={0} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(AND (EQ s275 0) (EQ s646 1)), p3:(EQ s367 1), p1:(OR (EQ s646 0) (EQ s275 1) (EQ s136 0) (EQ s294 1)), p2:(OR (EQ s646 0) (EQ s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 857 steps with 0 reset in 9 ms.
FORMULA ShieldRVs-PT-020B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLCardinality-04 finished in 1395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 663 transition count 763
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 663 transition count 763
Applied a total of 22 rules in 14 ms. Remains 663 /674 variables (removed 11) and now considering 763/774 (removed 11) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:31] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:32] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:32] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:32] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:32] [INFO ] Computed 81 place invariants in 7 ms
[2022-05-20 13:20:32] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/674 places, 763/774 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/674 places, 763/774 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s648 0) (EQ s594 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Product exploration explored 100000 steps with 50000 reset in 507 ms.
Computed a total of 159 stabilizing places and 159 stable transitions
Computed a total of 159 stabilizing places and 159 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-020B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-020B-LTLCardinality-07 finished in 2351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)&&p1))))'
Support contains 4 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 663 transition count 763
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 663 transition count 763
Applied a total of 22 rules in 21 ms. Remains 663 /674 variables (removed 11) and now considering 763/774 (removed 11) transitions.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:34] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-20 13:20:34] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:34] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:20:35] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 663 cols
[2022-05-20 13:20:35] [INFO ] Computed 81 place invariants in 7 ms
[2022-05-20 13:20:35] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/674 places, 763/774 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/674 places, 763/774 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s494 1)), p1:(OR (EQ s184 0) (EQ s524 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 514 ms.
Product exploration explored 100000 steps with 50000 reset in 503 ms.
Computed a total of 160 stabilizing places and 160 stable transitions
Computed a total of 160 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 6 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-020B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-020B-LTLCardinality-08 finished in 2402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)&&p1))))'
Support contains 3 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 673 transition count 692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 592 transition count 692
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 162 place count 592 transition count 593
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 360 place count 493 transition count 593
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 370 place count 483 transition count 583
Iterating global reduction 2 with 10 rules applied. Total rules applied 380 place count 483 transition count 583
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 380 place count 483 transition count 576
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 394 place count 476 transition count 576
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Deduced a syphon composed of 189 places in 1 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 2 with 378 rules applied. Total rules applied 772 place count 287 transition count 387
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 774 place count 285 transition count 385
Applied a total of 774 rules in 51 ms. Remains 285 /674 variables (removed 389) and now considering 385/774 (removed 389) transitions.
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:20:36] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:36] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 385 rows 285 cols
[2022-05-20 13:20:36] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:37] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2022-05-20 13:20:37] [INFO ] Redundant transitions in 85 ms returned [384]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 384 rows 285 cols
[2022-05-20 13:20:37] [INFO ] Computed 81 place invariants in 0 ms
[2022-05-20 13:20:37] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/674 places, 384/774 transitions.
Applied a total of 0 rules in 5 ms. Remains 285 /285 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 285/674 places, 384/774 transitions.
Stuttering acceptance computed with spot in 39 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s213 1), p1:(OR (EQ s92 0) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 270 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-020B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLCardinality-09 finished in 758 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0) U !p0)||X(F(p0))||G(p1)))'
Support contains 4 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 674 transition count 695
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 159 place count 595 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 594 transition count 694
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 160 place count 594 transition count 595
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 358 place count 495 transition count 595
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 369 place count 484 transition count 584
Iterating global reduction 3 with 11 rules applied. Total rules applied 380 place count 484 transition count 584
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 380 place count 484 transition count 577
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 394 place count 477 transition count 577
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Deduced a syphon composed of 189 places in 1 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 378 rules applied. Total rules applied 772 place count 288 transition count 388
Applied a total of 772 rules in 44 ms. Remains 288 /674 variables (removed 386) and now considering 388/774 (removed 386) transitions.
// Phase 1: matrix 388 rows 288 cols
[2022-05-20 13:20:37] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:37] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 388 rows 288 cols
[2022-05-20 13:20:37] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:37] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2022-05-20 13:20:37] [INFO ] Redundant transitions in 69 ms returned [387]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 387 rows 288 cols
[2022-05-20 13:20:37] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:38] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 288/674 places, 387/774 transitions.
Applied a total of 0 rules in 5 ms. Remains 288 /288 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 288/674 places, 387/774 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1 0) (EQ s175 1)), p1:(AND (EQ s104 0) (EQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLCardinality-10 TRUE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLCardinality-10 finished in 768 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((F(p0)||X(p0)) U G(p1))))'
Support contains 6 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 673 transition count 694
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 159 place count 594 transition count 693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 593 transition count 693
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 160 place count 593 transition count 594
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 358 place count 494 transition count 594
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 368 place count 484 transition count 584
Iterating global reduction 3 with 10 rules applied. Total rules applied 378 place count 484 transition count 584
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 378 place count 484 transition count 579
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 388 place count 479 transition count 579
Performed 188 Post agglomeration using F-continuation condition.Transition count delta: 188
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 3 with 376 rules applied. Total rules applied 764 place count 291 transition count 391
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 766 place count 289 transition count 389
Applied a total of 766 rules in 49 ms. Remains 289 /674 variables (removed 385) and now considering 389/774 (removed 385) transitions.
// Phase 1: matrix 389 rows 289 cols
[2022-05-20 13:20:38] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-20 13:20:38] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 389 rows 289 cols
[2022-05-20 13:20:38] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:38] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2022-05-20 13:20:38] [INFO ] Redundant transitions in 74 ms returned [388]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 388 rows 289 cols
[2022-05-20 13:20:38] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:38] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/674 places, 388/774 transitions.
Applied a total of 0 rules in 5 ms. Remains 289 /289 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 289/674 places, 388/774 transitions.
Stuttering acceptance computed with spot in 112 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s212 0) (EQ s114 1)), p1:(OR (EQ s218 0) (EQ s261 1) (EQ s112 0) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 301 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-020B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLCardinality-13 finished in 794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(!p0 U (X(p0)&&G(p0)))))'
Support contains 2 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 774/774 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 673 transition count 692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 592 transition count 692
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 592 transition count 592
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 492 transition count 592
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 374 place count 480 transition count 580
Iterating global reduction 2 with 12 rules applied. Total rules applied 386 place count 480 transition count 580
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 386 place count 480 transition count 572
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 402 place count 472 transition count 572
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 187
Deduced a syphon composed of 187 places in 1 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 2 with 374 rules applied. Total rules applied 776 place count 285 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 778 place count 283 transition count 383
Applied a total of 778 rules in 46 ms. Remains 283 /674 variables (removed 391) and now considering 383/774 (removed 391) transitions.
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:20:39] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:39] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 383 rows 283 cols
[2022-05-20 13:20:39] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-20 13:20:39] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2022-05-20 13:20:39] [INFO ] Redundant transitions in 70 ms returned [382]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 382 rows 283 cols
[2022-05-20 13:20:39] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 13:20:39] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/674 places, 382/774 transitions.
Applied a total of 0 rules in 5 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 283/674 places, 382/774 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : ShieldRVs-PT-020B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s161 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 269 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-020B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLCardinality-14 finished in 731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(F(G(p0)))))))'
[2022-05-20 13:20:39] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12224763256903174858
[2022-05-20 13:20:39] [INFO ] Computing symmetric may disable matrix : 774 transitions.
[2022-05-20 13:20:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:39] [INFO ] Applying decomposition
[2022-05-20 13:20:39] [INFO ] Computing symmetric may enable matrix : 774 transitions.
[2022-05-20 13:20:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:40] [INFO ] Flatten gal took : 23 ms
[2022-05-20 13:20:40] [INFO ] Computing Do-Not-Accords matrix : 774 transitions.
[2022-05-20 13:20:40] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:20:40] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12224763256903174858
Running compilation step : cd /tmp/ltsmin12224763256903174858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8777568457923956652.txt' '-o' '/tmp/graph8777568457923956652.bin' '-w' '/tmp/graph8777568457923956652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8777568457923956652.bin' '-l' '-1' '-v' '-w' '/tmp/graph8777568457923956652.weights' '-q' '0' '-e' '0.001'
[2022-05-20 13:20:40] [INFO ] Decomposing Gal with order
[2022-05-20 13:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:20:40] [INFO ] Removed a total of 711 redundant transitions.
[2022-05-20 13:20:40] [INFO ] Flatten gal took : 50 ms
[2022-05-20 13:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 13:20:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality6811858608130119383.gal : 8 ms
[2022-05-20 13:20:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality3582536075961864237.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6811858608130119383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3582536075961864237.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !((G(X(F(X(F(G("(((i11.u221.p714==0)||(i8.i1.i1.u175.p561==1))||((i6.u132.p422==0)||(i10.i0.i0.u189.p610==1)))"))))))))
Formula 0 simplified : !GXFXFG"(((i11.u221.p714==0)||(i8.i1.i1.u175.p561==1))||((i6.u132.p422==0)||(i10.i0.i0.u189.p610==1)))"
Compilation finished in 1947 ms.
Running link step : cd /tmp/ltsmin12224763256903174858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12224763256903174858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>(X(<>([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 13:42:06] [INFO ] Applying decomposition
[2022-05-20 13:42:06] [INFO ] Flatten gal took : 55 ms
[2022-05-20 13:42:06] [INFO ] Decomposing Gal with order
[2022-05-20 13:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 13:42:06] [INFO ] Removed a total of 417 redundant transitions.
[2022-05-20 13:42:06] [INFO ] Flatten gal took : 106 ms
[2022-05-20 13:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 40 ms.
[2022-05-20 13:42:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality13383056621609136211.gal : 6 ms
[2022-05-20 13:42:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality17500821455226297128.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13383056621609136211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17500821455226297128.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((G(X(F(X(F(G("(((i0.i0.i1.u146.p714==0)||(i0.i0.i0.i0.i0.i0.i1.u118.p561==1))||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u94.p422==0)||(...197
Formula 0 simplified : !GXFXFG"(((i0.i0.i1.u146.p714==0)||(i0.i0.i0.i0.i0.i0.i1.u118.p561==1))||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u94.p422==0)||(i0.i0....183
Detected timeout of ITS tools.
[2022-05-20 14:03:32] [INFO ] Flatten gal took : 55 ms
[2022-05-20 14:03:32] [INFO ] Input system was already deterministic with 774 transitions.
[2022-05-20 14:03:32] [INFO ] Transformed 674 places.
[2022-05-20 14:03:32] [INFO ] Transformed 774 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 14:03:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality12530047470078389443.gal : 3 ms
[2022-05-20 14:03:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality7028554431921058341.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12530047470078389443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7028554431921058341.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(F(X(F(G("(((p714==0)||(p561==1))||((p422==0)||(p610==1)))"))))))))
Formula 0 simplified : !GXFXFG"(((p714==0)||(p561==1))||((p422==0)||(p610==1)))"

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldRVs-PT-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-020B, 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 r222-tall-165286025800811"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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