Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208200268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CryptoMiner-PT-D20N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208200268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 34K Apr 12 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 197K Apr 12 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K Apr 12 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 363K Apr 12 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 219K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.2K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 27K May 18 16:42 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 CryptoMiner-PT-D20N100-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D20N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716323812009

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:36:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:36:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:36:53] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-21 20:36:53] [INFO ] Transformed 63 places.
[2024-05-21 20:36:53] [INFO ] Transformed 63 transitions.
[2024-05-21 20:36:53] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 12 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 20:36:53] [INFO ] Computed 0 invariants in 6 ms
[2024-05-21 20:36:54] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-21 20:36:54] [INFO ] Invariant cache hit.
[2024-05-21 20:36:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:36:54] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-21 20:36:54] [INFO ] Invariant cache hit.
[2024-05-21 20:36:54] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 62/63 places, 63/63 transitions.
Support contains 42 out of 62 places after structural reductions.
[2024-05-21 20:36:54] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:36:54] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:36:54] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=346 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:36:54] [INFO ] Invariant cache hit.
[2024-05-21 20:36:54] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 41 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 16 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:36:54] [INFO ] Invariant cache hit.
[2024-05-21 20:36:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:36:55] [INFO ] Invariant cache hit.
[2024-05-21 20:36:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:36:55] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-21 20:36:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:36:55] [INFO ] Invariant cache hit.
[2024-05-21 20:36:55] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 62/62 places, 63/63 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s42 1) (GEQ s41 1) (GEQ s44 1) (GEQ s43 1) (GEQ s46 1) (GEQ s45 1) (GEQ s48 1) (GEQ s47 1) (GEQ s50 1) (GEQ s49 1) (GEQ s52 1) (GEQ s51 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 340 ms.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 121 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 252 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 41 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:36:56] [INFO ] Invariant cache hit.
[2024-05-21 20:36:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:36:57] [INFO ] Invariant cache hit.
[2024-05-21 20:36:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:36:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-21 20:36:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:36:57] [INFO ] Invariant cache hit.
[2024-05-21 20:36:57] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=670 ) properties (out of 3) seen :1
Finished Best-First random walk after 420 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=140 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 228 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Product exploration explored 100000 steps with 0 reset in 347 ms.
Built C files in :
/tmp/ltsmin2033542648045720904
[2024-05-21 20:36:58] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 20:36:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:36:58] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 20:36:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:36:58] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 20:36:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:36:58] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2033542648045720904
Running compilation step : cd /tmp/ltsmin2033542648045720904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin2033542648045720904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2033542648045720904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6884151706813209003.hoa' '--buchi-type=spotba'
LTSmin run took 291 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-01 finished in 4321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 4 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 11 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2024-05-21 20:36:59] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 20:36:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:36:59] [INFO ] Invariant cache hit.
[2024-05-21 20:36:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:36:59] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-21 20:36:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:36:59] [INFO ] Invariant cache hit.
[2024-05-21 20:36:59] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 42/62 places, 43/63 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s22 1) (GEQ s21 1) (GEQ s24 1) (GEQ s23 1) (GEQ s26 1) (GEQ s25 1) (GEQ s28 1) (GEQ s27 1) (GEQ s30 1) (GEQ s29 1) (GEQ s32 1) (GEQ s31 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-02 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 42 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 20:36:59] [INFO ] Computed 0 invariants in 6 ms
[2024-05-21 20:36:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 20:36:59] [INFO ] Invariant cache hit.
[2024-05-21 20:36:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:36:59] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-21 20:36:59] [INFO ] Invariant cache hit.
[2024-05-21 20:36:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (LT s42 1) (LT s41 1) (LT s44 1) (LT s43 1) (LT s46 1) (LT s45 1) (LT s48 1) (LT s47 1) (LT s50 1) (LT s49 1) (LT s52 1) (LT s51 1) (LT s53 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 708 reset in 189 ms.
Product exploration explored 100000 steps with 704 reset in 186 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 2365 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1182 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-21 20:37:00] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-03 finished in 1350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:37:00] [INFO ] Invariant cache hit.
[2024-05-21 20:37:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:37:00] [INFO ] Invariant cache hit.
[2024-05-21 20:37:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:37:00] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-21 20:37:00] [INFO ] Invariant cache hit.
[2024-05-21 20:37:00] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, p0, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s42 1) (GEQ s41 1) (GEQ s44 1) (GEQ s43 1) (GEQ s46 1) (GEQ s45 1) (GEQ s48 1) (GEQ s47 1) (GEQ s50 1) (GEQ s49 1) (GEQ s52 1) (GEQ s51 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-04 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p1)||p0))))'
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:37:01] [INFO ] Invariant cache hit.
[2024-05-21 20:37:01] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:37:01] [INFO ] Invariant cache hit.
[2024-05-21 20:37:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:37:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-21 20:37:01] [INFO ] Invariant cache hit.
[2024-05-21 20:37:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s42 1) (GEQ s41 1) (GEQ s44 1) (GEQ s43 1) (GEQ s46 1) (GEQ s45 1) (GEQ s48 1) (GEQ s47 1) (GEQ s50 1) (GEQ s49 1) (GEQ s52 1) (GEQ s51 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 315 ms.
Product exploration explored 100000 steps with 0 reset in 333 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 170 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10063 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=670 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:37:02] [INFO ] Invariant cache hit.
[2024-05-21 20:37:02] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 339 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 136 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:37:03] [INFO ] Invariant cache hit.
[2024-05-21 20:37:03] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 20:37:03] [INFO ] Invariant cache hit.
[2024-05-21 20:37:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:37:03] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-21 20:37:03] [INFO ] Invariant cache hit.
[2024-05-21 20:37:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Finished random walk after 121 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=121 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 130 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 256 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 6 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
[2024-05-21 20:37:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 42 cols
[2024-05-21 20:37:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 20:37:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 42/62 places, 43/63 transitions.
Built C files in :
/tmp/ltsmin6337915729522730809
[2024-05-21 20:37:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6337915729522730809
Running compilation step : cd /tmp/ltsmin6337915729522730809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin6337915729522730809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6337915729522730809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2996627246664261439.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 20:37:20] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 20:37:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:37:20] [INFO ] Invariant cache hit.
[2024-05-21 20:37:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:37:20] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-21 20:37:20] [INFO ] Invariant cache hit.
[2024-05-21 20:37:20] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin3213224978104317317
[2024-05-21 20:37:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3213224978104317317
Running compilation step : cd /tmp/ltsmin3213224978104317317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 137 ms.
Running link step : cd /tmp/ltsmin3213224978104317317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3213224978104317317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14012884513343759097.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:37:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:37:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:37:35] [INFO ] Time to serialize gal into /tmp/LTL8493839080796695694.gal : 2 ms
[2024-05-21 20:37:35] [INFO ] Time to serialize properties into /tmp/LTL7304873279501436655.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8493839080796695694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7894005270249716225.hoa' '-atoms' '/tmp/LTL7304873279501436655.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7304873279501436655.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7894005270249716225.hoa
Detected timeout of ITS tools.
[2024-05-21 20:37:50] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:37:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:37:50] [INFO ] Time to serialize gal into /tmp/LTL14680437385047211887.gal : 2 ms
[2024-05-21 20:37:50] [INFO ] Time to serialize properties into /tmp/LTL14203897554949357569.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14680437385047211887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14203897554949357569.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((state_c1>=1)||(state_c0>=1))||((state_c11>=1)||(state_c10>=1)))||(((state_c13>=1)||(state_c12>=1))||((state_c15>=1)||(st...721
Formula 0 simplified : XF(!"(((((state_c1>=1)||(state_c0>=1))||((state_c11>=1)||(state_c10>=1)))||(((state_c13>=1)||(state_c12>=1))||((state_c15>=1)||(stat...711
Detected timeout of ITS tools.
[2024-05-21 20:38:05] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:38:05] [INFO ] Applying decomposition
[2024-05-21 20:38:05] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5434657337458156656.txt' '-o' '/tmp/graph5434657337458156656.bin' '-w' '/tmp/graph5434657337458156656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5434657337458156656.bin' '-l' '-1' '-v' '-w' '/tmp/graph5434657337458156656.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:38:05] [INFO ] Decomposing Gal with order
[2024-05-21 20:38:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:38:05] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-21 20:38:05] [INFO ] Flatten gal took : 33 ms
[2024-05-21 20:38:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-21 20:38:05] [INFO ] Time to serialize gal into /tmp/LTL11886490651429246100.gal : 2 ms
[2024-05-21 20:38:05] [INFO ] Time to serialize properties into /tmp/LTL12668296078578451171.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11886490651429246100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12668296078578451171.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((i4.u18.state_c1>=1)||(i4.u18.state_c0>=1))||((i5.u19.state_c11>=1)||(i5.u19.state_c10>=1)))||(((i5.u20.state_c13>=1)||(i...1001
Formula 0 simplified : XF(!"(((((i4.u18.state_c1>=1)||(i4.u18.state_c0>=1))||((i5.u19.state_c11>=1)||(i5.u19.state_c10>=1)))||(((i5.u20.state_c13>=1)||(i5....991
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16819473592644044527
[2024-05-21 20:38:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16819473592644044527
Running compilation step : cd /tmp/ltsmin16819473592644044527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin16819473592644044527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16819473592644044527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-05 finished in 94738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 22 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 10 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:35] [INFO ] Invariant cache hit.
[2024-05-21 20:38:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:38:35] [INFO ] Invariant cache hit.
[2024-05-21 20:38:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:35] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-21 20:38:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:38:35] [INFO ] Invariant cache hit.
[2024-05-21 20:38:35] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND (NOT p2) p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s42 1) (GEQ s41 1) (GEQ s44 1) (GEQ s43 1) (GEQ s46 1) (GEQ s45 1) (GEQ s48 1) (GEQ s47 1) (GEQ s50 1) (GEQ s49 1) (GEQ s52 1) (GEQ s51 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1260 reset in 123 ms.
Product exploration explored 100000 steps with 1230 reset in 127 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Finished random walk after 1434 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=478 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 395 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
[2024-05-21 20:38:37] [INFO ] Invariant cache hit.
[2024-05-21 20:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 20:38:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:37] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-21 20:38:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2024-05-21 20:38:37] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 20:38:37] [INFO ] Added : 49 causal constraints over 10 iterations in 95 ms. Result :sat
Could not prove EG p0
[2024-05-21 20:38:37] [INFO ] Invariant cache hit.
[2024-05-21 20:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:37] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 20:38:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 20:38:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:38:37] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 20:38:37] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 22 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:37] [INFO ] Invariant cache hit.
[2024-05-21 20:38:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 20:38:37] [INFO ] Invariant cache hit.
[2024-05-21 20:38:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-21 20:38:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:38:37] [INFO ] Invariant cache hit.
[2024-05-21 20:38:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Finished random walk after 1232 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=308 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 337 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
[2024-05-21 20:38:38] [INFO ] Invariant cache hit.
[2024-05-21 20:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:39] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 20:38:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:39] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 20:38:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:38:39] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 20:38:39] [INFO ] Added : 49 causal constraints over 10 iterations in 78 ms. Result :sat
Could not prove EG p0
[2024-05-21 20:38:39] [INFO ] Invariant cache hit.
[2024-05-21 20:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:39] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 20:38:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:39] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:38:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:38:39] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 20:38:39] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 115 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1198 reset in 124 ms.
Product exploration explored 100000 steps with 1197 reset in 124 ms.
Built C files in :
/tmp/ltsmin7447704813653987154
[2024-05-21 20:38:39] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 20:38:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:39] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 20:38:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:39] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 20:38:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7447704813653987154
Running compilation step : cd /tmp/ltsmin7447704813653987154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 161 ms.
Running link step : cd /tmp/ltsmin7447704813653987154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7447704813653987154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4006781362383011637.hoa' '--buchi-type=spotba'
LTSmin run took 180 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-07 finished in 4293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:40] [INFO ] Invariant cache hit.
[2024-05-21 20:38:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 20:38:40] [INFO ] Invariant cache hit.
[2024-05-21 20:38:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-21 20:38:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:38:40] [INFO ] Invariant cache hit.
[2024-05-21 20:38:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s7 1), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 175 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1430 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=357 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:41] [INFO ] Invariant cache hit.
[2024-05-21 20:38:41] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 20:38:41] [INFO ] Invariant cache hit.
[2024-05-21 20:38:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:41] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 20:38:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:38:41] [INFO ] Invariant cache hit.
[2024-05-21 20:38:41] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1558 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=519 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 0 reset in 249 ms.
Built C files in :
/tmp/ltsmin3668322502391580769
[2024-05-21 20:38:42] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 20:38:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:42] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 20:38:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:42] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 20:38:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:42] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3668322502391580769
Running compilation step : cd /tmp/ltsmin3668322502391580769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin3668322502391580769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3668322502391580769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8981551459987834085.hoa' '--buchi-type=spotba'
LTSmin run took 95 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-08 finished in 2733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p0))||(p1&&F(G(p2)))))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:42] [INFO ] Invariant cache hit.
[2024-05-21 20:38:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 20:38:42] [INFO ] Invariant cache hit.
[2024-05-21 20:38:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:42] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-21 20:38:42] [INFO ] Invariant cache hit.
[2024-05-21 20:38:42] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GEQ s51 1), p1:(GEQ s54 1), p2:(AND (GEQ s0 1) (GEQ s41 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 180 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 119 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-05-21 20:38:43] [INFO ] Invariant cache hit.
[2024-05-21 20:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:44] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:38:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:44] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 20:38:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:44] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:38:44] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 20:38:44] [INFO ] Added : 49 causal constraints over 10 iterations in 73 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:44] [INFO ] Invariant cache hit.
[2024-05-21 20:38:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 20:38:44] [INFO ] Invariant cache hit.
[2024-05-21 20:38:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:44] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-21 20:38:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:38:44] [INFO ] Invariant cache hit.
[2024-05-21 20:38:44] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 119 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-21 20:38:44] [INFO ] Invariant cache hit.
[2024-05-21 20:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 20:38:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:44] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 20:38:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:44] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-05-21 20:38:44] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 20:38:44] [INFO ] Added : 49 causal constraints over 10 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 160 ms.
Built C files in :
/tmp/ltsmin13119073573170346662
[2024-05-21 20:38:45] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 20:38:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:45] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 20:38:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:45] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 20:38:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13119073573170346662
Running compilation step : cd /tmp/ltsmin13119073573170346662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin13119073573170346662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13119073573170346662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6457900276906647370.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-10 finished in 2765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (G((p0||F(p1)))||((p0||F(p1))&&G(!p0)))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:45] [INFO ] Invariant cache hit.
[2024-05-21 20:38:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 20:38:45] [INFO ] Invariant cache hit.
[2024-05-21 20:38:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-21 20:38:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:38:45] [INFO ] Invariant cache hit.
[2024-05-21 20:38:45] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s0 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5705 reset in 120 ms.
Product exploration explored 100000 steps with 14931 reset in 84 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Finished random walk after 1448 steps, including 1 resets, run visited all 4 properties in 4 ms. (steps per millisecond=362 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p1) p0)), (F p0), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 329 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:47] [INFO ] Invariant cache hit.
[2024-05-21 20:38:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 20:38:47] [INFO ] Invariant cache hit.
[2024-05-21 20:38:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:47] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-21 20:38:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:38:47] [INFO ] Invariant cache hit.
[2024-05-21 20:38:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Finished random walk after 1333 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=444 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p1) p0)), (F p0), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 426 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1776 reset in 137 ms.
Product exploration explored 100000 steps with 5600 reset in 133 ms.
Built C files in :
/tmp/ltsmin12236497617089689806
[2024-05-21 20:38:49] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 20:38:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:49] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 20:38:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:49] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 20:38:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12236497617089689806
Running compilation step : cd /tmp/ltsmin12236497617089689806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin12236497617089689806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12236497617089689806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4839390787432097168.hoa' '--buchi-type=spotba'
LTSmin run took 104 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-11 finished in 3841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:49] [INFO ] Invariant cache hit.
[2024-05-21 20:38:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 20:38:49] [INFO ] Invariant cache hit.
[2024-05-21 20:38:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-21 20:38:49] [INFO ] Invariant cache hit.
[2024-05-21 20:38:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3 reset in 136 ms.
Product exploration explored 100000 steps with 4 reset in 154 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 219 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:50] [INFO ] Invariant cache hit.
[2024-05-21 20:38:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 20:38:50] [INFO ] Invariant cache hit.
[2024-05-21 20:38:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:50] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-21 20:38:50] [INFO ] Invariant cache hit.
[2024-05-21 20:38:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 0 reset in 193 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:38:51] [INFO ] Invariant cache hit.
[2024-05-21 20:38:51] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin4763851579576954768
[2024-05-21 20:38:51] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4763851579576954768
Running compilation step : cd /tmp/ltsmin4763851579576954768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin4763851579576954768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4763851579576954768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4953718709527414509.hoa' '--buchi-type=spotba'
LTSmin run took 3697 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-12 finished in 6283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:55] [INFO ] Invariant cache hit.
[2024-05-21 20:38:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 20:38:55] [INFO ] Invariant cache hit.
[2024-05-21 20:38:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:55] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-21 20:38:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:38:55] [INFO ] Invariant cache hit.
[2024-05-21 20:38:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21541 reset in 73 ms.
Product exploration explored 100000 steps with 21280 reset in 79 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
[2024-05-21 20:38:56] [INFO ] Invariant cache hit.
[2024-05-21 20:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 20:38:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:56] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 20:38:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:56] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:38:56] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 20:38:56] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:38:56] [INFO ] Invariant cache hit.
[2024-05-21 20:38:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 20:38:56] [INFO ] Invariant cache hit.
[2024-05-21 20:38:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:56] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-21 20:38:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:38:56] [INFO ] Invariant cache hit.
[2024-05-21 20:38:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 245 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 27 ms :[p0]
[2024-05-21 20:38:57] [INFO ] Invariant cache hit.
[2024-05-21 20:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:38:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:38:57] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 20:38:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:38:57] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 20:38:57] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 52 ms :[p0]
Product exploration explored 100000 steps with 21436 reset in 72 ms.
Product exploration explored 100000 steps with 21356 reset in 78 ms.
Built C files in :
/tmp/ltsmin6269295311508444026
[2024-05-21 20:38:57] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 20:38:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:57] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 20:38:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:57] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 20:38:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:38:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6269295311508444026
Running compilation step : cd /tmp/ltsmin6269295311508444026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin6269295311508444026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6269295311508444026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3937954605045023821.hoa' '--buchi-type=spotba'
LTSmin run took 248 ms.
FORMULA CryptoMiner-PT-D20N100-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-13 finished in 2416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p1)||p0))))'
Found a Lengthening insensitive property : CryptoMiner-PT-D20N100-LTLFireability-05
Stuttering acceptance computed with spot in 116 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 4 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2024-05-21 20:38:58] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 20:38:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 20:38:58] [INFO ] Invariant cache hit.
[2024-05-21 20:38:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:38:58] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-21 20:38:58] [INFO ] Invariant cache hit.
[2024-05-21 20:38:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 112 ms. Remains : 42/62 places, 43/63 transitions.
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s22 1) (GEQ s21 1) (GEQ s24 1) (GEQ s23 1) (GEQ s26 1) (GEQ s25 1) (GEQ s28 1) (GEQ s27 1) (GEQ s30 1) (GEQ s29 1) (GEQ s32 1) (GEQ s31 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 305 ms.
Product exploration explored 100000 steps with 0 reset in 268 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Graph (complete) has 142 edges and 42 vertex of which 1 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/42 stabilizing places and 42/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 159 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 146 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 332 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:38:59] [INFO ] Invariant cache hit.
[2024-05-21 20:38:59] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 121 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-21 20:38:59] [INFO ] Invariant cache hit.
[2024-05-21 20:38:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 20:38:59] [INFO ] Invariant cache hit.
[2024-05-21 20:39:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:39:00] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-21 20:39:00] [INFO ] Invariant cache hit.
[2024-05-21 20:39:00] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 42/42 places, 43/43 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Graph (complete) has 142 edges and 42 vertex of which 1 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/42 stabilizing places and 42/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Finished random walk after 20 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 134 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 134 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 166 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 43/43 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-21 20:39:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:39:01] [INFO ] Invariant cache hit.
[2024-05-21 20:39:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 42/42 places, 43/43 transitions.
Built C files in :
/tmp/ltsmin13356479033785972329
[2024-05-21 20:39:01] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13356479033785972329
Running compilation step : cd /tmp/ltsmin13356479033785972329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 115 ms.
Running link step : cd /tmp/ltsmin13356479033785972329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13356479033785972329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15924505727292241338.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 43/43 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-21 20:39:16] [INFO ] Invariant cache hit.
[2024-05-21 20:39:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 20:39:16] [INFO ] Invariant cache hit.
[2024-05-21 20:39:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:39:16] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-21 20:39:16] [INFO ] Invariant cache hit.
[2024-05-21 20:39:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 42/42 places, 43/43 transitions.
Built C files in :
/tmp/ltsmin1560729034839113111
[2024-05-21 20:39:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1560729034839113111
Running compilation step : cd /tmp/ltsmin1560729034839113111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin1560729034839113111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1560729034839113111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7484820760919076608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:39:31] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:39:31] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:39:31] [INFO ] Time to serialize gal into /tmp/LTL11920330312274844489.gal : 2 ms
[2024-05-21 20:39:31] [INFO ] Time to serialize properties into /tmp/LTL5265240522502602232.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11920330312274844489.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7416156670012583874.hoa' '-atoms' '/tmp/LTL5265240522502602232.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5265240522502602232.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7416156670012583874.hoa
Reverse transition relation is NOT exact ! Due to transitions t12, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...270
Computing Next relation with stutter on 1.07042e+08 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
492 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.94756,128836,1,0,351,468118,110,301,1747,678090,727
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property CryptoMiner-PT-D20N100-LTLFireability-05 finished in 39185 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-21 20:39:37] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7657399664392253176
[2024-05-21 20:39:37] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 20:39:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:39:37] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 20:39:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:39:37] [INFO ] Applying decomposition
[2024-05-21 20:39:37] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 20:39:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:39:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7657399664392253176
Running compilation step : cd /tmp/ltsmin7657399664392253176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 20:39:37] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2893371516626289664.txt' '-o' '/tmp/graph2893371516626289664.bin' '-w' '/tmp/graph2893371516626289664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2893371516626289664.bin' '-l' '-1' '-v' '-w' '/tmp/graph2893371516626289664.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:39:37] [INFO ] Decomposing Gal with order
[2024-05-21 20:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:39:37] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 20:39:37] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 20:39:37] [INFO ] Time to serialize gal into /tmp/LTLFireability10769793144351563705.gal : 1 ms
[2024-05-21 20:39:37] [INFO ] Time to serialize properties into /tmp/LTLFireability3965351819458353259.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10769793144351563705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3965351819458353259.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((i3.i1.u18.state_c1>=1)||(i3.i1.u18.state_c0>=1))||((i5.u20.state_c11>=1)||(i5.u19.state_c10>=1)))||(((i5.u20.state_c13>=...1048
Formula 0 simplified : XF(!"(((((i3.i1.u18.state_c1>=1)||(i3.i1.u18.state_c0>=1))||((i5.u20.state_c11>=1)||(i5.u19.state_c10>=1)))||(((i5.u20.state_c13>=1)...1034
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin7657399664392253176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin7657399664392253176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: LTL layer: formula: X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 6/ 8), 0.001: "X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.060: DFS-FIFO for weak LTL, using special progress label 66
pins2lts-mc-linux64( 0/ 8), 0.060: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 63, there are 70 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.066: ~1 levels ~960 states ~3232 transitions
pins2lts-mc-linux64( 7/ 8), 0.083: ~1 levels ~1920 states ~6824 transitions
pins2lts-mc-linux64( 7/ 8), 0.105: ~1 levels ~3840 states ~14232 transitions
pins2lts-mc-linux64( 7/ 8), 0.132: ~1 levels ~7680 states ~30816 transitions
pins2lts-mc-linux64( 7/ 8), 0.182: ~1 levels ~15360 states ~61760 transitions
pins2lts-mc-linux64( 7/ 8), 0.333: ~1 levels ~30720 states ~130512 transitions
pins2lts-mc-linux64( 7/ 8), 0.571: ~1 levels ~61440 states ~267416 transitions
pins2lts-mc-linux64( 1/ 8), 1.024: ~1 levels ~122880 states ~535896 transitions
pins2lts-mc-linux64( 1/ 8), 1.657: ~1 levels ~245760 states ~1120176 transitions
pins2lts-mc-linux64( 1/ 8), 2.517: ~1 levels ~491520 states ~2348232 transitions
pins2lts-mc-linux64( 2/ 8), 3.587: ~1 levels ~983040 states ~4323800 transitions
pins2lts-mc-linux64( 2/ 8), 5.307: ~1 levels ~1966080 states ~8857216 transitions
pins2lts-mc-linux64( 2/ 8), 8.809: ~1 levels ~3932160 states ~18061728 transitions
pins2lts-mc-linux64( 2/ 8), 15.878: ~1 levels ~7864320 states ~37609008 transitions
pins2lts-mc-linux64( 2/ 8), 30.188: ~1 levels ~15728640 states ~77808696 transitions
pins2lts-mc-linux64( 2/ 8), 60.351: ~1 levels ~31457280 states ~159914680 transitions
pins2lts-mc-linux64( 2/ 8), 121.827: ~1 levels ~62914560 states ~328577480 transitions
pins2lts-mc-linux64( 5/ 8), 271.359: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 271.394:
pins2lts-mc-linux64( 0/ 8), 271.394: mean standard work distribution: 7.5% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 271.394:
pins2lts-mc-linux64( 0/ 8), 271.394: Explored 108708979 states 688991026 transitions, fanout: 6.338
pins2lts-mc-linux64( 0/ 8), 271.394: Total exploration time 271.320 sec (271.280 sec minimum, 271.294 sec on average)
pins2lts-mc-linux64( 0/ 8), 271.394: States per second: 400667, Transitions per second: 2539404
pins2lts-mc-linux64( 0/ 8), 271.394:
pins2lts-mc-linux64( 0/ 8), 271.394: Progress states detected: 134217285
pins2lts-mc-linux64( 0/ 8), 271.394: Redundant explorations: -19.0053
pins2lts-mc-linux64( 0/ 8), 271.394:
pins2lts-mc-linux64( 0/ 8), 271.394: Queue width: 8B, total height: 48311008, memory: 368.58MB
pins2lts-mc-linux64( 0/ 8), 271.394: Tree memory: 1182.8MB, 9.2 B/state, compr.: 3.6%
pins2lts-mc-linux64( 0/ 8), 271.394: Tree fill ratio (roots/leafs): 99.0%/62.0%
pins2lts-mc-linux64( 0/ 8), 271.394: Stored 63 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 271.394: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 271.394: Est. total memory use: 1551.4MB (~1392.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7657399664392253176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7657399664392253176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 21:00:31] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:00:31] [INFO ] Time to serialize gal into /tmp/LTLFireability7280232602272626377.gal : 1 ms
[2024-05-21 21:00:31] [INFO ] Time to serialize properties into /tmp/LTLFireability811412298462606562.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7280232602272626377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability811412298462606562.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((state_c1>=1)||(state_c0>=1))||((state_c11>=1)||(state_c10>=1)))||(((state_c13>=1)||(state_c12>=1))||((state_c15>=1)||(st...744
Formula 0 simplified : XF(!"(((((state_c1>=1)||(state_c0>=1))||((state_c11>=1)||(state_c10>=1)))||(((state_c13>=1)||(state_c12>=1))||((state_c15>=1)||(stat...730
Reverse transition relation is NOT exact ! Due to transitions t12, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...270
Computing Next relation with stutter on 1.07042e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:21:25] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:21:25] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-21 21:21:25] [INFO ] Transformed 62 places.
[2024-05-21 21:21:25] [INFO ] Transformed 63 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 21:21:25] [INFO ] Time to serialize gal into /tmp/LTLFireability6734518071609180665.gal : 1 ms
[2024-05-21 21:21:25] [INFO ] Time to serialize properties into /tmp/LTLFireability6656063723080675741.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6734518071609180665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6656063723080675741.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("(((((state_c1>=1)||(state_c0>=1))||((state_c11>=1)||(state_c10>=1)))||(((state_c13>=1)||(state_c12>=1))||((state_c15>=1)||(st...744
Formula 0 simplified : XF(!"(((((state_c1>=1)||(state_c0>=1))||((state_c11>=1)||(state_c10>=1)))||(((state_c13>=1)||(state_c12>=1))||((state_c15>=1)||(stat...730
Reverse transition relation is NOT exact ! Due to transitions t12, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38...270
Computing Next relation with stutter on 1.07042e+08 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12232908 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16040664 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D20N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CryptoMiner-PT-D20N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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