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.r233-tall-165286037500318.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 gold2021
Input is ShieldRVs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037500318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Apr 30 06:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 06:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 06:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 30 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 06:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 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 498K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655080268999

Running Version 0
[2022-06-13 00:31:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-06-13 00:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 00:31:10] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2022-06-13 00:31:11] [INFO ] Transformed 1603 places.
[2022-06-13 00:31:11] [INFO ] Transformed 1803 transitions.
[2022-06-13 00:31:11] [INFO ] Found NUPN structural information;
[2022-06-13 00:31:11] [INFO ] Parsed PT model containing 1603 places and 1803 transitions in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1803 rows 1603 cols
[2022-06-13 00:31:11] [INFO ] Computed 161 place invariants in 36 ms
[2022-06-13 00:31:11] [INFO ] [Real]Absence check using 161 positive place invariants in 77 ms returned sat
[2022-06-13 00:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:12] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2022-06-13 00:31:13] [INFO ] Deduced a trap composed of 29 places in 489 ms of which 6 ms to minimize.
[2022-06-13 00:31:13] [INFO ] Deduced a trap composed of 51 places in 414 ms of which 2 ms to minimize.
[2022-06-13 00:31:14] [INFO ] Deduced a trap composed of 36 places in 373 ms of which 2 ms to minimize.
[2022-06-13 00:31:14] [INFO ] Deduced a trap composed of 19 places in 370 ms of which 2 ms to minimize.
[2022-06-13 00:31:15] [INFO ] Deduced a trap composed of 27 places in 361 ms of which 1 ms to minimize.
[2022-06-13 00:31:15] [INFO ] Deduced a trap composed of 32 places in 403 ms of which 1 ms to minimize.
[2022-06-13 00:31:16] [INFO ] Deduced a trap composed of 45 places in 404 ms of which 1 ms to minimize.
[2022-06-13 00:31:16] [INFO ] Deduced a trap composed of 24 places in 353 ms of which 1 ms to minimize.
[2022-06-13 00:31:16] [INFO ] Deduced a trap composed of 22 places in 347 ms of which 1 ms to minimize.
[2022-06-13 00:31:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 00:31:17] [INFO ] [Real]Absence check using 161 positive place invariants in 71 ms returned sat
[2022-06-13 00:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:18] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2022-06-13 00:31:18] [INFO ] Deduced a trap composed of 38 places in 362 ms of which 1 ms to minimize.
[2022-06-13 00:31:18] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
[2022-06-13 00:31:19] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 1 ms to minimize.
[2022-06-13 00:31:19] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 0 ms to minimize.
[2022-06-13 00:31:20] [INFO ] Deduced a trap composed of 36 places in 319 ms of which 2 ms to minimize.
[2022-06-13 00:31:20] [INFO ] Deduced a trap composed of 46 places in 317 ms of which 1 ms to minimize.
[2022-06-13 00:31:20] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 1 ms to minimize.
[2022-06-13 00:31:21] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 1 ms to minimize.
[2022-06-13 00:31:21] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 1 ms to minimize.
[2022-06-13 00:31:22] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 1 ms to minimize.
[2022-06-13 00:31:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-13 00:31:22] [INFO ] [Real]Absence check using 161 positive place invariants in 81 ms returned sat
[2022-06-13 00:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:23] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2022-06-13 00:31:23] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 1 ms to minimize.
[2022-06-13 00:31:24] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 1 ms to minimize.
[2022-06-13 00:31:24] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 0 ms to minimize.
[2022-06-13 00:31:25] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 0 ms to minimize.
[2022-06-13 00:31:25] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 1 ms to minimize.
[2022-06-13 00:31:25] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 1 ms to minimize.
[2022-06-13 00:31:26] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 1 ms to minimize.
[2022-06-13 00:31:26] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 1 ms to minimize.
[2022-06-13 00:31:26] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 1 ms to minimize.
[2022-06-13 00:31:27] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 0 ms to minimize.
[2022-06-13 00:31:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-13 00:31:27] [INFO ] [Real]Absence check using 161 positive place invariants in 74 ms returned sat
[2022-06-13 00:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:28] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2022-06-13 00:31:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:31:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2022-06-13 00:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:29] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2022-06-13 00:31:29] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 1 ms to minimize.
[2022-06-13 00:31:30] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 1 ms to minimize.
[2022-06-13 00:31:30] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 2 ms to minimize.
[2022-06-13 00:31:31] [INFO ] Deduced a trap composed of 34 places in 394 ms of which 1 ms to minimize.
[2022-06-13 00:31:31] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 7 ms to minimize.
[2022-06-13 00:31:31] [INFO ] Deduced a trap composed of 23 places in 369 ms of which 5 ms to minimize.
[2022-06-13 00:31:32] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 1 ms to minimize.
[2022-06-13 00:31:32] [INFO ] Deduced a trap composed of 24 places in 382 ms of which 1 ms to minimize.
[2022-06-13 00:31:33] [INFO ] Deduced a trap composed of 25 places in 364 ms of which 1 ms to minimize.
[2022-06-13 00:31:34] [INFO ] Deduced a trap composed of 16 places in 730 ms of which 3 ms to minimize.
[2022-06-13 00:31:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-13 00:31:34] [INFO ] [Real]Absence check using 161 positive place invariants in 89 ms returned sat
[2022-06-13 00:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:35] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2022-06-13 00:31:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:31:36] [INFO ] [Nat]Absence check using 161 positive place invariants in 82 ms returned sat
[2022-06-13 00:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:38] [INFO ] [Nat]Absence check using state equation in 2427 ms returned sat
[2022-06-13 00:31:39] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 3 ms to minimize.
[2022-06-13 00:31:39] [INFO ] Deduced a trap composed of 25 places in 417 ms of which 2 ms to minimize.
[2022-06-13 00:31:40] [INFO ] Deduced a trap composed of 22 places in 405 ms of which 1 ms to minimize.
[2022-06-13 00:31:40] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 2 ms to minimize.
[2022-06-13 00:31:40] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 1 ms to minimize.
[2022-06-13 00:31:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-13 00:31:41] [INFO ] [Real]Absence check using 161 positive place invariants in 75 ms returned sat
[2022-06-13 00:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:42] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2022-06-13 00:31:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:31:42] [INFO ] [Nat]Absence check using 161 positive place invariants in 76 ms returned sat
[2022-06-13 00:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:31:44] [INFO ] [Nat]Absence check using state equation in 1567 ms returned sat
[2022-06-13 00:31:44] [INFO ] Deduced a trap composed of 20 places in 359 ms of which 1 ms to minimize.
[2022-06-13 00:31:44] [INFO ] Deduced a trap composed of 68 places in 371 ms of which 1 ms to minimize.
[2022-06-13 00:31:45] [INFO ] Deduced a trap composed of 28 places in 355 ms of which 2 ms to minimize.
[2022-06-13 00:31:45] [INFO ] Deduced a trap composed of 21 places in 353 ms of which 1 ms to minimize.
[2022-06-13 00:31:46] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 1 ms to minimize.
[2022-06-13 00:31:46] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 1 ms to minimize.
[2022-06-13 00:31:47] [INFO ] Deduced a trap composed of 26 places in 349 ms of which 1 ms to minimize.
[2022-06-13 00:31:47] [INFO ] Deduced a trap composed of 27 places in 327 ms of which 1 ms to minimize.
[2022-06-13 00:31:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
Fused 6 Parikh solutions to 1 different solutions.
Support contains 138 out of 1603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1603 transition count 1662
Reduce places removed 141 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 143 rules applied. Total rules applied 284 place count 1462 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 1460 transition count 1660
Performed 194 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 194 Pre rules applied. Total rules applied 286 place count 1460 transition count 1466
Deduced a syphon composed of 194 places in 4 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 3 with 388 rules applied. Total rules applied 674 place count 1266 transition count 1466
Discarding 251 places :
Symmetric choice reduction at 3 with 251 rule applications. Total rules 925 place count 1015 transition count 1215
Iterating global reduction 3 with 251 rules applied. Total rules applied 1176 place count 1015 transition count 1215
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 1176 place count 1015 transition count 1133
Deduced a syphon composed of 82 places in 5 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 1340 place count 933 transition count 1133
Performed 262 Post agglomeration using F-continuation condition.Transition count delta: 262
Deduced a syphon composed of 262 places in 4 ms
Reduce places removed 262 places and 0 transitions.
Iterating global reduction 3 with 524 rules applied. Total rules applied 1864 place count 671 transition count 871
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 3 with 66 rules applied. Total rules applied 1930 place count 671 transition count 871
Applied a total of 1930 rules in 483 ms. Remains 671 /1603 variables (removed 932) and now considering 871/1803 (removed 932) transitions.
Finished structural reductions, in 1 iterations. Remains : 671/1603 places, 871/1803 transitions.
[2022-06-13 00:31:48] [INFO ] Flatten gal took : 134 ms
[2022-06-13 00:31:48] [INFO ] Flatten gal took : 79 ms
[2022-06-13 00:31:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1261649530379686186.gal : 27 ms
[2022-06-13 00:31:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3060215269853111394.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1261649530379686186.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3060215269853111394.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1261649530379686186.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3060215269853111394.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3060215269853111394.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 165
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :165 after 4863
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :4863 after 291603
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :291603 after 6.29856e+08
Invariant property ShieldRVs-PT-040B-ReachabilityFireability-13 does not hold.
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3.0468e+17 after 5.01117e+17
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :5.01117e+17 after 5.01117e+17
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :5.01117e+17 after 5.01117e+17
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :5.01117e+17 after 5.01117e+17
Detected timeout of ITS tools.
[2022-06-13 00:32:03] [INFO ] Flatten gal took : 66 ms
[2022-06-13 00:32:03] [INFO ] Applying decomposition
[2022-06-13 00:32:03] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6270338474696497365.txt, -o, /tmp/graph6270338474696497365.bin, -w, /tmp/graph6270338474696497365.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6270338474696497365.bin, -l, -1, -v, -w, /tmp/graph6270338474696497365.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:32:03] [INFO ] Decomposing Gal with order
[2022-06-13 00:32:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:32:03] [INFO ] Removed a total of 1053 redundant transitions.
[2022-06-13 00:32:03] [INFO ] Flatten gal took : 145 ms
[2022-06-13 00:32:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 647 labels/synchronizations in 91 ms.
[2022-06-13 00:32:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3480143498189414198.gal : 28 ms
[2022-06-13 00:32:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13267573397253754516.prop : 23 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3480143498189414198.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13267573397253754516.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3480143498189414198.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13267573397253754516.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13267573397253754516.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :6 after 41
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :41 after 243041
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :243041 after 3.77914e+10
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2.55254e+19 after 1.04558e+23
Reachability property ShieldRVs-PT-040B-ReachabilityFireability-08 is true.
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldRVs-PT-040B-ReachabilityFireability-06 is true.
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.04558e+23 after 6.48884e+44
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1293065168800916934
[2022-06-13 00:32:19] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1293065168800916934
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1293065168800916934]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1293065168800916934] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1293065168800916934] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 1541 resets, run finished after 4526 ms. (steps per millisecond=220 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 134 resets, run finished after 2833 ms. (steps per millisecond=352 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 129 resets, run finished after 3769 ms. (steps per millisecond=265 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 871 rows 671 cols
[2022-06-13 00:32:31] [INFO ] Computed 161 place invariants in 14 ms
[2022-06-13 00:32:31] [INFO ] [Real]Absence check using 161 positive place invariants in 35 ms returned sat
[2022-06-13 00:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:32:31] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2022-06-13 00:32:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:32:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 31 ms returned sat
[2022-06-13 00:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:32:32] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2022-06-13 00:32:32] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 1 ms to minimize.
[2022-06-13 00:32:32] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2022-06-13 00:32:32] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-06-13 00:32:32] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 4 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2022-06-13 00:32:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1393 ms
[2022-06-13 00:32:33] [INFO ] Computed and/alt/rep : 561/2651/561 causal constraints (skipped 309 transitions) in 55 ms.
[2022-06-13 00:32:39] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:32:39] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2022-06-13 00:32:39] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2022-06-13 00:32:39] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2022-06-13 00:32:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2022-06-13 00:32:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 659 ms
[2022-06-13 00:32:40] [INFO ] Added : 401 causal constraints over 81 iterations in 6412 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-13 00:32:40] [INFO ] [Real]Absence check using 161 positive place invariants in 34 ms returned sat
[2022-06-13 00:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:32:40] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-06-13 00:32:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:32:40] [INFO ] [Nat]Absence check using 161 positive place invariants in 37 ms returned sat
[2022-06-13 00:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:32:40] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2022-06-13 00:32:41] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2022-06-13 00:32:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2022-06-13 00:32:41] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-06-13 00:32:41] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2022-06-13 00:32:41] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-06-13 00:32:41] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2022-06-13 00:32:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2022-06-13 00:32:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 656 ms
[2022-06-13 00:32:41] [INFO ] Computed and/alt/rep : 561/2651/561 causal constraints (skipped 309 transitions) in 55 ms.
[2022-06-13 00:32:47] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-06-13 00:32:47] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2022-06-13 00:32:48] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2022-06-13 00:32:48] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-06-13 00:32:48] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-06-13 00:32:48] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-06-13 00:32:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:32:48] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2022-06-13 00:32:48] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:32:48] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:32:49] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2022-06-13 00:32:49] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2022-06-13 00:32:49] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1746 ms
[2022-06-13 00:32:49] [INFO ] Added : 428 causal constraints over 87 iterations in 8039 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
Incomplete Parikh walk after 91000 steps, including 1006 resets, run finished after 478 ms. (steps per millisecond=190 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 88600 steps, including 1013 resets, run finished after 467 ms. (steps per millisecond=189 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 69 out of 671 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 671/671 places, 871/871 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 671 transition count 863
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 663 transition count 863
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 16 place count 663 transition count 849
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 44 place count 649 transition count 849
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 648 transition count 848
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 648 transition count 848
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 98 place count 622 transition count 822
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 622 transition count 822
Applied a total of 106 rules in 136 ms. Remains 622 /671 variables (removed 49) and now considering 822/871 (removed 49) transitions.
Finished structural reductions, in 1 iterations. Remains : 622/671 places, 822/871 transitions.
[2022-06-13 00:32:50] [INFO ] Flatten gal took : 45 ms
[2022-06-13 00:32:50] [INFO ] Flatten gal took : 45 ms
[2022-06-13 00:32:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2577604871080170011.gal : 6 ms
[2022-06-13 00:32:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2030031223981133330.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2577604871080170011.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2030031223981133330.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2577604871080170011.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2030031223981133330.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2030031223981133330.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 110
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :110 after 326
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :326 after 2918
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2918 after 559874
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.30607e+10 after 2.21816e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.21816e+10 after 2.21816e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.21816e+10 after 2.21817e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.21817e+10 after 2.21979e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.21979e+10 after 2.36161e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.36161e+10 after 1.62213e+11
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.62213e+11 after 1.26808e+13
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.26808e+13 after 4.85341e+16
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.85341e+16 after 9.1989e+20
Detected timeout of ITS tools.
[2022-06-13 00:33:06] [INFO ] Flatten gal took : 59 ms
[2022-06-13 00:33:06] [INFO ] Applying decomposition
[2022-06-13 00:33:06] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph796340491957265184.txt, -o, /tmp/graph796340491957265184.bin, -w, /tmp/graph796340491957265184.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph796340491957265184.bin, -l, -1, -v, -w, /tmp/graph796340491957265184.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:33:06] [INFO ] Decomposing Gal with order
[2022-06-13 00:33:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:33:06] [INFO ] Removed a total of 1004 redundant transitions.
[2022-06-13 00:33:06] [INFO ] Flatten gal took : 97 ms
[2022-06-13 00:33:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 800 labels/synchronizations in 58 ms.
[2022-06-13 00:33:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10729662411390177550.gal : 11 ms
[2022-06-13 00:33:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6983916119958026006.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10729662411390177550.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6983916119958026006.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10729662411390177550.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6983916119958026006.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6983916119958026006.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 226
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :226 after 35163
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :35163 after 2.5311e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.1936e+12 after 9.12725e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17287452263285039973
[2022-06-13 00:33:21] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17287452263285039973
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17287452263285039973]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17287452263285039973] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17287452263285039973] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 1767 resets, run finished after 4389 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 169 resets, run finished after 2617 ms. (steps per millisecond=382 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 157 resets, run finished after 3537 ms. (steps per millisecond=282 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2797580 steps, run timeout after 30001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 2797580 steps, saw 544426 distinct states, run finished after 30022 ms. (steps per millisecond=93 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 822 rows 622 cols
[2022-06-13 00:34:03] [INFO ] Computed 161 place invariants in 9 ms
[2022-06-13 00:34:03] [INFO ] [Real]Absence check using 161 positive place invariants in 27 ms returned sat
[2022-06-13 00:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:34:03] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-06-13 00:34:03] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2022-06-13 00:34:03] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2022-06-13 00:34:03] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-06-13 00:34:03] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2022-06-13 00:34:03] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-06-13 00:34:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:34:03] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:34:03] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-06-13 00:34:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-06-13 00:34:04] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2022-06-13 00:34:04] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2022-06-13 00:34:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 750 ms
[2022-06-13 00:34:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:34:04] [INFO ] [Nat]Absence check using 161 positive place invariants in 31 ms returned sat
[2022-06-13 00:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:34:04] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2022-06-13 00:34:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-13 00:34:04] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2022-06-13 00:34:04] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:34:04] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-06-13 00:34:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-06-13 00:34:05] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2022-06-13 00:34:05] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2022-06-13 00:34:05] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2022-06-13 00:34:05] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2022-06-13 00:34:05] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2022-06-13 00:34:05] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2022-06-13 00:34:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 826 ms
[2022-06-13 00:34:05] [INFO ] Computed and/alt/rep : 460/2215/460 causal constraints (skipped 361 transitions) in 41 ms.
[2022-06-13 00:34:09] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-06-13 00:34:09] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2022-06-13 00:34:09] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2022-06-13 00:34:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 287 ms
[2022-06-13 00:34:09] [INFO ] Added : 346 causal constraints over 70 iterations in 4220 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-13 00:34:09] [INFO ] [Real]Absence check using 161 positive place invariants in 32 ms returned sat
[2022-06-13 00:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:34:09] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-06-13 00:34:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:34:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 32 ms returned sat
[2022-06-13 00:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:34:10] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2022-06-13 00:34:10] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:34:10] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-06-13 00:34:10] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2022-06-13 00:34:10] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2022-06-13 00:34:10] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:34:10] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2022-06-13 00:34:10] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 6 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:34:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1461 ms
[2022-06-13 00:34:11] [INFO ] Computed and/alt/rep : 460/2215/460 causal constraints (skipped 361 transitions) in 52 ms.
[2022-06-13 00:34:15] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:34:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-06-13 00:34:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2022-06-13 00:34:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-06-13 00:34:16] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2022-06-13 00:34:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 491 ms
[2022-06-13 00:34:16] [INFO ] Added : 334 causal constraints over 69 iterations in 4567 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 80300 steps, including 1019 resets, run finished after 399 ms. (steps per millisecond=201 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 79400 steps, including 1013 resets, run finished after 389 ms. (steps per millisecond=204 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 69 out of 622 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 622/622 places, 822/822 transitions.
Applied a total of 0 rules in 33 ms. Remains 622 /622 variables (removed 0) and now considering 822/822 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 622/622 places, 822/822 transitions.
Starting structural reductions, iteration 0 : 622/622 places, 822/822 transitions.
Applied a total of 0 rules in 29 ms. Remains 622 /622 variables (removed 0) and now considering 822/822 (removed 0) transitions.
// Phase 1: matrix 822 rows 622 cols
[2022-06-13 00:34:17] [INFO ] Computed 161 place invariants in 6 ms
[2022-06-13 00:34:17] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 822 rows 622 cols
[2022-06-13 00:34:17] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-13 00:34:18] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
[2022-06-13 00:34:18] [INFO ] Redundant transitions in 120 ms returned [653]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[653]
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:34:18] [INFO ] Computed 161 place invariants in 3 ms
[2022-06-13 00:34:18] [INFO ] Dead Transitions using invariants and state equation in 361 ms returned []
Starting structural reductions, iteration 1 : 622/622 places, 821/822 transitions.
Applied a total of 0 rules in 18 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
[2022-06-13 00:34:18] [INFO ] Redundant transitions in 130 ms returned []
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:34:18] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-13 00:34:19] [INFO ] Dead Transitions using invariants and state equation in 307 ms returned []
Finished structural reductions, in 2 iterations. Remains : 622/622 places, 821/822 transitions.
[2022-06-13 00:34:19] [INFO ] Flatten gal took : 37 ms
[2022-06-13 00:34:19] [INFO ] Flatten gal took : 37 ms
[2022-06-13 00:34:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6785598183501088359.gal : 5 ms
[2022-06-13 00:34:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18257167656964091045.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6785598183501088359.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18257167656964091045.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6785598183501088359.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18257167656964091045.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18257167656964091045.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 110
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :110 after 326
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :326 after 2918
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2918 after 559874
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.30607e+10 after 2.21816e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.21816e+10 after 2.21816e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.21816e+10 after 2.21817e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.21817e+10 after 2.21979e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.21979e+10 after 2.36161e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.36161e+10 after 1.62213e+11
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.62213e+11 after 1.26808e+13
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.26808e+13 after 4.85341e+16
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.85341e+16 after 9.1989e+20
Detected timeout of ITS tools.
[2022-06-13 00:34:34] [INFO ] Flatten gal took : 38 ms
[2022-06-13 00:34:34] [INFO ] Applying decomposition
[2022-06-13 00:34:34] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10854539056091904543.txt, -o, /tmp/graph10854539056091904543.bin, -w, /tmp/graph10854539056091904543.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10854539056091904543.bin, -l, -1, -v, -w, /tmp/graph10854539056091904543.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:34:34] [INFO ] Decomposing Gal with order
[2022-06-13 00:34:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:34:34] [INFO ] Removed a total of 1002 redundant transitions.
[2022-06-13 00:34:34] [INFO ] Flatten gal took : 69 ms
[2022-06-13 00:34:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 808 labels/synchronizations in 23 ms.
[2022-06-13 00:34:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3108340696494811152.gal : 8 ms
[2022-06-13 00:34:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1243681998426377104.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3108340696494811152.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1243681998426377104.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3108340696494811152.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1243681998426377104.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1243681998426377104.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :226 after 1962
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1962 after 2.5311e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.1936e+12 after 1.2139e+16
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.2139e+16 after 6.95921e+45
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8682239927393488733
[2022-06-13 00:34:49] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8682239927393488733
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8682239927393488733]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8682239927393488733] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8682239927393488733] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 1769 resets, run finished after 4371 ms. (steps per millisecond=228 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 173 resets, run finished after 2645 ms. (steps per millisecond=378 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 161 resets, run finished after 3549 ms. (steps per millisecond=281 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2755733 steps, run timeout after 30001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 2755733 steps, saw 537330 distinct states, run finished after 30002 ms. (steps per millisecond=91 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:35:31] [INFO ] Computed 161 place invariants in 11 ms
[2022-06-13 00:35:31] [INFO ] [Real]Absence check using 161 positive place invariants in 30 ms returned sat
[2022-06-13 00:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:35:31] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-06-13 00:35:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-06-13 00:35:31] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2022-06-13 00:35:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1052 ms
[2022-06-13 00:35:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:35:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 29 ms returned sat
[2022-06-13 00:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:35:33] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2022-06-13 00:35:33] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2022-06-13 00:35:33] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2022-06-13 00:35:33] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2022-06-13 00:35:33] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2022-06-13 00:35:33] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2022-06-13 00:35:33] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2022-06-13 00:35:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2022-06-13 00:35:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 603 ms
[2022-06-13 00:35:33] [INFO ] Computed and/alt/rep : 461/2229/461 causal constraints (skipped 359 transitions) in 41 ms.
[2022-06-13 00:35:37] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2022-06-13 00:35:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-06-13 00:35:37] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-06-13 00:35:38] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:35:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 446 ms
[2022-06-13 00:35:38] [INFO ] Added : 336 causal constraints over 68 iterations in 4601 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-13 00:35:38] [INFO ] [Real]Absence check using 161 positive place invariants in 34 ms returned sat
[2022-06-13 00:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:35:38] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2022-06-13 00:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:35:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 33 ms returned sat
[2022-06-13 00:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:35:39] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2022-06-13 00:35:39] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:35:40] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1398 ms
[2022-06-13 00:35:40] [INFO ] Computed and/alt/rep : 461/2229/461 causal constraints (skipped 359 transitions) in 42 ms.
[2022-06-13 00:35:44] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2022-06-13 00:35:45] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:35:45] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-06-13 00:35:45] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2022-06-13 00:35:45] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:35:45] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2022-06-13 00:35:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2022-06-13 00:35:45] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:35:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 940 ms
[2022-06-13 00:35:45] [INFO ] Added : 367 causal constraints over 74 iterations in 5382 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 76300 steps, including 1032 resets, run finished after 385 ms. (steps per millisecond=198 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 101300 steps, including 1059 resets, run finished after 485 ms. (steps per millisecond=208 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 69 out of 622 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 622/622 places, 821/821 transitions.
Applied a total of 0 rules in 31 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 622/622 places, 821/821 transitions.
Starting structural reductions, iteration 0 : 622/622 places, 821/821 transitions.
Applied a total of 0 rules in 17 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:35:46] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-13 00:35:47] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:35:47] [INFO ] Computed 161 place invariants in 3 ms
[2022-06-13 00:35:47] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2022-06-13 00:35:47] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:35:47] [INFO ] Computed 161 place invariants in 5 ms
[2022-06-13 00:35:48] [INFO ] Dead Transitions using invariants and state equation in 357 ms returned []
Finished structural reductions, in 1 iterations. Remains : 622/622 places, 821/821 transitions.
Incomplete random walk after 100000 steps, including 177 resets, run finished after 611 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:35:48] [INFO ] Computed 161 place invariants in 7 ms
[2022-06-13 00:35:49] [INFO ] [Real]Absence check using 161 positive place invariants in 39 ms returned sat
[2022-06-13 00:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:35:49] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-06-13 00:35:49] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-06-13 00:35:49] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2022-06-13 00:35:49] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-06-13 00:35:49] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-06-13 00:35:49] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2022-06-13 00:35:49] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-06-13 00:35:50] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2022-06-13 00:35:50] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2022-06-13 00:35:50] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-06-13 00:35:50] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2022-06-13 00:35:50] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2022-06-13 00:35:50] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2022-06-13 00:35:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1163 ms
[2022-06-13 00:35:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:35:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 31 ms returned sat
[2022-06-13 00:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:35:50] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-06-13 00:35:50] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-06-13 00:35:51] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2022-06-13 00:35:51] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-06-13 00:35:51] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2022-06-13 00:35:51] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2022-06-13 00:35:51] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:35:51] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2022-06-13 00:35:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 570 ms
[2022-06-13 00:35:51] [INFO ] Computed and/alt/rep : 461/2229/461 causal constraints (skipped 359 transitions) in 49 ms.
[2022-06-13 00:35:55] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:35:55] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-06-13 00:35:55] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2022-06-13 00:35:55] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:35:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 463 ms
[2022-06-13 00:35:56] [INFO ] Added : 336 causal constraints over 68 iterations in 4629 ms. Result :sat
[2022-06-13 00:35:56] [INFO ] [Real]Absence check using 161 positive place invariants in 38 ms returned sat
[2022-06-13 00:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:35:56] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2022-06-13 00:35:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:35:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 34 ms returned sat
[2022-06-13 00:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:35:56] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2022-06-13 00:35:56] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
[2022-06-13 00:35:57] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2022-06-13 00:35:58] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-06-13 00:35:58] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2022-06-13 00:35:58] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-06-13 00:35:58] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2022-06-13 00:35:58] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1338 ms
[2022-06-13 00:35:58] [INFO ] Computed and/alt/rep : 461/2229/461 causal constraints (skipped 359 transitions) in 45 ms.
[2022-06-13 00:36:02] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2022-06-13 00:36:02] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2022-06-13 00:36:02] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2022-06-13 00:36:02] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:36:03] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:36:03] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-06-13 00:36:03] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2022-06-13 00:36:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2022-06-13 00:36:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 967 ms
[2022-06-13 00:36:03] [INFO ] Added : 367 causal constraints over 74 iterations in 5441 ms. Result :sat
[2022-06-13 00:36:03] [INFO ] Flatten gal took : 35 ms
[2022-06-13 00:36:03] [INFO ] Flatten gal took : 34 ms
[2022-06-13 00:36:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8751666128495449273.gal : 4 ms
[2022-06-13 00:36:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2692203525174849005.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8751666128495449273.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2692203525174849005.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8751666128495449273.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2692203525174849005.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2692203525174849005.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 110
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :110 after 326
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :326 after 2918
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2918 after 559874
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.30607e+10 after 2.21816e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.21816e+10 after 2.21816e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.21816e+10 after 2.21817e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.21817e+10 after 2.21979e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.21979e+10 after 2.36161e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.36161e+10 after 1.62213e+11
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.62213e+11 after 1.26808e+13
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.26808e+13 after 4.85341e+16
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.85341e+16 after 9.1989e+20
Detected timeout of ITS tools.
[2022-06-13 00:36:23] [INFO ] Flatten gal took : 37 ms
[2022-06-13 00:36:23] [INFO ] Applying decomposition
[2022-06-13 00:36:23] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10763927095744905086.txt, -o, /tmp/graph10763927095744905086.bin, -w, /tmp/graph10763927095744905086.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10763927095744905086.bin, -l, -1, -v, -w, /tmp/graph10763927095744905086.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:36:23] [INFO ] Decomposing Gal with order
[2022-06-13 00:36:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:36:23] [INFO ] Removed a total of 992 redundant transitions.
[2022-06-13 00:36:23] [INFO ] Flatten gal took : 54 ms
[2022-06-13 00:36:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 803 labels/synchronizations in 17 ms.
[2022-06-13 00:36:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8746962048862026142.gal : 8 ms
[2022-06-13 00:36:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7257416327267004811.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8746962048862026142.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7257416327267004811.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8746962048862026142.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7257416327267004811.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7257416327267004811.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 81
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :81 after 1305
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1305 after 7785
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.1936e+12 after 4.5244e+15
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4.5244e+15 after 2.30619e+33
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15132087083969529499
[2022-06-13 00:36:44] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15132087083969529499
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15132087083969529499]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15132087083969529499] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15132087083969529499] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Applied a total of 0 rules in 18 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:36:46] [INFO ] Computed 161 place invariants in 2 ms
[2022-06-13 00:36:46] [INFO ] [Real]Absence check using 161 positive place invariants in 41 ms returned sat
[2022-06-13 00:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:36:46] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-06-13 00:36:46] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2022-06-13 00:36:46] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-06-13 00:36:46] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-06-13 00:36:46] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2022-06-13 00:36:46] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2022-06-13 00:36:47] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2022-06-13 00:36:47] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2022-06-13 00:36:47] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-06-13 00:36:47] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2022-06-13 00:36:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-06-13 00:36:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2022-06-13 00:36:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
[2022-06-13 00:36:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1091 ms
[2022-06-13 00:36:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:36:47] [INFO ] [Nat]Absence check using 161 positive place invariants in 30 ms returned sat
[2022-06-13 00:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:36:47] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2022-06-13 00:36:47] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 4 ms to minimize.
[2022-06-13 00:36:48] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2022-06-13 00:36:48] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2022-06-13 00:36:48] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:36:48] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-06-13 00:36:48] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-06-13 00:36:48] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2022-06-13 00:36:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 618 ms
[2022-06-13 00:36:48] [INFO ] Computed and/alt/rep : 461/2229/461 causal constraints (skipped 359 transitions) in 38 ms.
[2022-06-13 00:36:52] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-06-13 00:36:52] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-06-13 00:36:52] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:36:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:36:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 414 ms
[2022-06-13 00:36:53] [INFO ] Added : 336 causal constraints over 68 iterations in 4563 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-13 00:36:53] [INFO ] [Real]Absence check using 161 positive place invariants in 31 ms returned sat
[2022-06-13 00:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:36:53] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2022-06-13 00:36:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:36:53] [INFO ] [Nat]Absence check using 161 positive place invariants in 32 ms returned sat
[2022-06-13 00:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:36:53] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:36:54] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:36:55] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:36:55] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-06-13 00:36:55] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2022-06-13 00:36:55] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2022-06-13 00:36:55] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2022-06-13 00:36:55] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1333 ms
[2022-06-13 00:36:55] [INFO ] Computed and/alt/rep : 461/2229/461 causal constraints (skipped 359 transitions) in 40 ms.
[2022-06-13 00:36:59] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2022-06-13 00:36:59] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2022-06-13 00:36:59] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2022-06-13 00:37:00] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-06-13 00:37:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:37:00] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2022-06-13 00:37:00] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:37:00] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-06-13 00:37:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 986 ms
[2022-06-13 00:37:00] [INFO ] Added : 367 causal constraints over 74 iterations in 5489 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-13 00:37:00] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
[2022-06-13 00:37:00] [INFO ] Flatten gal took : 43 ms
Built C files in :
/tmp/ltsmin12673175019903891104
[2022-06-13 00:37:00] [INFO ] Computing symmetric may disable matrix : 821 transitions.
[2022-06-13 00:37:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 00:37:00] [INFO ] Computing symmetric may enable matrix : 821 transitions.
[2022-06-13 00:37:00] [INFO ] Applying decomposition
[2022-06-13 00:37:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 00:37:01] [INFO ] Input system was already deterministic with 821 transitions.
[2022-06-13 00:37:01] [INFO ] Flatten gal took : 79 ms
[2022-06-13 00:37:01] [INFO ] Computing Do-Not-Accords matrix : 821 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13763708741369257544.txt, -o, /tmp/graph13763708741369257544.bin, -w, /tmp/graph13763708741369257544.weights], workingDir=null]
[2022-06-13 00:37:01] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-13 00:37:01] [INFO ] Built C files in 274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12673175019903891104
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12673175019903891104]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13763708741369257544.bin, -l, -1, -v, -w, /tmp/graph13763708741369257544.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:37:01] [INFO ] Decomposing Gal with order
[2022-06-13 00:37:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:37:01] [INFO ] Removed a total of 998 redundant transitions.
[2022-06-13 00:37:01] [INFO ] Flatten gal took : 53 ms
[2022-06-13 00:37:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 794 labels/synchronizations in 18 ms.
[2022-06-13 00:37:01] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability149014759982171879.gal : 7 ms
[2022-06-13 00:37:01] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5256053119875077126.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability149014759982171879.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability5256053119875077126.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability149014759982171879.gal -t CGAL -reachable-file /tmp/ReachabilityFireability5256053119875077126.prop --nowitness
[2022-06-13 00:37:01] [INFO ] Ran tautology test, simplified 0 / 2 in 572 ms.
Loading property file /tmp/ReachabilityFireability5256053119875077126.prop.
[2022-06-13 00:37:01] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=0 took 9 ms
[2022-06-13 00:37:01] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=0 took 27 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 57
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :57 after 7785
[2022-06-13 00:37:01] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=1 took 15 ms
[2022-06-13 00:37:01] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=1 took 5 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7785 after 559881
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :559881 after 3.48285e+10
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 821 rows 622 cols
[2022-06-13 00:37:01] [INFO ] Computed 161 place invariants in 2 ms
inv : p0 + p1 + p1046 + p1049 + p1051 + p1053 = 1
inv : p0 + p1 + p1539 + p1541 = 1
inv : p0 + p1 + p476 + p478 + p480 + p482 = 1
inv : p0 + p1 + p1358 + p1361 + p1363 + p1365 = 1
inv : p0 + p1 + p866 + p868 + p870 + p872 = 1
inv : p0 + p1 + p1217 + p1219 + p1221 + p1223 = 1
inv : p0 + p1 + p252 + p254 = 1
inv : p0 + p1 + p1138 + p1149 + p1151 + p1152 = 1
inv : p0 + p1 + p788 + p790 + p792 + p794 = 1
inv : p0 + p1 + p1411 + p1422 + p1424 + p1425 = 1
inv : p0 + p1 + p798 + p800 = 1
inv : p0 + p1 + p603 + p605 = 1
inv : p0 + p1 + p47 + p49 + p51 + p53 + p54 + p55 = 1
inv : p0 + p1 + p763 + p765 + p766 + p767 + p769 = 1
inv : p0 + p1 + p1514 + p1517 + p1519 + p1521 + p1522 = 1
inv : p0 + p1 + p297 + p299 + p301 + p303 = 1
inv : p0 + p1 + p515 + p517 + p519 + p521 = 1
inv : p0 + p1 + p617 + p620 + p622 + p624 = 1
inv : p0 + p1 + p632 + p634 + p635 + p636 + p638 = 1
inv : p0 + p1 + p124 + p125 + p127 + p129 + p131 + p133 = 1
inv : p0 + p1 + p1348 + p1350 + p1352 + p1354 = 1
inv : p0 + p1 + p648 + p650 + p652 + p653 + p654 = 1
inv : p0 + p1 + p1036 + p1038 + p1040 + p1042 = 1
inv : p0 + p1 + p929 + p932 + p934 + p936 = 1
inv : p0 + p1 + p915 + p917 = 1
inv : p0 + p1 + p1202 + p1205 + p1207 + p1209 = 1
inv : p0 + p1 + p578 + p581 + p583 + p585 = 1
inv : p0 + p1 + p759 + p761 = 1
inv : p0 + p1 + p96 + p98 = 1
inv : p0 + p1 + p1085 + p1088 + p1090 + p1092 = 1
inv : p0 + p1 + p1076 + p1077 + p1079 + p1081 + p1083 = 1
inv : p0 + p1 + p330 + p332 + p333 = 1
inv : p0 + p1 + p408 + p410 = 1
inv : p0 + p1 + p355 + p357 + p373 + p375 + p377 + p379 = 1
inv : p0 + p1 + p983 + p985 + p986 + p987 + p989 = 1
inv : p0 + p1 + p178 + p180 + p181 + p182 + p184 = 1
inv : p0 + p1 + p500 + p503 + p505 + p507 = 1
inv : p0 + p1 + p305 + p308 + p310 + p312 = 1
inv : p0 + p1 + p607 + p609 + p611 + p613 = 1
inv : p0 + p1 + p749 + p751 + p753 + p755 = 1
inv : p0 + p1 + p124 + p135 + p137 = 1
inv : p0 + p1 + p199 + p201 + p215 + p216 = 1
inv : p0 + p1 + p437 + p439 + p440 + p441 + p443 = 1
inv : p0 + p1 + p695 + p698 + p700 + p702 = 1
inv : p0 + p1 + p1373 + p1375 + p1377 + p1379 + p1380 = 1
inv : p0 + p1 + p281 + p283 + p285 + p287 = 1
inv : p0 + p1 + p1461 + p1463 = 1
inv : p0 + p1 + p1163 + p1166 + p1168 + p1170 = 1
inv : p0 + p1 + p344 + p346 + p347 + p349 + p351 = 1
inv : p0 + p1 + p851 + p854 + p856 + p858 = 1
inv : p0 + p1 + p1138 + p1139 + p1141 + p1143 + p1145 = 1
inv : p0 + p1 + p100 + p102 + p104 + p106 = 1
inv : p0 + p1 + p1451 + p1453 + p1454 + p1455 + p1457 + p1459 + p1460 = 1
inv : p0 + p1 + p1124 + p1127 + p1129 + p1131 + p1132 = 1
inv : p0 + p1 + p890 + p893 + p895 + p897 = 1
inv : p0 + p1 + p734 + p737 + p739 + p741 = 1
inv : p0 + p1578 + p1580 = 1
inv : p0 + p1 + p1266 + p1268 = 1
inv : p0 + p1 + p802 + p804 + p806 + p808 = 1
inv : p0 + p1 + p1295 + p1297 + p1299 + p1300 + p1301 = 1
inv : p0 + p1 + p1061 + p1063 + p1065 + p1067 = 1
inv : p0 + p1 + p1543 + p1545 + p1547 + p1549 = 1
inv : p0 + p1 + p1281 + p1283 + p1285 + p1287 + p1289 = 1
inv : p0 + p1 + p422 + p425 + p427 + p429 = 1
inv : p0 + p1 + p539 + p542 + p544 + p546 = 1
inv : p0 + p1 + p685 + p687 + p688 + p689 + p691 = 1
inv : p0 + p1 + p1178 + p1180 + p1182 + p1184 + p1185 = 1
inv : p0 + p1 + p244 + p246 + p248 + p250 = 1
inv : p0 + p1 + p1387 + p1389 + p1390 + p1391 + p1393 + p1394 = 1
inv : p0 + p1 + p149 + p152 + p154 + p156 + p157 = 1
inv : p0 + p1 + p1309 + p1311 + p1313 + p1315 = 1
inv : p0 + p1 + p1529 + p1531 + p1533 + p1535 = 1
inv : p0 + p1 + p876 + p878 = 1
inv : p0 + p1 + p1319 + p1322 + p1324 + p1326 = 1
inv : p0 + p1582 + p1584 + p1586 + p1588 + p1589 = 1
inv : p0 + p1 + p1007 + p1010 + p1012 + p1014 = 1
inv : p0 + p1 + p1553 + p1556 + p1558 + p1560 + p1562 + p1563 = 1
inv : p0 + p1 + p1110 + p1112 = 1
inv : p0 + p1 + p188 + p191 + p193 + p195 = 1
inv : p0 + p1 + p681 + p683 = 1
inv : p0 + p1 + p1188 + p1190 = 1
inv : p0 + p1 + p968 + p971 + p973 + p975 = 1
inv : p0 + p1 + p554 + p556 + p558 + p560 = 1
inv : p0 + p1 + p1305 + p1307 = 1
inv : p0 + p1 + p256 + p258 + p260 + p262 = 1
inv : p0 + p1 + p1227 + p1229 = 1
inv : p0 + p1 + p827 + p829 + p831 + p833 = 1
inv : p0 + p1 + p164 + p166 + p168 + p170 = 1
inv : p0 + p1 + p355 + p383 + p386 + p388 + p390 = 1
inv : p0 + p1 + p1241 + p1244 + p1246 + p1248 = 1
inv : p0 + p1 + p720 + p722 = 1
inv : p0 + p1 + p1114 + p1116 + p1118 + p1120 = 1
inv : p0 + p1 + p291 + p293 = 1
inv : p0 + p1 + p1426 + p1428 + p1429 + p1430 + p1432 + p1434 + p1435 = 1
inv : p0 + p1 + p1022 + p1024 + p1026 + p1028 = 1
inv : p0 + p1 + p57 + p59 = 1
inv : p0 + p1 + p486 + p488 = 1
inv : p0 + p1 + p110 + p113 + p115 + p117 = 1
inv : p0 + p1 + p355 + p357 + p359 + p361 + p363 + p365 = 1
inv : p0 + p1 + p837 + p839 = 1
inv : p0 + p1 + p812 + p815 + p817 + p819 = 1
inv : p0 + p1 + p355 + p357 + p369 + p371 = 1
inv : p0 + p1 + p451 + p453 + p455 + p457 = 1
inv : p0 + p1 + p841 + p843 + p845 + p847 = 1
inv : p0 + p1 + p958 + p960 + p962 + p964 = 1
inv : p0 + p1 + p199 + p227 + p230 + p232 + p234 = 1
inv : p0 + p1 + p199 + p201 + p217 + p219 + p221 + p223 = 1
inv : p0 + p1 + p199 + p201 + p203 + p205 + p207 + p209 = 1
inv : p0 + p1 + p1500 + p1502 = 1
inv : p0 + p1 + p1071 + p1073 = 1
inv : p0 + p1 + p1334 + p1336 + p1338 + p1340 = 1
inv : p0 + p1 + p905 + p907 + p909 + p911 = 1
inv : p0 + p1 + p139 + p141 + p143 + p145 = 1
inv : p0 + p1 + p320 + p322 + p324 + p326 = 1
inv : p0 + p1 + p1231 + p1233 + p1235 + p1237 = 1
inv : p0 + p1 + p529 + p531 + p533 + p535 = 1
inv : p0 + p1 + p1270 + p1272 + p1274 + p1276 = 1
inv : p0 + p1 + p671 + p673 + p675 + p677 + p678 = 1
inv : p0 + p1 + p1490 + p1492 + p1494 + p1496 = 1
inv : p0 + p1 + p71 + p74 + p76 + p78 = 1
inv : p0 + p1 + p568 + p570 + p572 + p574 = 1
inv : p0 + p1 + p1475 + p1478 + p1480 + p1482 + p1483 = 1
inv : p0 + p1 + p919 + p921 + p923 + p925 = 1
inv : p0 + p1 + p1100 + p1102 + p1104 + p1106 = 1
inv : p0 + p1 + p564 + p566 = 1
inv : p0 + p1 + p40 + p42 = 1
inv : p0 + p1 + p993 + p995 = 1
inv : p0 + p1 + p1504 + p1506 + p1507 + p1508 + p1510 = 1
inv : p0 + p1 + p954 + p956 = 1
inv : p0 + p1 + p1436 + p1439 + p1441 + p1443 + p1445 + p1446 = 1
inv : p0 + p1 + p593 + p595 + p597 + p598 + p599 + p600 + p601 = 1
inv : p0 + p1 + p1411 + p1412 + p1414 + p1416 + p1418 = 1
inv : p0 + p1 + p997 + p999 + p1001 + p1003 = 1
inv : p0 + p1 + p461 + p464 + p466 + p468 = 1
inv : p0 + p1 + p1344 + p1346 = 1
inv : p0 + p1 + p412 + p414 + p416 + p418 = 1
inv : p0 + p1 + p1192 + p1194 + p1196 + p1198 + p1199 = 1
inv : p0 + p1 + p1153 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 = 1
inv : p0 + p1 + p656 + p659 + p661 + p663 = 1
inv : p0 + p1 + p712 + p714 + p716 + p718 = 1
inv : p0 + p1 + p1397 + p1400 + p1402 + p1404 = 1
inv : p0 + p1 + p174 + p176 = 1
inv : p0 + p1568 + p1572 + p1574 = 1
inv : p0 + p1 + p1465 + p1467 + p1469 + p1471 + p1472 = 1
inv : p0 + p1 + p945 + p946 + p947 + p948 + p950 + p952 = 1
inv : p0 + p1 + p266 + p269 + p271 + p273 = 1
inv : p0 + p1 + p1383 + p1385 = 1
inv : p0 + p1 + p1032 + p1034 = 1
inv : p0 + p1 + p642 + p644 = 1
inv : p0 + p1 + p86 + p88 + p89 + p90 + p92 = 1
inv : p0 + p1 + p880 + p882 + p884 + p886 = 1
inv : p0 + p1 + p398 + p400 + p402 + p404 = 1
inv : p0 + p1 + p490 + p492 + p493 + p494 + p496 = 1
inv : p0 + p1 + p1256 + p1258 + p1260 + p1262 = 1
inv : p0 + p1 + p525 + p527 = 1
inv : p0 + p1592 + p1595 + p1597 + p1599 = 1
inv : p0 + p1 + p724 + p726 + p728 + p730 = 1
inv : p0 + p1 + p447 + p449 = 1
inv : p0 + p1 + p773 + p776 + p778 + p780 = 1
inv : p0 + p1 + p334 + p336 + p338 + p340 = 1
inv : p0 + p1 + p61 + p63 + p65 + p67 + p68 + p69 = 1
Total of 161 invariants.
[2022-06-13 00:37:01] [INFO ] Computed 161 place invariants in 12 ms
[2022-06-13 00:37:01] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=2 took 186 ms
[2022-06-13 00:37:01] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=2 took 7 ms
[2022-06-13 00:37:02] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=3 took 1054 ms
[2022-06-13 00:37:03] [INFO ] Proved 622 variables to be positive in 1685 ms
[2022-06-13 00:37:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-13 00:37:03] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=0 took 72 ms
[2022-06-13 00:37:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-13 00:37:03] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=0 took 90 ms
[2022-06-13 00:37:03] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=3 took 738 ms
[2022-06-13 00:37:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-13 00:37:03] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=1 took 286 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7.21854e+13 after 3.58374e+35
[2022-06-13 00:37:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-13 00:37:04] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=1 took 231 ms
Compilation finished in 6679 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12673175019903891104]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT040BReachabilityFireability02==true], workingDir=/tmp/ltsmin12673175019903891104]
[2022-06-13 00:37:28] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=4 took 24712 ms
[2022-06-13 00:44:46] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=4 took 437887 ms
[2022-06-13 00:48:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-13 00:48:08] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=2 took 664378 ms
[2022-06-13 00:50:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-13 00:50:42] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=2 took 153583 ms
Detected timeout of ITS tools.
[2022-06-13 00:58:58] [INFO ] Applying decomposition
[2022-06-13 00:58:58] [INFO ] Flatten gal took : 117 ms
[2022-06-13 00:58:58] [INFO ] Decomposing Gal with order
[2022-06-13 00:58:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:58:58] [INFO ] Removed a total of 992 redundant transitions.
[2022-06-13 00:58:58] [INFO ] Flatten gal took : 154 ms
[2022-06-13 00:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 803 labels/synchronizations in 52 ms.
[2022-06-13 00:58:58] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11005718699337300768.gal : 7 ms
[2022-06-13 00:58:58] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability871148528706245056.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability11005718699337300768.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability871148528706245056.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability11005718699337300768.gal -t CGAL -reachable-file /tmp/ReachabilityFireability871148528706245056.prop --nowitness
Loading property file /tmp/ReachabilityFireability871148528706245056.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 441
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :441 after 1305
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1305 after 7785
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.1936e+12 after 9.0226e+12
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.0226e+12 after 3.34198e+39
[2022-06-13 01:00:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-13 01:00:07] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=3 took 565360 ms
[2022-06-13 01:00:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-13 01:00:49] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=3 took 42180 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.116: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.116: Initializing POR dependencies: labels 823, guards 821
pins2lts-mc-linux64( 0/ 8), 4.510: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 4.575: "ShieldRVsPT040BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 4.586: "ShieldRVsPT040BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 4.575: "ShieldRVsPT040BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 4.586: "ShieldRVsPT040BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 4.575: "ShieldRVsPT040BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 4.583: "ShieldRVsPT040BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 4.575: "ShieldRVsPT040BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 4.575: "ShieldRVsPT040BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 4.577: There are 823 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 4.577: State length is 622, there are 821 groups
pins2lts-mc-linux64( 0/ 8), 4.577: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 4.577: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 4.577: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 4.577: Visible groups: 67 / 821, labels: 1 / 823
pins2lts-mc-linux64( 0/ 8), 4.577: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 4.577: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 4.982: ~31 levels ~960 states ~4456 transitions
pins2lts-mc-linux64( 0/ 8), 5.055: ~32 levels ~1920 states ~11840 transitions
pins2lts-mc-linux64( 0/ 8), 5.191: ~33 levels ~3840 states ~25216 transitions
pins2lts-mc-linux64( 0/ 8), 5.374: ~34 levels ~7680 states ~50096 transitions
pins2lts-mc-linux64( 0/ 8), 5.776: ~37 levels ~15360 states ~93432 transitions
pins2lts-mc-linux64( 0/ 8), 6.631: ~38 levels ~30720 states ~177128 transitions
pins2lts-mc-linux64( 0/ 8), 8.198: ~40 levels ~61440 states ~312976 transitions
pins2lts-mc-linux64( 0/ 8), 12.910: ~42 levels ~122880 states ~755584 transitions
pins2lts-mc-linux64( 0/ 8), 22.691: ~43 levels ~245760 states ~1686816 transitions
pins2lts-mc-linux64( 1/ 8), 42.150: ~19 levels ~491520 states ~3119528 transitions
pins2lts-mc-linux64( 1/ 8), 83.439: ~20 levels ~983040 states ~6556440 transitions
pins2lts-mc-linux64( 4/ 8), 163.858: ~40 levels ~1966080 states ~14772232 transitions
pins2lts-mc-linux64( 1/ 8), 349.317: ~23 levels ~3932160 states ~27763592 transitions
pins2lts-mc-linux64( 4/ 8), 728.573: ~42 levels ~7864320 states ~62447376 transitions
pins2lts-mc-linux64( 4/ 8), 1535.480: ~44 levels ~15728640 states ~131678904 transitions
pins2lts-mc-linux64( 0/ 8), 1799.350: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1799.561:
pins2lts-mc-linux64( 0/ 8), 1799.561: mean standard work distribution: 11.8% (states) 3.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 1799.561:
pins2lts-mc-linux64( 0/ 8), 1799.561: Explored 15689313 states 151228795 transitions, fanout: 9.639
pins2lts-mc-linux64( 0/ 8), 1799.561: Total exploration time 1794.980 sec (1794.790 sec minimum, 1794.866 sec on average)
pins2lts-mc-linux64( 0/ 8), 1799.561: States per second: 8741, Transitions per second: 84251
pins2lts-mc-linux64( 0/ 8), 1799.561: Ignoring proviso: 7696004
pins2lts-mc-linux64( 0/ 8), 1799.561:
pins2lts-mc-linux64( 0/ 8), 1799.561: Queue width: 8B, total height: 12790730, memory: 97.59MB
pins2lts-mc-linux64( 0/ 8), 1799.561: Tree memory: 473.3MB, 17.4 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1799.561: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1799.561: Stored 839 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1799.561: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1799.561: Est. total memory use: 570.8MB (~1121.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT040BReachabilityFireability02==true], workingDir=/tmp/ltsmin12673175019903891104]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT040BReachabilityFireability02==true], workingDir=/tmp/ltsmin12673175019903891104]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-13 01:09:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-13 01:09:34] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=4 took 524636 ms
[2022-06-13 01:13:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-13 01:13:01] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=4 took 207401 ms
[2022-06-13 01:16:01] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=5 took 1875247 ms
Detected timeout of ITS tools.
[2022-06-13 01:20:55] [INFO ] Flatten gal took : 270 ms
[2022-06-13 01:20:57] [INFO ] Input system was already deterministic with 821 transitions.
[2022-06-13 01:20:57] [INFO ] Transformed 622 places.
[2022-06-13 01:20:57] [INFO ] Transformed 821 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-13 01:20:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12086971620996805724.gal : 30 ms
[2022-06-13 01:20:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17708994919617331538.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability12086971620996805724.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability17708994919617331538.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability12086971620996805724.gal -t CGAL -reachable-file /tmp/ReachabilityFireability17708994919617331538.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability17708994919617331538.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 137
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :137 after 585
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :585 after 9225
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9225 after 331785
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :331785 after 2.44532e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.44532e+06 after 2.613e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.613e+06 after 2.92558e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.92558e+06 after 3.42836e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.42836e+06 after 4.53428e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.53428e+06 after 1.28993e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.28993e+07 after 2.63386e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.63386e+09 after 4.30628e+09
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :4.30628e+09 after 5.07623e+09
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :5.07623e+09 after 1.23868e+12
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.23868e+12 after 2.2016e+12
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.2016e+12 after 1.27023e+14
[2022-06-13 01:30:55] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=5 took 893887 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ShieldRVs-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037500318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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