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-165286025100347.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 ShieldIIPt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025100347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.5K Apr 29 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 1.7M 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 ShieldIIPt-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652969558741

Running Version 202205111006
[2022-05-19 14:12:39] [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-19 14:12:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 14:12:40] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2022-05-19 14:12:40] [INFO ] Transformed 7003 places.
[2022-05-19 14:12:40] [INFO ] Transformed 6503 transitions.
[2022-05-19 14:12:40] [INFO ] Found NUPN structural information;
[2022-05-19 14:12:40] [INFO ] Parsed PT model containing 7003 places and 6503 transitions in 660 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 7003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Discarding 1094 places :
Symmetric choice reduction at 0 with 1094 rule applications. Total rules 1094 place count 5909 transition count 5409
Iterating global reduction 0 with 1094 rules applied. Total rules applied 2188 place count 5909 transition count 5409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2189 place count 5908 transition count 5408
Iterating global reduction 0 with 1 rules applied. Total rules applied 2190 place count 5908 transition count 5408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2191 place count 5907 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 2192 place count 5907 transition count 5407
Applied a total of 2192 rules in 4107 ms. Remains 5907 /7003 variables (removed 1096) and now considering 5407/6503 (removed 1096) transitions.
// Phase 1: matrix 5407 rows 5907 cols
[2022-05-19 14:12:45] [INFO ] Computed 901 place invariants in 58 ms
[2022-05-19 14:12:46] [INFO ] Implicit Places using invariants in 1922 ms returned []
// Phase 1: matrix 5407 rows 5907 cols
[2022-05-19 14:12:47] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 14:12:48] [INFO ] Implicit Places using invariants and state equation in 1800 ms returned []
Implicit Place search using SMT with State Equation took 3763 ms to find 0 implicit places.
// Phase 1: matrix 5407 rows 5907 cols
[2022-05-19 14:12:48] [INFO ] Computed 901 place invariants in 28 ms
[2022-05-19 14:12:52] [INFO ] Dead Transitions using invariants and state equation in 3914 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5907/7003 places, 5407/6503 transitions.
Finished structural reductions, in 1 iterations. Remains : 5907/7003 places, 5407/6503 transitions.
Support contains 30 out of 5907 places after structural reductions.
[2022-05-19 14:12:53] [INFO ] Flatten gal took : 305 ms
[2022-05-19 14:12:53] [INFO ] Flatten gal took : 181 ms
[2022-05-19 14:12:53] [INFO ] Input system was already deterministic with 5407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 5407 rows 5907 cols
[2022-05-19 14:12:54] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 14:12:55] [INFO ] After 1154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 14:12:57] [INFO ] [Nat]Absence check using 901 positive place invariants in 576 ms returned sat
[2022-05-19 14:13:03] [INFO ] After 5635ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-05-19 14:13:06] [INFO ] Deduced a trap composed of 37 places in 2134 ms of which 14 ms to minimize.
[2022-05-19 14:13:08] [INFO ] Deduced a trap composed of 20 places in 1999 ms of which 10 ms to minimize.
[2022-05-19 14:13:10] [INFO ] Deduced a trap composed of 16 places in 2106 ms of which 9 ms to minimize.
[2022-05-19 14:13:12] [INFO ] Deduced a trap composed of 27 places in 2014 ms of which 17 ms to minimize.
[2022-05-19 14:13:15] [INFO ] Deduced a trap composed of 22 places in 2164 ms of which 4 ms to minimize.
[2022-05-19 14:13:17] [INFO ] Deduced a trap composed of 24 places in 2059 ms of which 3 ms to minimize.
[2022-05-19 14:13:19] [INFO ] Deduced a trap composed of 21 places in 1954 ms of which 13 ms to minimize.
[2022-05-19 14:13:22] [INFO ] Deduced a trap composed of 27 places in 2080 ms of which 3 ms to minimize.
[2022-05-19 14:13:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:13:22] [INFO ] After 26034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1760 ms.
Support contains 16 out of 5907 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5907/5907 places, 5407/5407 transitions.
Drop transitions removed 1187 transitions
Trivial Post-agglo rules discarded 1187 transitions
Performed 1187 trivial Post agglomeration. Transition count delta: 1187
Iterating post reduction 0 with 1187 rules applied. Total rules applied 1187 place count 5907 transition count 4220
Reduce places removed 1187 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1192 rules applied. Total rules applied 2379 place count 4720 transition count 4215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2384 place count 4715 transition count 4215
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2384 place count 4715 transition count 3420
Deduced a syphon composed of 795 places in 11 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 3974 place count 3920 transition count 3420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3975 place count 3919 transition count 3419
Iterating global reduction 3 with 1 rules applied. Total rules applied 3976 place count 3919 transition count 3419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3976 place count 3919 transition count 3418
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3978 place count 3918 transition count 3418
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7376 place count 2219 transition count 1719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7377 place count 2219 transition count 1718
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7379 place count 2218 transition count 1717
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 33 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7581 place count 2117 transition count 1782
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7783 place count 2016 transition count 1848
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 7963 place count 1926 transition count 1908
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7964 place count 1926 transition count 1907
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 7966 place count 1926 transition count 1905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 7968 place count 1924 transition count 1905
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 6 with 99 rules applied. Total rules applied 8067 place count 1924 transition count 1905
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8068 place count 1923 transition count 1904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8070 place count 1921 transition count 1904
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8070 place count 1921 transition count 1903
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8072 place count 1920 transition count 1903
Applied a total of 8072 rules in 2037 ms. Remains 1920 /5907 variables (removed 3987) and now considering 1903/5407 (removed 3504) transitions.
Finished structural reductions, in 1 iterations. Remains : 1920/5907 places, 1903/5407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 58151 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58151 steps, saw 36476 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1903 rows 1920 cols
[2022-05-19 14:13:30] [INFO ] Computed 899 place invariants in 17 ms
[2022-05-19 14:13:30] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 14:13:31] [INFO ] [Nat]Absence check using 899 positive place invariants in 158 ms returned sat
[2022-05-19 14:13:32] [INFO ] After 1475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 14:13:32] [INFO ] State equation strengthened by 635 read => feed constraints.
[2022-05-19 14:13:44] [INFO ] After 11385ms SMT Verify possible using 635 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-19 14:13:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-19 14:13:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2022-05-19 14:13:45] [INFO ] After 13016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 489 ms.
[2022-05-19 14:13:46] [INFO ] After 15688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1052 ms.
Support contains 16 out of 1920 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1920/1920 places, 1903/1903 transitions.
Applied a total of 0 rules in 57 ms. Remains 1920 /1920 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1920/1920 places, 1903/1903 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1920/1920 places, 1903/1903 transitions.
Applied a total of 0 rules in 56 ms. Remains 1920 /1920 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1920 cols
[2022-05-19 14:13:47] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 14:13:48] [INFO ] Implicit Places using invariants in 1161 ms returned [1909]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1166 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1919/1920 places, 1903/1903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1918 transition count 1902
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1918 transition count 1902
Applied a total of 2 rules in 101 ms. Remains 1918 /1919 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1918 cols
[2022-05-19 14:13:48] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:13:49] [INFO ] Implicit Places using invariants in 1241 ms returned []
// Phase 1: matrix 1902 rows 1918 cols
[2022-05-19 14:13:49] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:13:51] [INFO ] State equation strengthened by 634 read => feed constraints.
[2022-05-19 14:14:02] [INFO ] Implicit Places using invariants and state equation in 12414 ms returned []
Implicit Place search using SMT with State Equation took 13661 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1918/1920 places, 1902/1903 transitions.
Finished structural reductions, in 2 iterations. Remains : 1918/1920 places, 1902/1903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1902 rows 1918 cols
[2022-05-19 14:14:03] [INFO ] Computed 898 place invariants in 9 ms
[2022-05-19 14:14:03] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 14:14:04] [INFO ] [Nat]Absence check using 898 positive place invariants in 154 ms returned sat
[2022-05-19 14:14:05] [INFO ] After 1402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 14:14:05] [INFO ] State equation strengthened by 634 read => feed constraints.
[2022-05-19 14:14:17] [INFO ] After 11302ms SMT Verify possible using 634 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-19 14:14:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-05-19 14:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2022-05-19 14:14:17] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2022-05-19 14:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2022-05-19 14:14:18] [INFO ] After 12604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 382 ms.
[2022-05-19 14:14:18] [INFO ] After 15073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1057 ms.
Support contains 14 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1918/1918 places, 1902/1902 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1917 transition count 1901
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1917 transition count 1901
Applied a total of 3 rules in 148 ms. Remains 1917 /1918 variables (removed 1) and now considering 1901/1902 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1917/1918 places, 1901/1902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 58167 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58167 steps, saw 36876 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1901 rows 1917 cols
[2022-05-19 14:14:24] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:14:24] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 14:14:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 159 ms returned sat
[2022-05-19 14:14:26] [INFO ] After 1580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 14:14:26] [INFO ] State equation strengthened by 634 read => feed constraints.
[2022-05-19 14:14:37] [INFO ] After 11058ms SMT Verify possible using 634 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-19 14:14:38] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-19 14:14:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2022-05-19 14:14:38] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2022-05-19 14:14:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2022-05-19 14:14:38] [INFO ] After 12094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 359 ms.
[2022-05-19 14:14:39] [INFO ] After 14714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 827 ms.
Support contains 14 out of 1917 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1917/1917 places, 1901/1901 transitions.
Applied a total of 0 rules in 51 ms. Remains 1917 /1917 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1917/1917 places, 1901/1901 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1917/1917 places, 1901/1901 transitions.
Applied a total of 0 rules in 49 ms. Remains 1917 /1917 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
// Phase 1: matrix 1901 rows 1917 cols
[2022-05-19 14:14:40] [INFO ] Computed 898 place invariants in 11 ms
[2022-05-19 14:14:41] [INFO ] Implicit Places using invariants in 1144 ms returned []
// Phase 1: matrix 1901 rows 1917 cols
[2022-05-19 14:14:41] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:14:42] [INFO ] State equation strengthened by 634 read => feed constraints.
[2022-05-19 14:14:55] [INFO ] Implicit Places using invariants and state equation in 14350 ms returned []
Implicit Place search using SMT with State Equation took 15495 ms to find 0 implicit places.
[2022-05-19 14:14:55] [INFO ] Redundant transitions in 168 ms returned []
// Phase 1: matrix 1901 rows 1917 cols
[2022-05-19 14:14:55] [INFO ] Computed 898 place invariants in 9 ms
[2022-05-19 14:14:56] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1917/1917 places, 1901/1901 transitions.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 1600 stabilizing places and 1600 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(p0)))))'
Support contains 4 out of 5907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5907/5907 places, 5407/5407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5906 transition count 4206
Reduce places removed 1200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1201 rules applied. Total rules applied 2401 place count 4706 transition count 4205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2402 place count 4705 transition count 4205
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2402 place count 4705 transition count 3408
Deduced a syphon composed of 797 places in 11 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 3996 place count 3908 transition count 3408
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 3999 place count 3905 transition count 3405
Iterating global reduction 3 with 3 rules applied. Total rules applied 4002 place count 3905 transition count 3405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4002 place count 3905 transition count 3403
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4006 place count 3903 transition count 3403
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 3 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 3 with 3392 rules applied. Total rules applied 7398 place count 2207 transition count 1707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7399 place count 2207 transition count 1706
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7401 place count 2206 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7603 place count 2105 transition count 1771
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7805 place count 2004 transition count 1837
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 7997 place count 1908 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7999 place count 1906 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8001 place count 1904 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8001 place count 1904 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8003 place count 1903 transition count 1899
Applied a total of 8003 rules in 1699 ms. Remains 1903 /5907 variables (removed 4004) and now considering 1899/5407 (removed 3508) transitions.
// Phase 1: matrix 1899 rows 1903 cols
[2022-05-19 14:14:58] [INFO ] Computed 899 place invariants in 9 ms
[2022-05-19 14:15:00] [INFO ] Implicit Places using invariants in 1187 ms returned [1892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1190 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1902/5907 places, 1899/5407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1898
Applied a total of 2 rules in 98 ms. Remains 1901 /1902 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
// Phase 1: matrix 1898 rows 1901 cols
[2022-05-19 14:15:00] [INFO ] Computed 898 place invariants in 18 ms
[2022-05-19 14:15:01] [INFO ] Implicit Places using invariants in 1178 ms returned []
// Phase 1: matrix 1898 rows 1901 cols
[2022-05-19 14:15:01] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:15:03] [INFO ] Implicit Places using invariants and state equation in 2398 ms returned []
Implicit Place search using SMT with State Equation took 3578 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1901/5907 places, 1898/5407 transitions.
Finished structural reductions, in 2 iterations. Remains : 1901/5907 places, 1898/5407 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-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 (AND (EQ s1185 0) (EQ s553 1)) (AND (EQ s794 0) (EQ s96 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 0 steps with 0 reset in 5 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-01 finished in 6802 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 3 out of 5907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5907/5907 places, 5407/5407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5902 transition count 5402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5902 transition count 5402
Applied a total of 10 rules in 1595 ms. Remains 5902 /5907 variables (removed 5) and now considering 5402/5407 (removed 5) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:15:05] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:15:07] [INFO ] Implicit Places using invariants in 1857 ms returned []
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:15:07] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:15:09] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 3553 ms to find 0 implicit places.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:15:09] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 14:15:12] [INFO ] Dead Transitions using invariants and state equation in 3586 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5907 places, 5402/5407 transitions.
Finished structural reductions, in 1 iterations. Remains : 5902/5907 places, 5402/5407 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s3424 0) (EQ s3685 1)), p0:(EQ s1644 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-02 finished in 9046 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 5907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5907/5907 places, 5407/5407 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5903 transition count 5403
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5903 transition count 5403
Applied a total of 8 rules in 1547 ms. Remains 5903 /5907 variables (removed 4) and now considering 5403/5407 (removed 4) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:15:14] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 14:15:16] [INFO ] Implicit Places using invariants in 1832 ms returned []
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:15:16] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 14:15:18] [INFO ] Implicit Places using invariants and state equation in 1766 ms returned []
Implicit Place search using SMT with State Equation took 3601 ms to find 0 implicit places.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:15:18] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:15:21] [INFO ] Dead Transitions using invariants and state equation in 3752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5907 places, 5403/5407 transitions.
Finished structural reductions, in 1 iterations. Remains : 5903/5907 places, 5403/5407 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2872 0) (EQ s2163 1) (EQ s4281 0) (EQ s2986 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 33333 reset in 3178 ms.
Product exploration explored 100000 steps with 33333 reset in 3084 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-05 finished in 15573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(X(p0)&&F(p1))) U p2)))'
Support contains 5 out of 5907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5907/5907 places, 5407/5407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5906 transition count 4208
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2397 place count 4708 transition count 4207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2398 place count 4707 transition count 4207
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2398 place count 4707 transition count 3408
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 3996 place count 3908 transition count 3408
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 3999 place count 3905 transition count 3405
Iterating global reduction 3 with 3 rules applied. Total rules applied 4002 place count 3905 transition count 3405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4002 place count 3905 transition count 3403
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4006 place count 3903 transition count 3403
Performed 1692 Post agglomeration using F-continuation condition.Transition count delta: 1692
Deduced a syphon composed of 1692 places in 4 ms
Reduce places removed 1692 places and 0 transitions.
Iterating global reduction 3 with 3384 rules applied. Total rules applied 7390 place count 2211 transition count 1711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7391 place count 2211 transition count 1710
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7393 place count 2210 transition count 1709
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7595 place count 2109 transition count 1775
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7797 place count 2008 transition count 1843
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 7991 place count 1911 transition count 1908
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7993 place count 1909 transition count 1906
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 7995 place count 1907 transition count 1906
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 7995 place count 1907 transition count 1905
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 7997 place count 1906 transition count 1905
Applied a total of 7997 rules in 1555 ms. Remains 1906 /5907 variables (removed 4001) and now considering 1905/5407 (removed 3502) transitions.
// Phase 1: matrix 1905 rows 1906 cols
[2022-05-19 14:15:30] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 14:15:31] [INFO ] Implicit Places using invariants in 1190 ms returned [1895]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1193 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1905/5907 places, 1905/5407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1904 transition count 1904
Applied a total of 2 rules in 94 ms. Remains 1904 /1905 variables (removed 1) and now considering 1904/1905 (removed 1) transitions.
// Phase 1: matrix 1904 rows 1904 cols
[2022-05-19 14:15:31] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:15:32] [INFO ] Implicit Places using invariants in 1136 ms returned []
// Phase 1: matrix 1904 rows 1904 cols
[2022-05-19 14:15:32] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:15:33] [INFO ] State equation strengthened by 597 read => feed constraints.
[2022-05-19 14:15:50] [INFO ] Implicit Places using invariants and state equation in 18125 ms returned []
Implicit Place search using SMT with State Equation took 19269 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1904/5907 places, 1904/5407 transitions.
Finished structural reductions, in 2 iterations. Remains : 1904/5907 places, 1904/5407 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (NOT p2), (AND p1 p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s1243 1), p1:(OR (EQ s99 0) (EQ s882 1)), p0:(OR (EQ s1581 0) (EQ s1071 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-08 finished in 22277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(F(X(X(F(G(p0))))))))))'
Support contains 2 out of 5907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5907/5907 places, 5407/5407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1202 transitions
Trivial Post-agglo rules discarded 1202 transitions
Performed 1202 trivial Post agglomeration. Transition count delta: 1202
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1202 place count 5906 transition count 4204
Reduce places removed 1202 places and 0 transitions.
Iterating post reduction 1 with 1202 rules applied. Total rules applied 2404 place count 4704 transition count 4204
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2404 place count 4704 transition count 3408
Deduced a syphon composed of 796 places in 10 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3996 place count 3908 transition count 3408
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4000 place count 3904 transition count 3404
Iterating global reduction 2 with 4 rules applied. Total rules applied 4004 place count 3904 transition count 3404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4004 place count 3904 transition count 3401
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 4010 place count 3901 transition count 3401
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 4 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7402 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7403 place count 2205 transition count 1704
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7405 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7607 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7809 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8003 place count 1905 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8005 place count 1903 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8007 place count 1901 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8007 place count 1901 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8009 place count 1900 transition count 1899
Applied a total of 8009 rules in 1560 ms. Remains 1900 /5907 variables (removed 4007) and now considering 1899/5407 (removed 3508) transitions.
// Phase 1: matrix 1899 rows 1900 cols
[2022-05-19 14:15:52] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:15:53] [INFO ] Implicit Places using invariants in 1200 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1204 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/5907 places, 1899/5407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1898
Applied a total of 2 rules in 103 ms. Remains 1898 /1899 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:15:53] [INFO ] Computed 898 place invariants in 8 ms
[2022-05-19 14:15:54] [INFO ] Implicit Places using invariants in 1146 ms returned []
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:15:54] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:15:57] [INFO ] Implicit Places using invariants and state equation in 2464 ms returned []
Implicit Place search using SMT with State Equation took 3612 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1898/5907 places, 1898/5407 transitions.
Finished structural reductions, in 2 iterations. Remains : 1898/5907 places, 1898/5407 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s610 0) (EQ s745 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 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-13 finished in 6552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(p1)||p0)))&&G(p2)))'
Support contains 6 out of 5907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5907/5907 places, 5407/5407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5902 transition count 5402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5902 transition count 5402
Applied a total of 10 rules in 1546 ms. Remains 5902 /5907 variables (removed 5) and now considering 5402/5407 (removed 5) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:15:59] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 14:16:00] [INFO ] Implicit Places using invariants in 1836 ms returned []
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:16:00] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 14:16:02] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 3688 ms to find 0 implicit places.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:16:02] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 14:16:06] [INFO ] Dead Transitions using invariants and state equation in 3761 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5907 places, 5402/5407 transitions.
Finished structural reductions, in 1 iterations. Remains : 5902/5907 places, 5402/5407 transitions.
Stuttering acceptance computed with spot in 548 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 3}]], initial=5, aps=[p2:(OR (EQ s2120 0) (EQ s2118 1)), p1:(OR (EQ s1564 0) (EQ s985 1)), p0:(OR (EQ s1699 0) (EQ s2440 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1512 ms.
Product exploration explored 100000 steps with 0 reset in 2018 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217855 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217855 steps, saw 209231 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:16:14] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:16:14] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:16:16] [INFO ] [Nat]Absence check using 901 positive place invariants in 543 ms returned sat
[2022-05-19 14:16:20] [INFO ] After 4390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:16:22] [INFO ] Deduced a trap composed of 12 places in 2193 ms of which 4 ms to minimize.
[2022-05-19 14:16:25] [INFO ] Deduced a trap composed of 23 places in 2100 ms of which 3 ms to minimize.
[2022-05-19 14:16:27] [INFO ] Deduced a trap composed of 17 places in 2095 ms of which 3 ms to minimize.
[2022-05-19 14:16:29] [INFO ] Deduced a trap composed of 18 places in 2139 ms of which 3 ms to minimize.
[2022-05-19 14:16:32] [INFO ] Deduced a trap composed of 16 places in 2188 ms of which 3 ms to minimize.
[2022-05-19 14:16:34] [INFO ] Deduced a trap composed of 25 places in 2181 ms of which 4 ms to minimize.
[2022-05-19 14:16:37] [INFO ] Deduced a trap composed of 18 places in 2146 ms of which 4 ms to minimize.
[2022-05-19 14:16:39] [INFO ] Deduced a trap composed of 23 places in 2129 ms of which 3 ms to minimize.
[2022-05-19 14:16:41] [INFO ] Deduced a trap composed of 27 places in 1998 ms of which 3 ms to minimize.
[2022-05-19 14:16:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:16:41] [INFO ] After 26612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 112 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5902 transition count 4204
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4704 transition count 4204
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4704 transition count 3404
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3996 place count 3904 transition count 3404
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 4 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2000 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7999 place count 1904 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8000 place count 1903 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8100 place count 1903 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8103 place count 1900 transition count 1895
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8105 place count 1899 transition count 1895
Applied a total of 8105 rules in 1313 ms. Remains 1899 /5902 variables (removed 4003) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions, in 1 iterations. Remains : 1899/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96937 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96937 steps, saw 61620 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1899 cols
[2022-05-19 14:16:46] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:16:46] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:16:46] [INFO ] [Nat]Absence check using 899 positive place invariants in 153 ms returned sat
[2022-05-19 14:16:47] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:16:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:16:47] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:16:47] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-19 14:16:47] [INFO ] After 1445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 1899 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 47 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1899/1899 places, 1895/1895 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 45 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
// Phase 1: matrix 1895 rows 1899 cols
[2022-05-19 14:16:48] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:16:49] [INFO ] Implicit Places using invariants in 1159 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1161 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1898/1899 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1897 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1897 transition count 1894
Applied a total of 2 rules in 88 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:16:49] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:16:50] [INFO ] Implicit Places using invariants in 1177 ms returned []
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:16:50] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:16:53] [INFO ] Implicit Places using invariants and state equation in 2592 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1897/1899 places, 1894/1895 transitions.
Finished structural reductions, in 2 iterations. Remains : 1897/1899 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95011 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95011 steps, saw 59999 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:16:56] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:16:56] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:16:56] [INFO ] [Nat]Absence check using 898 positive place invariants in 144 ms returned sat
[2022-05-19 14:16:57] [INFO ] After 777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:16:57] [INFO ] After 896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-05-19 14:16:57] [INFO ] After 1348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 51 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:16:58] [INFO ] Computed 898 place invariants in 8 ms
[2022-05-19 14:16:59] [INFO ] Implicit Places using invariants in 1293 ms returned []
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:16:59] [INFO ] Computed 898 place invariants in 8 ms
[2022-05-19 14:17:02] [INFO ] Implicit Places using invariants and state equation in 2717 ms returned []
Implicit Place search using SMT with State Equation took 4013 ms to find 0 implicit places.
[2022-05-19 14:17:02] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:17:02] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:17:03] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 94 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:17:03] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:17:03] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:17:03] [INFO ] [Nat]Absence check using 898 positive place invariants in 149 ms returned sat
[2022-05-19 14:17:04] [INFO ] After 818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:17:04] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-05-19 14:17:04] [INFO ] After 206ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:17:04] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-19 14:17:05] [INFO ] After 1584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:17:05] [INFO ] Flatten gal took : 75 ms
[2022-05-19 14:17:05] [INFO ] Flatten gal took : 74 ms
[2022-05-19 14:17:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2574955411833356173.gal : 34 ms
[2022-05-19 14:17:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11768353555496858766.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms18152817856948491205;'/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/ReachabilityCardinality2574955411833356173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11768353555496858766.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/ReachabilityCardinality11768353555496858766.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 263
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,631,1.59327,25200,2,4384,12,17778,6,0,9386,6632,0
Total reachable state count : 631

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,1.59888,25200,2,1898,12,17778,7,0,9392,6632,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p2 p1 p0), (X p2), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p2), (NOT p2)]
Support contains 2 out of 5902 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 777 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:17:08] [INFO ] Computed 901 place invariants in 19 ms
[2022-05-19 14:17:09] [INFO ] Implicit Places using invariants in 1923 ms returned []
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:17:09] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:17:11] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 3787 ms to find 0 implicit places.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:17:11] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 14:17:15] [INFO ] Dead Transitions using invariants and state equation in 3542 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5902/5902 places, 5402/5402 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217263 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217263 steps, saw 208855 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:17:18] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:17:19] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:17:20] [INFO ] [Nat]Absence check using 901 positive place invariants in 577 ms returned sat
[2022-05-19 14:17:25] [INFO ] After 4800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:17:27] [INFO ] Deduced a trap composed of 12 places in 2022 ms of which 3 ms to minimize.
[2022-05-19 14:17:30] [INFO ] Deduced a trap composed of 23 places in 1995 ms of which 3 ms to minimize.
[2022-05-19 14:17:32] [INFO ] Deduced a trap composed of 17 places in 2076 ms of which 5 ms to minimize.
[2022-05-19 14:17:34] [INFO ] Deduced a trap composed of 18 places in 2038 ms of which 3 ms to minimize.
[2022-05-19 14:17:36] [INFO ] Deduced a trap composed of 16 places in 2075 ms of which 3 ms to minimize.
[2022-05-19 14:17:39] [INFO ] Deduced a trap composed of 25 places in 2059 ms of which 3 ms to minimize.
[2022-05-19 14:17:41] [INFO ] Deduced a trap composed of 18 places in 2041 ms of which 4 ms to minimize.
[2022-05-19 14:17:43] [INFO ] Deduced a trap composed of 23 places in 2073 ms of which 4 ms to minimize.
[2022-05-19 14:17:45] [INFO ] Deduced a trap composed of 27 places in 2113 ms of which 3 ms to minimize.
[2022-05-19 14:17:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:17:45] [INFO ] After 26301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 115 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5902 transition count 4204
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4704 transition count 4204
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4704 transition count 3404
Deduced a syphon composed of 800 places in 11 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3996 place count 3904 transition count 3404
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 3 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2000 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7999 place count 1904 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8000 place count 1903 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8100 place count 1903 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8103 place count 1900 transition count 1895
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8105 place count 1899 transition count 1895
Applied a total of 8105 rules in 1377 ms. Remains 1899 /5902 variables (removed 4003) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions, in 1 iterations. Remains : 1899/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95828 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95828 steps, saw 60914 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1899 cols
[2022-05-19 14:17:50] [INFO ] Computed 899 place invariants in 5 ms
[2022-05-19 14:17:50] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:17:51] [INFO ] [Nat]Absence check using 899 positive place invariants in 145 ms returned sat
[2022-05-19 14:17:51] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:17:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:17:52] [INFO ] After 60ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:17:52] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-19 14:17:52] [INFO ] After 1408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 1899 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 46 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1899/1899 places, 1895/1895 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 47 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
// Phase 1: matrix 1895 rows 1899 cols
[2022-05-19 14:17:52] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:17:53] [INFO ] Implicit Places using invariants in 1153 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1155 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1898/1899 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1897 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1897 transition count 1894
Applied a total of 2 rules in 86 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:17:53] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:17:54] [INFO ] Implicit Places using invariants in 1220 ms returned []
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:17:54] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:17:57] [INFO ] Implicit Places using invariants and state equation in 2465 ms returned []
Implicit Place search using SMT with State Equation took 3687 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1897/1899 places, 1894/1895 transitions.
Finished structural reductions, in 2 iterations. Remains : 1897/1899 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95912 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95912 steps, saw 60605 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:18:00] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:18:00] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:18:01] [INFO ] [Nat]Absence check using 898 positive place invariants in 149 ms returned sat
[2022-05-19 14:18:01] [INFO ] After 813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:18:02] [INFO ] After 922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-05-19 14:18:02] [INFO ] After 1372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 52 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:18:02] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:18:03] [INFO ] Implicit Places using invariants in 1163 ms returned []
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:18:03] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:18:05] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned []
Implicit Place search using SMT with State Equation took 3583 ms to find 0 implicit places.
[2022-05-19 14:18:05] [INFO ] Redundant transitions in 112 ms returned []
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:18:05] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:18:06] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 94 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2022-05-19 14:18:07] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:18:07] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:18:07] [INFO ] [Nat]Absence check using 898 positive place invariants in 143 ms returned sat
[2022-05-19 14:18:08] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:18:08] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-05-19 14:18:08] [INFO ] After 208ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:18:08] [INFO ] After 328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-05-19 14:18:08] [INFO ] After 1559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:18:08] [INFO ] Flatten gal took : 69 ms
[2022-05-19 14:18:09] [INFO ] Flatten gal took : 70 ms
[2022-05-19 14:18:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2939146676508015877.gal : 12 ms
[2022-05-19 14:18:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18302549879874941029.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9116489212582995958;'/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/ReachabilityCardinality2939146676508015877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18302549879874941029.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/ReachabilityCardinality18302549879874941029.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 263
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,631,1.60329,25400,2,4384,12,17778,6,0,9386,6632,0
Total reachable state count : 631

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,1.60852,25400,2,1898,12,17778,7,0,9392,6632,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 1478 ms.
Product exploration explored 100000 steps with 0 reset in 1850 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p2), (NOT p2)]
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5902 transition count 5402
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 1198 place count 5902 transition count 5704
Deduced a syphon composed of 1599 places in 17 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 1599 place count 5902 transition count 5704
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3599 places in 11 ms
Iterating global reduction 1 with 2000 rules applied. Total rules applied 3599 place count 5902 transition count 5704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3600 place count 5902 transition count 5703
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 4400 place count 5102 transition count 4903
Deduced a syphon composed of 2799 places in 9 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 5200 place count 5102 transition count 4903
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2800 places in 9 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5201 place count 5102 transition count 4903
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5203 place count 5100 transition count 4901
Deduced a syphon composed of 2798 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5205 place count 5100 transition count 4901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2899 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5306 place count 5100 transition count 5431
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5407 place count 4999 transition count 5229
Deduced a syphon composed of 2798 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5508 place count 4999 transition count 5229
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -531
Deduced a syphon composed of 2899 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5609 place count 4999 transition count 5760
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5710 place count 4898 transition count 5558
Deduced a syphon composed of 2798 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5811 place count 4898 transition count 5558
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -534
Deduced a syphon composed of 2899 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5912 place count 4898 transition count 6092
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6013 place count 4797 transition count 5890
Deduced a syphon composed of 2798 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6114 place count 4797 transition count 5890
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -503
Deduced a syphon composed of 2893 places in 13 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6209 place count 4797 transition count 6393
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 6304 place count 4702 transition count 6203
Deduced a syphon composed of 2798 places in 12 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6399 place count 4702 transition count 6203
Deduced a syphon composed of 2798 places in 11 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6408 place count 4702 transition count 6194
Deduced a syphon composed of 2798 places in 12 ms
Applied a total of 6408 rules in 8049 ms. Remains 4702 /5902 variables (removed 1200) and now considering 6194/5402 (removed -792) transitions.
[2022-05-19 14:18:22] [INFO ] Redundant transitions in 275 ms returned []
// Phase 1: matrix 6194 rows 4702 cols
[2022-05-19 14:18:23] [INFO ] Computed 901 place invariants in 137 ms
[2022-05-19 14:18:26] [INFO ] Dead Transitions using invariants and state equation in 3645 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4702/5902 places, 6194/5402 transitions.
Finished structural reductions, in 1 iterations. Remains : 4702/5902 places, 6194/5402 transitions.
Product exploration explored 100000 steps with 0 reset in 1663 ms.
Product exploration explored 100000 steps with 0 reset in 2037 ms.
Built C files in :
/tmp/ltsmin17595690360073039734
[2022-05-19 14:18:30] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17595690360073039734
Running compilation step : cd /tmp/ltsmin17595690360073039734;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17595690360073039734;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17595690360073039734;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 772 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:18:34] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:18:36] [INFO ] Implicit Places using invariants in 1845 ms returned []
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:18:36] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 14:18:37] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 3663 ms to find 0 implicit places.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:18:37] [INFO ] Computed 901 place invariants in 19 ms
[2022-05-19 14:18:41] [INFO ] Dead Transitions using invariants and state equation in 3526 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5902/5902 places, 5402/5402 transitions.
Built C files in :
/tmp/ltsmin15355409392009233732
[2022-05-19 14:18:41] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15355409392009233732
Running compilation step : cd /tmp/ltsmin15355409392009233732;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15355409392009233732;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15355409392009233732;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 14:18:45] [INFO ] Flatten gal took : 146 ms
[2022-05-19 14:18:45] [INFO ] Flatten gal took : 155 ms
[2022-05-19 14:18:45] [INFO ] Time to serialize gal into /tmp/LTL2954985132512018624.gal : 23 ms
[2022-05-19 14:18:45] [INFO ] Time to serialize properties into /tmp/LTL4447580283373675833.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/LTL2954985132512018624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4447580283373675833.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/LTL2954985...266
Read 1 LTL properties
Checking formula 0 : !(((X(X(((X("((p1839==0)||(p1150==1))"))||("(p1997==0)"))||("(p2879==1)"))))&&(G("((p2499==0)||(p2497==1))"))))
Formula 0 simplified : !(XX("(p1997==0)" | "(p2879==1)" | X"((p1839==0)||(p1150==1))") & G"((p2499==0)||(p2497==1))")
Detected timeout of ITS tools.
[2022-05-19 14:19:00] [INFO ] Flatten gal took : 137 ms
[2022-05-19 14:19:00] [INFO ] Applying decomposition
[2022-05-19 14:19:00] [INFO ] Flatten gal took : 144 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/graph14720023969881174751.txt' '-o' '/tmp/graph14720023969881174751.bin' '-w' '/tmp/graph14720023969881174751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14720023969881174751.bin' '-l' '-1' '-v' '-w' '/tmp/graph14720023969881174751.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:19:01] [INFO ] Decomposing Gal with order
[2022-05-19 14:19:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:19:02] [INFO ] Removed a total of 999 redundant transitions.
[2022-05-19 14:19:03] [INFO ] Flatten gal took : 393 ms
[2022-05-19 14:19:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2022-05-19 14:19:03] [INFO ] Time to serialize gal into /tmp/LTL6687630674785712043.gal : 60 ms
[2022-05-19 14:19:03] [INFO ] Time to serialize properties into /tmp/LTL17651111279727828253.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/LTL6687630674785712043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17651111279727828253.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/LTL6687630...246
Read 1 LTL properties
Checking formula 0 : !(((X(X(((X("((i18.i0.i2.u582.p1839==0)||(i11.i1.i1.u366.p1150==1))"))||("(i19.i0.i4.u631.p1997==0)"))||("(i27.i1.i1.u909.p2879==1)"))...222
Formula 0 simplified : !(XX("(i19.i0.i4.u631.p1997==0)" | "(i27.i1.i1.u909.p2879==1)" | X"((i18.i0.i2.u582.p1839==0)||(i11.i1.i1.u366.p1150==1))") & G"((i2...207
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7551947804338281286
[2022-05-19 14:19:18] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7551947804338281286
Running compilation step : cd /tmp/ltsmin7551947804338281286;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7551947804338281286;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7551947804338281286;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-14 finished in 203913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 4 out of 5907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5907/5907 places, 5407/5407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5901 transition count 5401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5901 transition count 5401
Applied a total of 12 rules in 1574 ms. Remains 5901 /5907 variables (removed 6) and now considering 5401/5407 (removed 6) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:19:22] [INFO ] Computed 901 place invariants in 19 ms
[2022-05-19 14:19:24] [INFO ] Implicit Places using invariants in 1794 ms returned []
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:19:24] [INFO ] Computed 901 place invariants in 14 ms
[2022-05-19 14:19:26] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 3644 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:19:26] [INFO ] Computed 901 place invariants in 19 ms
[2022-05-19 14:19:30] [INFO ] Dead Transitions using invariants and state equation in 3587 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5907 places, 5401/5407 transitions.
Finished structural reductions, in 1 iterations. Remains : 5901/5907 places, 5401/5407 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s1408 0) (EQ s4325 1)), p0:(AND (EQ s1510 0) (EQ s5140 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-15 finished in 9019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(p1)||p0)))&&G(p2)))'
[2022-05-19 14:19:30] [INFO ] Flatten gal took : 123 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9492669427977188888
[2022-05-19 14:19:30] [INFO ] Too many transitions (5407) to apply POR reductions. Disabling POR matrices.
[2022-05-19 14:19:30] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9492669427977188888
Running compilation step : cd /tmp/ltsmin9492669427977188888;'/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'
[2022-05-19 14:19:30] [INFO ] Applying decomposition
[2022-05-19 14:19:30] [INFO ] Flatten gal took : 128 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/graph17971364926993765343.txt' '-o' '/tmp/graph17971364926993765343.bin' '-w' '/tmp/graph17971364926993765343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17971364926993765343.bin' '-l' '-1' '-v' '-w' '/tmp/graph17971364926993765343.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:19:31] [INFO ] Decomposing Gal with order
[2022-05-19 14:19:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:19:32] [INFO ] Removed a total of 995 redundant transitions.
[2022-05-19 14:19:32] [INFO ] Flatten gal took : 259 ms
[2022-05-19 14:19:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-19 14:19:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality15733204433192517406.gal : 49 ms
[2022-05-19 14:19:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality2891226701150711917.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/LTLCardinality15733204433192517406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2891226701150711917.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...268
Read 1 LTL properties
Checking formula 0 : !(((X(X(((X("((i18.i0.i1.u584.p1839==0)||(i10.i1.i2.u370.p1150==1))"))||("(i19.i0.i5.u632.p1997==0)"))||("(i27.i1.i0.u910.p2879==1)"))...222
Formula 0 simplified : !(XX("(i19.i0.i5.u632.p1997==0)" | "(i27.i1.i0.u910.p2879==1)" | X"((i18.i0.i1.u584.p1839==0)||(i10.i1.i2.u370.p1150==1))") & G"((i2...207
Compilation finished in 20086 ms.
Running link step : cd /tmp/ltsmin9492669427977188888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin9492669427977188888;'/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((X((LTLAPp1==true))||(LTLAPp0==true))))&&[]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 14:41:50] [INFO ] Applying decomposition
[2022-05-19 14:41:50] [INFO ] Flatten gal took : 299 ms
[2022-05-19 14:41:50] [INFO ] Decomposing Gal with order
[2022-05-19 14:41:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:41:55] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-19 14:41:56] [INFO ] Flatten gal took : 595 ms
[2022-05-19 14:41:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-19 14:41:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality2066963855487610297.gal : 75 ms
[2022-05-19 14:41:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality12686330178524406031.ltl : 2 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/LTLCardinality2066963855487610297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12686330178524406031.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...268
Read 1 LTL properties
Checking formula 0 : !(((X(X(((X("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1517
Formula 0 simplified : !(XX("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1502
Detected timeout of ITS tools.
[2022-05-19 15:04:15] [INFO ] Flatten gal took : 335 ms
[2022-05-19 15:04:15] [INFO ] Input system was already deterministic with 5407 transitions.
[2022-05-19 15:04:16] [INFO ] Transformed 5907 places.
[2022-05-19 15:04:16] [INFO ] Transformed 5407 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-19 15:04:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality4637042984972397558.gal : 25 ms
[2022-05-19 15:04:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality10921178658063254381.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/LTLCardinality4637042984972397558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10921178658063254381.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 : !(((X(X(((X("((p1839==0)||(p1150==1))"))||("(p1997==0)"))||("(p2879==1)"))))&&(G("((p2499==0)||(p2497==1))"))))
Formula 0 simplified : !(XX("(p1997==0)" | "(p2879==1)" | X"((p1839==0)||(p1150==1))") & G"((p2499==0)||(p2497==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="ShieldIIPt-PT-100B"
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 ShieldIIPt-PT-100B, 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-165286025100347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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