Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678515861985

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 06:24:25] [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]
[2023-03-11 06:24:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:24:25] [INFO ] Load time of PNML (sax parser for PT used): 354 ms
[2023-03-11 06:24:25] [INFO ] Transformed 5304 places.
[2023-03-11 06:24:25] [INFO ] Transformed 4998 transitions.
[2023-03-11 06:24:25] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 557 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1508 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:24:29] [INFO ] Invariants computation overflowed in 274 ms
[2023-03-11 06:24:30] [INFO ] Implicit Places using invariants in 1397 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:24:30] [INFO ] Invariants computation overflowed in 207 ms
[2023-03-11 06:24:32] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 3243 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:24:32] [INFO ] Invariants computation overflowed in 240 ms
[2023-03-11 06:24:33] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6056 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 45 out of 5300 places after structural reductions.
[2023-03-11 06:24:34] [INFO ] Flatten gal took : 484 ms
[2023-03-11 06:24:34] [INFO ] Flatten gal took : 309 ms
[2023-03-11 06:24:35] [INFO ] Input system was already deterministic with 4998 transitions.
Support contains 42 out of 5300 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 737 ms. (steps per millisecond=13 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 35527 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35527 steps, saw 17768 distinct states, run finished after 3003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:24:41] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-11 06:25:06] [INFO ] After 18601ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27 real:1
[2023-03-11 06:25:06] [INFO ] After 18619ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :27 real:1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 06:25:06] [INFO ] After 25073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :27 real:1
[2023-03-11 06:25:31] [INFO ] After 17368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-11 06:25:31] [INFO ] After 17372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 06:25:31] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1152 transitions
Trivial Post-agglo rules discarded 1152 transitions
Performed 1152 trivial Post agglomeration. Transition count delta: 1152
Iterating post reduction 0 with 1155 rules applied. Total rules applied 1156 place count 5297 transition count 3844
Reduce places removed 1152 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 1166 rules applied. Total rules applied 2322 place count 4145 transition count 3830
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 2336 place count 4131 transition count 3830
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 2336 place count 4131 transition count 3627
Deduced a syphon composed of 203 places in 405 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 2742 place count 3928 transition count 3627
Performed 886 Post agglomeration using F-continuation condition.Transition count delta: 886
Deduced a syphon composed of 886 places in 103 ms
Reduce places removed 886 places and 0 transitions.
Iterating global reduction 3 with 1772 rules applied. Total rules applied 4514 place count 3042 transition count 2741
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 282 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4716 place count 2941 transition count 2741
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 98 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 4902 place count 2848 transition count 2741
Free-agglomeration rule (complex) applied 401 times.
Iterating global reduction 3 with 401 rules applied. Total rules applied 5303 place count 2848 transition count 2340
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 3 with 401 rules applied. Total rules applied 5704 place count 2447 transition count 2340
Partial Free-agglomeration rule applied 405 times.
Drop transitions removed 405 transitions
Iterating global reduction 4 with 405 rules applied. Total rules applied 6109 place count 2447 transition count 2340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6110 place count 2446 transition count 2339
Applied a total of 6110 rules in 3596 ms. Remains 2446 /5300 variables (removed 2854) and now considering 2339/4998 (removed 2659) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3598 ms. Remains : 2446/5300 places, 2339/4998 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 55503 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55503 steps, saw 27795 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-11 06:25:39] [INFO ] Invariants computation overflowed in 45 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:26:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:26:05] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 2446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2446/2446 places, 2339/2339 transitions.
Applied a total of 0 rules in 335 ms. Remains 2446 /2446 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 2446/2446 places, 2339/2339 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2446/2446 places, 2339/2339 transitions.
Applied a total of 0 rules in 322 ms. Remains 2446 /2446 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-11 06:26:05] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-11 06:26:17] [INFO ] Implicit Places using invariants in 11750 ms returned []
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-11 06:26:17] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-11 06:26:30] [INFO ] Implicit Places using invariants and state equation in 12880 ms returned []
Implicit Place search using SMT with State Equation took 24639 ms to find 0 implicit places.
[2023-03-11 06:26:30] [INFO ] Redundant transitions in 301 ms returned []
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-11 06:26:30] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-11 06:26:33] [INFO ] Dead Transitions using invariants and state equation in 3038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28314 ms. Remains : 2446/2446 places, 2339/2339 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.73 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(G(p1)||(p1&&F(p2)))))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1186 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:26:35] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-11 06:26:35] [INFO ] Implicit Places using invariants in 825 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:26:36] [INFO ] Invariants computation overflowed in 180 ms
[2023-03-11 06:26:37] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:26:37] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-11 06:26:38] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4625 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s3932 1), p1:(GEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-01 finished in 5555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0)) U p1)) U X(X(p2))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1155 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:26:40] [INFO ] Invariants computation overflowed in 110 ms
[2023-03-11 06:26:41] [INFO ] Implicit Places using invariants in 1079 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:26:41] [INFO ] Invariants computation overflowed in 120 ms
[2023-03-11 06:26:43] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2891 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:26:43] [INFO ] Invariants computation overflowed in 109 ms
[2023-03-11 06:26:44] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4803 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 455 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 7}, { cond=(NOT p2), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 7}, { cond=true, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s234 1) (GEQ s304 1)), p2:(GEQ s5037 1), p0:(AND (GEQ s2309 1) (GEQ s2317 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-02 finished in 5797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Support contains 7 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1190 transitions
Trivial Post-agglo rules discarded 1190 transitions
Performed 1190 trivial Post agglomeration. Transition count delta: 1190
Iterating post reduction 0 with 1190 rules applied. Total rules applied 1190 place count 5299 transition count 3807
Reduce places removed 1190 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2384 place count 4109 transition count 3803
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2388 place count 4105 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3602
Deduced a syphon composed of 201 places in 379 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 94 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 90 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 66 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2804 transition count 2700
Applied a total of 4989 rules in 2443 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:26:47] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-11 06:26:50] [INFO ] Implicit Places using invariants in 3152 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:26:50] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-11 06:26:55] [INFO ] Implicit Places using invariants and state equation in 4800 ms returned []
Implicit Place search using SMT with State Equation took 7961 ms to find 0 implicit places.
[2023-03-11 06:26:55] [INFO ] Redundant transitions in 297 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:26:56] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-11 06:26:59] [INFO ] Dead Transitions using invariants and state equation in 3596 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14311 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1541 1), p1:(AND (GEQ s372 1) (GEQ s416 1)), p2:(AND (GEQ s632 1) (GEQ s639 1)), p3:(OR (LT s4 1) (LT s2764 1))], 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 13896 reset in 607 ms.
Product exploration explored 100000 steps with 13843 reset in 365 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p0 (NOT p1))), (X p0), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 784 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 785 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 64266 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64266 steps, saw 32141 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:27:05] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-11 06:27:30] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:27:55] [INFO ] After 23854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 06:27:55] [INFO ] State equation strengthened by 196 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:27:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:27:55] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 62 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 1039 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1040 ms. Remains : 2406/2804 places, 2302/2700 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 68826 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68826 steps, saw 34432 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-11 06:28:00] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-11 06:28:08] [INFO ] After 7249ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 06:28:08] [INFO ] State equation strengthened by 397 read => feed constraints.
[2023-03-11 06:28:17] [INFO ] After 9205ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:28:17] [INFO ] After 17188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:28:42] [INFO ] After 24407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:28:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:28:42] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1858 ms.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 216 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 231 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-11 06:28:45] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-11 06:28:59] [INFO ] Implicit Places using invariants in 14392 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-11 06:28:59] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-11 06:29:15] [INFO ] Implicit Places using invariants and state equation in 15513 ms returned []
Implicit Place search using SMT with State Equation took 29912 ms to find 0 implicit places.
[2023-03-11 06:29:15] [INFO ] Redundant transitions in 125 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-11 06:29:15] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-11 06:29:17] [INFO ] Dead Transitions using invariants and state equation in 2713 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32991 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p0 (NOT p1))), (X p0), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 575 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 336 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:29:19] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-11 06:29:22] [INFO ] Implicit Places using invariants in 3662 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:29:22] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-11 06:29:26] [INFO ] Implicit Places using invariants and state equation in 4055 ms returned []
Implicit Place search using SMT with State Equation took 7722 ms to find 0 implicit places.
[2023-03-11 06:29:27] [INFO ] Redundant transitions in 130 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:29:27] [INFO ] Invariants computation overflowed in 106 ms
[2023-03-11 06:29:30] [INFO ] Dead Transitions using invariants and state equation in 3039 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11245 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p1) p0)), (X p0), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 455 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1377 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 806 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 62171 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62171 steps, saw 31093 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:29:35] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-11 06:30:00] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:30:25] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 71 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 813 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 2406/2804 places, 2302/2700 transitions.
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71232 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71232 steps, saw 35626 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-11 06:30:29] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-11 06:30:37] [INFO ] After 7230ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 06:30:37] [INFO ] State equation strengthened by 397 read => feed constraints.
[2023-03-11 06:30:46] [INFO ] After 9343ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:30:46] [INFO ] After 17123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 06:31:11] [INFO ] After 24188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:31:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:31:11] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1775 ms.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 216 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 215 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-11 06:31:14] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-11 06:31:34] [INFO ] Implicit Places using invariants in 20493 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-11 06:31:34] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-11 06:31:35] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 21579 ms to find 0 implicit places.
[2023-03-11 06:31:35] [INFO ] Redundant transitions in 146 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-11 06:31:35] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-11 06:31:39] [INFO ] Dead Transitions using invariants and state equation in 4031 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25982 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p1) p0)), (X p0), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 933 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 13935 reset in 428 ms.
Product exploration explored 100000 steps with 13914 reset in 443 ms.
Built C files in :
/tmp/ltsmin5083910305982051209
[2023-03-11 06:31:42] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:31:42] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5083910305982051209
Running compilation step : cd /tmp/ltsmin5083910305982051209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5083910305982051209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5083910305982051209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 222 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:31:45] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-11 06:31:49] [INFO ] Implicit Places using invariants in 3745 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:31:49] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-11 06:31:54] [INFO ] Implicit Places using invariants and state equation in 5004 ms returned []
Implicit Place search using SMT with State Equation took 8753 ms to find 0 implicit places.
[2023-03-11 06:31:54] [INFO ] Redundant transitions in 138 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-11 06:31:54] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-11 06:31:57] [INFO ] Dead Transitions using invariants and state equation in 3272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12393 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Built C files in :
/tmp/ltsmin12322257662237371784
[2023-03-11 06:31:57] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:31:57] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12322257662237371784
Running compilation step : cd /tmp/ltsmin12322257662237371784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12322257662237371784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12322257662237371784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 06:32:01] [INFO ] Flatten gal took : 128 ms
[2023-03-11 06:32:01] [INFO ] Flatten gal took : 129 ms
[2023-03-11 06:32:01] [INFO ] Time to serialize gal into /tmp/LTL11804708005955856885.gal : 33 ms
[2023-03-11 06:32:01] [INFO ] Time to serialize properties into /tmp/LTL6548388216736778086.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11804708005955856885.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12700067370954561019.hoa' '-atoms' '/tmp/LTL6548388216736778086.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6548388216736778086.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12700067370954561019.hoa
Detected timeout of ITS tools.
[2023-03-11 06:32:17] [INFO ] Flatten gal took : 180 ms
[2023-03-11 06:32:17] [INFO ] Flatten gal took : 165 ms
[2023-03-11 06:32:17] [INFO ] Time to serialize gal into /tmp/LTL10663557385389895968.gal : 22 ms
[2023-03-11 06:32:17] [INFO ] Time to serialize properties into /tmp/LTL5376080469137970513.ltl : 2 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10663557385389895968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5376080469137970513.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p3613<1)")&&((X(F(("((p2069>=1)&&(p2075>=1))")||(G("((p1005<1)||(p932<1))")))))||("((p1626>=1)&&(p1696>=1))")))))
Formula 0 simplified : F(!"(p3613<1)" | (!"((p1626>=1)&&(p1696>=1))" & XG(!"((p2069>=1)&&(p2075>=1))" & F!"((p1005<1)||(p932<1))")))
Detected timeout of ITS tools.
[2023-03-11 06:32:32] [INFO ] Flatten gal took : 113 ms
[2023-03-11 06:32:32] [INFO ] Applying decomposition
[2023-03-11 06:32:32] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8300256252112118781.txt' '-o' '/tmp/graph8300256252112118781.bin' '-w' '/tmp/graph8300256252112118781.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8300256252112118781.bin' '-l' '-1' '-v' '-w' '/tmp/graph8300256252112118781.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:32:32] [INFO ] Decomposing Gal with order
[2023-03-11 06:32:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:32:33] [INFO ] Removed a total of 2076 redundant transitions.
[2023-03-11 06:32:34] [INFO ] Flatten gal took : 473 ms
[2023-03-11 06:32:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 146 ms.
[2023-03-11 06:32:34] [INFO ] Time to serialize gal into /tmp/LTL5521910382487002914.gal : 50 ms
[2023-03-11 06:32:34] [INFO ] Time to serialize properties into /tmp/LTL17248457166285611169.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5521910382487002914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17248457166285611169.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i13.u577.p3613<1)")&&((X(F(("((i4.u244.p2069>=1)&&(i4.u235.p2075>=1))")||(G("((i21.i0.i2.u1.p1005<1)||(i21.i0.i1.u1013.p932<1)...212
Formula 0 simplified : F(!"(i13.u577.p3613<1)" | (!"((i1.u147.p1626>=1)&&(i1.u159.p1696>=1))" & XG(!"((i4.u244.p2069>=1)&&(i4.u235.p2075>=1))" & F!"((i21.i...202
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18069797565078713310
[2023-03-11 06:32:49] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18069797565078713310
Running compilation step : cd /tmp/ltsmin18069797565078713310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18069797565078713310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18069797565078713310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLFireability-04 finished in 367305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(p2))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 373 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 154 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 106 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 70 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4992 place count 2803 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4993 place count 2802 transition count 2698
Applied a total of 4993 rules in 2343 ms. Remains 2802 /5300 variables (removed 2498) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-11 06:32:54] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-11 06:32:58] [INFO ] Implicit Places using invariants in 3201 ms returned []
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-11 06:32:58] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-11 06:32:59] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 4229 ms to find 0 implicit places.
[2023-03-11 06:32:59] [INFO ] Redundant transitions in 159 ms returned []
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-11 06:32:59] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-11 06:33:02] [INFO ] Dead Transitions using invariants and state equation in 3346 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2802/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10086 ms. Remains : 2802/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s2629 1), p0:(GEQ s917 1), p2:(GEQ s411 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-05 finished in 10245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 378 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 140 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4604 place count 2997 transition count 2695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 70 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4806 place count 2896 transition count 2695
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 64 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5000 place count 2799 transition count 2695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5001 place count 2798 transition count 2694
Applied a total of 5001 rules in 2331 ms. Remains 2798 /5300 variables (removed 2502) and now considering 2694/4998 (removed 2304) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:33:05] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-11 06:33:08] [INFO ] Implicit Places using invariants in 3132 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:33:08] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-11 06:33:12] [INFO ] Implicit Places using invariants and state equation in 4134 ms returned []
Implicit Place search using SMT with State Equation took 7271 ms to find 0 implicit places.
[2023-03-11 06:33:12] [INFO ] Redundant transitions in 134 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:33:12] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:33:15] [INFO ] Dead Transitions using invariants and state equation in 2737 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2798/5300 places, 2694/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12481 ms. Remains : 2798/5300 places, 2694/4998 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-06 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:(LT s452 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13849 reset in 314 ms.
Product exploration explored 100000 steps with 13847 reset in 402 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1357 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86027 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86027 steps, saw 43019 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:33:19] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 06:33:22] [INFO ] After 2512ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 06:33:22] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-11 06:33:31] [INFO ] After 9247ms SMT Verify possible using 198 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-11 06:33:31] [INFO ] After 12219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8471 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 64 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1197 place count 2399 transition count 2295
Applied a total of 1197 rules in 1083 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1083 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91065 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91065 steps, saw 45572 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-11 06:33:36] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 06:33:48] [INFO ] After 12221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 273 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 378 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-11 06:33:49] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-11 06:34:19] [INFO ] Performed 1941/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 06:34:24] [INFO ] Implicit Places using invariants in 35235 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-11 06:34:24] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 06:34:53] [INFO ] Implicit Places using invariants and state equation in 28892 ms returned []
Implicit Place search using SMT with State Equation took 64131 ms to find 0 implicit places.
[2023-03-11 06:34:53] [INFO ] Redundant transitions in 155 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-11 06:34:53] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-11 06:34:56] [INFO ] Dead Transitions using invariants and state equation in 2798 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67476 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 200 places in 112 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2199 transition count 2095
Applied a total of 400 rules in 475 ms. Remains 2199 /2399 variables (removed 200) and now considering 2095/2295 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2199 cols
[2023-03-11 06:34:56] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-11 06:34:59] [INFO ] After 1922ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 06:35:03] [INFO ] Deduced a trap composed of 5 places in 4294 ms of which 3 ms to minimize.
[2023-03-11 06:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4677 ms
[2023-03-11 06:35:03] [INFO ] After 6701ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:35:03] [INFO ] After 7072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:35:06] [INFO ] After 2145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:35:10] [INFO ] Deduced a trap composed of 5 places in 4180 ms of which 3 ms to minimize.
[2023-03-11 06:35:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4580 ms
[2023-03-11 06:35:11] [INFO ] After 6810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-11 06:35:11] [INFO ] After 7504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 262 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:35:12] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 06:35:14] [INFO ] Implicit Places using invariants in 2743 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:35:14] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 06:35:15] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 3568 ms to find 0 implicit places.
[2023-03-11 06:35:15] [INFO ] Redundant transitions in 134 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:35:15] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 06:35:19] [INFO ] Dead Transitions using invariants and state equation in 3156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7129 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1375 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 84804 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84804 steps, saw 42412 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:35:22] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-11 06:35:25] [INFO ] After 2675ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 06:35:25] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-11 06:35:35] [INFO ] After 9233ms SMT Verify possible using 198 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-11 06:35:35] [INFO ] After 12577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8471 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 65 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1197 place count 2399 transition count 2295
Applied a total of 1197 rules in 1126 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1128 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 105689 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105689 steps, saw 52895 distinct states, run finished after 3004 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-11 06:35:39] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 06:35:51] [INFO ] After 12396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 273 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 270 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-11 06:35:52] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 06:36:22] [INFO ] Performed 2262/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 06:36:25] [INFO ] Implicit Places using invariants in 33448 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-11 06:36:25] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-11 06:36:57] [INFO ] Performed 1841/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 06:37:05] [INFO ] Implicit Places using invariants and state equation in 39486 ms returned []
Implicit Place search using SMT with State Equation took 72937 ms to find 0 implicit places.
[2023-03-11 06:37:05] [INFO ] Redundant transitions in 251 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-11 06:37:05] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-11 06:37:09] [INFO ] Dead Transitions using invariants and state equation in 3656 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77127 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13861 reset in 238 ms.
Product exploration explored 100000 steps with 13841 reset in 273 ms.
Built C files in :
/tmp/ltsmin13216270628924371028
[2023-03-11 06:37:10] [INFO ] Too many transitions (2694) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:37:10] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13216270628924371028
Running compilation step : cd /tmp/ltsmin13216270628924371028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13216270628924371028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13216270628924371028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 215 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:37:13] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-11 06:37:17] [INFO ] Implicit Places using invariants in 3814 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:37:17] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-11 06:37:22] [INFO ] Implicit Places using invariants and state equation in 4750 ms returned []
Implicit Place search using SMT with State Equation took 8567 ms to find 0 implicit places.
[2023-03-11 06:37:22] [INFO ] Redundant transitions in 140 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-11 06:37:22] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-11 06:37:25] [INFO ] Dead Transitions using invariants and state equation in 3370 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12301 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Built C files in :
/tmp/ltsmin3066371484759020295
[2023-03-11 06:37:25] [INFO ] Too many transitions (2694) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:37:25] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3066371484759020295
Running compilation step : cd /tmp/ltsmin3066371484759020295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3066371484759020295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3066371484759020295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 06:37:29] [INFO ] Flatten gal took : 160 ms
[2023-03-11 06:37:29] [INFO ] Flatten gal took : 175 ms
[2023-03-11 06:37:29] [INFO ] Time to serialize gal into /tmp/LTL532441085582394351.gal : 26 ms
[2023-03-11 06:37:29] [INFO ] Time to serialize properties into /tmp/LTL10448124849100420895.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL532441085582394351.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5185717750814459586.hoa' '-atoms' '/tmp/LTL10448124849100420895.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10448124849100420895.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5185717750814459586.hoa
Detected timeout of ITS tools.
[2023-03-11 06:37:44] [INFO ] Flatten gal took : 96 ms
[2023-03-11 06:37:44] [INFO ] Flatten gal took : 160 ms
[2023-03-11 06:37:44] [INFO ] Time to serialize gal into /tmp/LTL1940222894407109274.gal : 28 ms
[2023-03-11 06:37:44] [INFO ] Time to serialize properties into /tmp/LTL14944843334601907686.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1940222894407109274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14944843334601907686.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1760<1)"))))
Formula 0 simplified : FG!"(p1760<1)"
Detected timeout of ITS tools.
[2023-03-11 06:38:00] [INFO ] Flatten gal took : 93 ms
[2023-03-11 06:38:00] [INFO ] Applying decomposition
[2023-03-11 06:38:00] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2813739301227731362.txt' '-o' '/tmp/graph2813739301227731362.bin' '-w' '/tmp/graph2813739301227731362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2813739301227731362.bin' '-l' '-1' '-v' '-w' '/tmp/graph2813739301227731362.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:38:00] [INFO ] Decomposing Gal with order
[2023-03-11 06:38:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:38:01] [INFO ] Removed a total of 2115 redundant transitions.
[2023-03-11 06:38:01] [INFO ] Flatten gal took : 306 ms
[2023-03-11 06:38:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 87 ms.
[2023-03-11 06:38:01] [INFO ] Time to serialize gal into /tmp/LTL12987828698198943630.gal : 43 ms
[2023-03-11 06:38:01] [INFO ] Time to serialize properties into /tmp/LTL2821824520825125080.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12987828698198943630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2821824520825125080.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(i2.u173.p1760<1)"))))
Formula 0 simplified : FG!"(i2.u173.p1760<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8707573993199853284
[2023-03-11 06:38:16] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8707573993199853284
Running compilation step : cd /tmp/ltsmin8707573993199853284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8707573993199853284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8707573993199853284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLFireability-06 finished in 316714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3597
Deduced a syphon composed of 202 places in 266 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 2800 place count 3899 transition count 3597
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 95 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 2 with 1800 rules applied. Total rules applied 4600 place count 2999 transition count 2697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 70 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2697
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 67 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4996 place count 2801 transition count 2697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2696
Applied a total of 4997 rules in 1857 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2696/4998 (removed 2302) transitions.
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-11 06:38:21] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 06:38:24] [INFO ] Implicit Places using invariants in 3097 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-11 06:38:24] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 06:38:28] [INFO ] Implicit Places using invariants and state equation in 3886 ms returned []
Implicit Place search using SMT with State Equation took 6987 ms to find 0 implicit places.
[2023-03-11 06:38:28] [INFO ] Redundant transitions in 132 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-11 06:38:28] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 06:38:31] [INFO ] Dead Transitions using invariants and state equation in 2921 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/5300 places, 2696/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11907 ms. Remains : 2800/5300 places, 2696/4998 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1811 1) (GEQ s1823 1) (GEQ s440 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-07 finished in 12032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1334 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:38:33] [INFO ] Invariants computation overflowed in 207 ms
[2023-03-11 06:38:33] [INFO ] Implicit Places using invariants in 1108 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:38:34] [INFO ] Invariants computation overflowed in 117 ms
[2023-03-11 06:38:35] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:38:35] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-11 06:38:36] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4988 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s3818 1) (LT s3896 1)), p0:(OR (LT s1072 1) (LT s1180 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 6346 ms.
Product exploration explored 100000 steps with 50000 reset in 6077 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-08 finished in 18448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(p2)))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1071 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:38:51] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-11 06:38:52] [INFO ] Implicit Places using invariants in 963 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:38:52] [INFO ] Invariants computation overflowed in 117 ms
[2023-03-11 06:38:53] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2593 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:38:53] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-11 06:38:54] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4454 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s3941 1), p2:(LT s2439 1), p0:(LT s476 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6356 ms.
Product exploration explored 100000 steps with 50000 reset in 6115 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p2 p0)
Knowledge based reduction with 23 factoid took 1040 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-09 finished in 18704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1297 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:39:10] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-11 06:39:10] [INFO ] Implicit Places using invariants in 984 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:39:11] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-11 06:39:12] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2655 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:39:12] [INFO ] Invariants computation overflowed in 121 ms
[2023-03-11 06:39:13] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4883 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s4937 1) (LT s5015 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3292 reset in 291 ms.
Product exploration explored 100000 steps with 3314 reset in 384 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 44801 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 44801 steps, saw 22405 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:39:19] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-11 06:39:44] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 240 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 88 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 74 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 64 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 2674 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2675 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97438 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97438 steps, saw 48765 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-11 06:39:50] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 06:40:10] [INFO ] After 19258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 248 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 249 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-11 06:40:10] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-11 06:40:34] [INFO ] Implicit Places using invariants in 24385 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-11 06:40:34] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:40:57] [INFO ] Implicit Places using invariants and state equation in 23058 ms returned []
Implicit Place search using SMT with State Equation took 47451 ms to find 0 implicit places.
[2023-03-11 06:40:58] [INFO ] Redundant transitions in 222 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-11 06:40:58] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 06:41:00] [INFO ] Dead Transitions using invariants and state equation in 2460 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50396 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1291 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:41:02] [INFO ] Invariants computation overflowed in 193 ms
[2023-03-11 06:41:03] [INFO ] Implicit Places using invariants in 974 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:41:03] [INFO ] Invariants computation overflowed in 193 ms
[2023-03-11 06:41:05] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2870 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:41:05] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-11 06:41:06] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5096 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 336 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 47815 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47815 steps, saw 23914 distinct states, run finished after 3005 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:41:11] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-11 06:41:36] [INFO ] After 25036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 231 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 92 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 71 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 65 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 2452 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2452 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1302 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100520 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100520 steps, saw 50303 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-11 06:41:42] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 06:42:01] [INFO ] After 19184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 248 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 250 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-11 06:42:01] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 06:42:23] [INFO ] Implicit Places using invariants in 21592 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-11 06:42:23] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 06:42:44] [INFO ] Implicit Places using invariants and state equation in 20800 ms returned []
Implicit Place search using SMT with State Equation took 42396 ms to find 0 implicit places.
[2023-03-11 06:42:44] [INFO ] Redundant transitions in 131 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-11 06:42:44] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 06:42:47] [INFO ] Dead Transitions using invariants and state equation in 3358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46143 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 198 Pre rules applied. Total rules applied 0 place count 2397 transition count 2096
Deduced a syphon composed of 198 places in 166 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2199 transition count 2096
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 397 place count 2199 transition count 2095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 398 place count 2198 transition count 2095
Applied a total of 398 rules in 1078 ms. Remains 2198 /2397 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2198 cols
[2023-03-11 06:42:49] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-11 06:43:07] [INFO ] After 18221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3288 reset in 300 ms.
Product exploration explored 100000 steps with 3327 reset in 385 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1197 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1197 place count 5300 transition count 5198
Deduced a syphon composed of 1398 places in 275 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1398 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1400 place count 5298 transition count 5196
Deduced a syphon composed of 1396 places in 276 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1402 place count 5298 transition count 5196
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: -200
Deduced a syphon composed of 2298 places in 203 ms
Iterating global reduction 1 with 902 rules applied. Total rules applied 2304 place count 5298 transition count 5396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2305 place count 5297 transition count 5395
Deduced a syphon composed of 2297 places in 173 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2306 place count 5297 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 2398 places in 176 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2407 place count 5297 transition count 6059
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2508 place count 5196 transition count 5857
Deduced a syphon composed of 2297 places in 163 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2609 place count 5196 transition count 5857
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -627
Deduced a syphon composed of 2396 places in 177 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2708 place count 5196 transition count 6484
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 2807 place count 5097 transition count 6286
Deduced a syphon composed of 2297 places in 265 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2906 place count 5097 transition count 6286
Deduced a syphon composed of 2297 places in 189 ms
Applied a total of 2906 rules in 7661 ms. Remains 5097 /5300 variables (removed 203) and now considering 6286/4998 (removed -1288) transitions.
[2023-03-11 06:43:17] [INFO ] Redundant transitions in 825 ms returned []
// Phase 1: matrix 6286 rows 5097 cols
[2023-03-11 06:43:17] [INFO ] Invariants computation overflowed in 163 ms
[2023-03-11 06:43:18] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5097/5300 places, 6286/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9567 ms. Remains : 5097/5300 places, 6286/4998 transitions.
Built C files in :
/tmp/ltsmin14323997452121580841
[2023-03-11 06:43:18] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14323997452121580841
Running compilation step : cd /tmp/ltsmin14323997452121580841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14323997452121580841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14323997452121580841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1438 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:43:23] [INFO ] Invariants computation overflowed in 179 ms
[2023-03-11 06:43:24] [INFO ] Implicit Places using invariants in 1104 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:43:24] [INFO ] Invariants computation overflowed in 117 ms
[2023-03-11 06:43:26] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2780 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:43:26] [INFO ] Invariants computation overflowed in 128 ms
[2023-03-11 06:43:27] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5215 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin5860142102551834692
[2023-03-11 06:43:27] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5860142102551834692
Running compilation step : cd /tmp/ltsmin5860142102551834692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5860142102551834692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5860142102551834692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 06:43:30] [INFO ] Flatten gal took : 133 ms
[2023-03-11 06:43:31] [INFO ] Flatten gal took : 139 ms
[2023-03-11 06:43:31] [INFO ] Time to serialize gal into /tmp/LTL11723188222019048355.gal : 22 ms
[2023-03-11 06:43:31] [INFO ] Time to serialize properties into /tmp/LTL2841933192829600409.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11723188222019048355.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1498446925633598858.hoa' '-atoms' '/tmp/LTL2841933192829600409.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2841933192829600409.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1498446925633598858.hoa
Detected timeout of ITS tools.
[2023-03-11 06:43:47] [INFO ] Flatten gal took : 133 ms
[2023-03-11 06:43:47] [INFO ] Flatten gal took : 142 ms
[2023-03-11 06:43:47] [INFO ] Time to serialize gal into /tmp/LTL3679599632599572309.gal : 22 ms
[2023-03-11 06:43:47] [INFO ] Time to serialize properties into /tmp/LTL18166560852371203517.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3679599632599572309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18166560852371203517.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p672<1)||(p742<1))")))))
Formula 0 simplified : XXF!"((p672<1)||(p742<1))"
Detected timeout of ITS tools.
[2023-03-11 06:44:02] [INFO ] Flatten gal took : 131 ms
[2023-03-11 06:44:02] [INFO ] Applying decomposition
[2023-03-11 06:44:02] [INFO ] Flatten gal took : 141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7025835048454210353.txt' '-o' '/tmp/graph7025835048454210353.bin' '-w' '/tmp/graph7025835048454210353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7025835048454210353.bin' '-l' '-1' '-v' '-w' '/tmp/graph7025835048454210353.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:44:03] [INFO ] Decomposing Gal with order
[2023-03-11 06:44:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:44:05] [INFO ] Removed a total of 1410 redundant transitions.
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 271 ms
[2023-03-11 06:44:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 123 ms.
[2023-03-11 06:44:05] [INFO ] Time to serialize gal into /tmp/LTL13140503399390905987.gal : 54 ms
[2023-03-11 06:44:05] [INFO ] Time to serialize properties into /tmp/LTL17449481196895010850.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13140503399390905987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17449481196895010850.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i28.u2105.p672<1)||(i28.u2137.p742<1))")))))
Formula 0 simplified : XXF!"((i28.u2105.p672<1)||(i28.u2137.p742<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2118174592907800753
[2023-03-11 06:44:20] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2118174592907800753
Running compilation step : cd /tmp/ltsmin2118174592907800753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2118174592907800753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2118174592907800753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLFireability-10 finished in 314908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(F(p2))||p0))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 0 with 1193 rules applied. Total rules applied 1193 place count 5299 transition count 3804
Reduce places removed 1193 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1195 rules applied. Total rules applied 2388 place count 4106 transition count 3802
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2390 place count 4104 transition count 3802
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2390 place count 4104 transition count 3602
Deduced a syphon composed of 200 places in 232 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 89 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 82 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 75 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4986 place count 2806 transition count 2701
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 4988 place count 2806 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2805 transition count 2700
Applied a total of 4989 rules in 2108 ms. Remains 2805 /5300 variables (removed 2495) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:44:25] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-11 06:44:28] [INFO ] Implicit Places using invariants in 3276 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:44:29] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-11 06:44:33] [INFO ] Implicit Places using invariants and state equation in 4168 ms returned []
Implicit Place search using SMT with State Equation took 7445 ms to find 0 implicit places.
[2023-03-11 06:44:33] [INFO ] Redundant transitions in 134 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:44:33] [INFO ] Invariants computation overflowed in 89 ms
[2023-03-11 06:44:36] [INFO ] Dead Transitions using invariants and state equation in 3392 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13091 ms. Remains : 2805/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s152 1), p2:(GEQ s101 1), p0:(OR (LT s2029 1) (LT s2087 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13888 reset in 225 ms.
Product exploration explored 100000 steps with 14016 reset in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1377 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 61346 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61346 steps, saw 30680 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:44:41] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:45:06] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:45:31] [INFO ] After 24256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:45:31] [INFO ] State equation strengthened by 197 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:45:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:45:31] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Graph (complete) has 8475 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2803 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2803 transition count 2697
Deduced a syphon composed of 1 places in 81 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2802 transition count 2697
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 405 place count 2802 transition count 2297
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 805 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1204 place count 2402 transition count 2297
Applied a total of 1204 rules in 1303 ms. Remains 2402 /2805 variables (removed 403) and now considering 2297/2700 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1303 ms. Remains : 2402/2805 places, 2297/2700 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 79733 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79733 steps, saw 39896 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-11 06:45:36] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-11 06:46:01] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:46:26] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 272 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 279 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-11 06:46:27] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-11 06:46:57] [INFO ] Performed 2172/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 06:47:01] [INFO ] Implicit Places using invariants in 34161 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-11 06:47:01] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-11 06:47:31] [INFO ] Performed 2343/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 06:47:33] [INFO ] Implicit Places using invariants and state equation in 31913 ms returned []
Implicit Place search using SMT with State Equation took 66076 ms to find 0 implicit places.
[2023-03-11 06:47:33] [INFO ] Redundant transitions in 155 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-11 06:47:33] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-11 06:47:36] [INFO ] Dead Transitions using invariants and state equation in 3229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69751 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Applied a total of 0 rules in 201 ms. Remains 2805 /2805 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:47:37] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-11 06:47:40] [INFO ] Implicit Places using invariants in 3160 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:47:40] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:47:41] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 4023 ms to find 0 implicit places.
[2023-03-11 06:47:41] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:47:41] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:47:43] [INFO ] Dead Transitions using invariants and state equation in 2369 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6731 ms. Remains : 2805/2805 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1342 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 805 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69000 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 69000 steps, saw 34509 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:47:47] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:48:12] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:48:37] [INFO ] After 24478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:37] [INFO ] State equation strengthened by 197 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:48:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:48:37] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Graph (complete) has 8475 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2803 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2803 transition count 2697
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2802 transition count 2697
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 405 place count 2802 transition count 2297
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 805 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1204 place count 2402 transition count 2297
Applied a total of 1204 rules in 953 ms. Remains 2402 /2805 variables (removed 403) and now considering 2297/2700 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 954 ms. Remains : 2402/2805 places, 2297/2700 transitions.
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 79196 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79196 steps, saw 39623 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-11 06:48:41] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-11 06:49:06] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:49:32] [INFO ] After 24544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:49:32] [INFO ] State equation strengthened by 397 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:49:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:49:32] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 364 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 445 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-11 06:49:32] [INFO ] Invariants computation overflowed in 84 ms
[2023-03-11 06:50:03] [INFO ] Performed 2379/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 06:50:03] [INFO ] Implicit Places using invariants in 30839 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-11 06:50:03] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-11 06:50:04] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 31859 ms to find 0 implicit places.
[2023-03-11 06:50:04] [INFO ] Redundant transitions in 148 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-11 06:50:04] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-11 06:50:07] [INFO ] Dead Transitions using invariants and state equation in 2763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35233 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13764 reset in 326 ms.
Product exploration explored 100000 steps with 13897 reset in 348 ms.
Built C files in :
/tmp/ltsmin8833147171647351681
[2023-03-11 06:50:09] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:50:09] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8833147171647351681
Running compilation step : cd /tmp/ltsmin8833147171647351681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8833147171647351681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8833147171647351681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Applied a total of 0 rules in 202 ms. Remains 2805 /2805 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:50:12] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:50:14] [INFO ] Implicit Places using invariants in 2567 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:50:14] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:50:18] [INFO ] Implicit Places using invariants and state equation in 3543 ms returned []
Implicit Place search using SMT with State Equation took 6111 ms to find 0 implicit places.
[2023-03-11 06:50:18] [INFO ] Redundant transitions in 138 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-11 06:50:18] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 06:50:21] [INFO ] Dead Transitions using invariants and state equation in 2935 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9393 ms. Remains : 2805/2805 places, 2700/2700 transitions.
Built C files in :
/tmp/ltsmin10770657203432962855
[2023-03-11 06:50:21] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:50:21] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10770657203432962855
Running compilation step : cd /tmp/ltsmin10770657203432962855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10770657203432962855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10770657203432962855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 06:50:24] [INFO ] Flatten gal took : 81 ms
[2023-03-11 06:50:24] [INFO ] Flatten gal took : 83 ms
[2023-03-11 06:50:24] [INFO ] Time to serialize gal into /tmp/LTL922013697977063205.gal : 15 ms
[2023-03-11 06:50:24] [INFO ] Time to serialize properties into /tmp/LTL7771774175531421595.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL922013697977063205.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11050530593044021609.hoa' '-atoms' '/tmp/LTL7771774175531421595.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7771774175531421595.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11050530593044021609.hoa
Detected timeout of ITS tools.
[2023-03-11 06:50:40] [INFO ] Flatten gal took : 81 ms
[2023-03-11 06:50:40] [INFO ] Flatten gal took : 84 ms
[2023-03-11 06:50:40] [INFO ] Time to serialize gal into /tmp/LTL2036969834594982711.gal : 15 ms
[2023-03-11 06:50:40] [INFO ] Time to serialize properties into /tmp/LTL15356483607221129077.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2036969834594982711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15356483607221129077.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p4454<1)||(p4549<1))")||((G("(p1251<1)"))||(G(F("(p1165>=1)"))))))))
Formula 0 simplified : G(F!"(p1251<1)" & FG(!"((p4454<1)||(p4549<1))" & !"(p1165>=1)"))
Detected timeout of ITS tools.
[2023-03-11 06:50:55] [INFO ] Flatten gal took : 90 ms
[2023-03-11 06:50:55] [INFO ] Applying decomposition
[2023-03-11 06:50:55] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1299991873437619807.txt' '-o' '/tmp/graph1299991873437619807.bin' '-w' '/tmp/graph1299991873437619807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1299991873437619807.bin' '-l' '-1' '-v' '-w' '/tmp/graph1299991873437619807.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:50:55] [INFO ] Decomposing Gal with order
[2023-03-11 06:50:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:50:56] [INFO ] Removed a total of 2050 redundant transitions.
[2023-03-11 06:50:56] [INFO ] Flatten gal took : 180 ms
[2023-03-11 06:50:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 71 ms.
[2023-03-11 06:50:56] [INFO ] Time to serialize gal into /tmp/LTL3943264927934092935.gal : 57 ms
[2023-03-11 06:50:56] [INFO ] Time to serialize properties into /tmp/LTL5208289473845977694.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3943264927934092935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5208289473845977694.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i16.u749.p4454<1)||(i17.i0.i1.u761.p4549<1))")||((G("(i0.u57.p1251<1)"))||(G(F("(i21.i0.i2.u38.p1165>=1)"))))))))
Formula 0 simplified : G(F!"(i0.u57.p1251<1)" & FG(!"((i16.u749.p4454<1)||(i17.i0.i1.u761.p4549<1))" & !"(i21.i0.i2.u38.p1165>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17860475836093773874
[2023-03-11 06:51:11] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17860475836093773874
Running compilation step : cd /tmp/ltsmin17860475836093773874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17860475836093773874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17860475836093773874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLFireability-11 finished in 411119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1) U p2)&&F(p3))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2390 place count 4105 transition count 3801
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2392 place count 4103 transition count 3801
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2392 place count 4103 transition count 3601
Deduced a syphon composed of 200 places in 231 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2792 place count 3903 transition count 3601
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 110 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 106 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 76 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4990 place count 2804 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4991 place count 2803 transition count 2698
Applied a total of 4991 rules in 2050 ms. Remains 2803 /5300 variables (removed 2497) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-11 06:51:16] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-11 06:51:20] [INFO ] Implicit Places using invariants in 3268 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-11 06:51:20] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-11 06:51:24] [INFO ] Implicit Places using invariants and state equation in 4574 ms returned []
Implicit Place search using SMT with State Equation took 7849 ms to find 0 implicit places.
[2023-03-11 06:51:24] [INFO ] Redundant transitions in 228 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-11 06:51:24] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-11 06:51:28] [INFO ] Dead Transitions using invariants and state equation in 3558 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13694 ms. Remains : 2803/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s1096 1) (GEQ s1103 1)) (GEQ s2308 1)), p2:(AND (GEQ s1096 1) (GEQ s1103 1)), p1:(GEQ s2308 1), p3:(GEQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-12 finished in 14230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1390 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:51:30] [INFO ] Invariants computation overflowed in 195 ms
[2023-03-11 06:51:31] [INFO ] Implicit Places using invariants in 1047 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:51:31] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-11 06:51:33] [INFO ] Implicit Places using invariants and state equation in 1875 ms returned []
Implicit Place search using SMT with State Equation took 2924 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-11 06:51:33] [INFO ] Invariants computation overflowed in 188 ms
[2023-03-11 06:51:34] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5454 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s3732 1) (GEQ s860 1) (GEQ s949 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-15 finished in 6276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLFireability-10
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 368 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 94 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 73 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 67 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4998 place count 2800 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4999 place count 2799 transition count 2695
Applied a total of 4999 rules in 2062 ms. Remains 2799 /5300 variables (removed 2501) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:51:37] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 06:51:41] [INFO ] Implicit Places using invariants in 3494 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:51:41] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-11 06:51:42] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 4452 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:51:42] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-11 06:51:45] [INFO ] Dead Transitions using invariants and state equation in 3545 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2799/5300 places, 2695/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10062 ms. Remains : 2799/5300 places, 2695/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s2606 1) (LT s2646 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13954 reset in 253 ms.
Product exploration explored 100000 steps with 13917 reset in 269 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75665 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75665 steps, saw 37837 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:51:49] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-11 06:52:02] [INFO ] After 13009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Graph (complete) has 8478 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2797 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2797 transition count 2692
Deduced a syphon composed of 1 places in 62 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2796 transition count 2296
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2400 transition count 2296
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2400 transition count 2296
Applied a total of 1196 rules in 950 ms. Remains 2400 /2799 variables (removed 399) and now considering 2296/2695 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 950 ms. Remains : 2400/2799 places, 2296/2695 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100841 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100841 steps, saw 50468 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-11 06:52:07] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 06:52:32] [INFO ] After 25047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 258 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 251 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-11 06:52:32] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 06:52:56] [INFO ] Implicit Places using invariants in 24058 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-11 06:52:56] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-11 06:52:57] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 25170 ms to find 0 implicit places.
[2023-03-11 06:52:57] [INFO ] Redundant transitions in 205 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-11 06:52:58] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-11 06:53:01] [INFO ] Dead Transitions using invariants and state equation in 3401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29037 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2400 transition count 2097
Deduced a syphon composed of 199 places in 171 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2201 transition count 2097
Applied a total of 398 rules in 627 ms. Remains 2201 /2400 variables (removed 199) and now considering 2097/2296 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2201 cols
[2023-03-11 06:53:02] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-11 06:53:19] [INFO ] After 17395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 292 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:53:20] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-11 06:53:24] [INFO ] Implicit Places using invariants in 3322 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:53:24] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-11 06:53:25] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 4321 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:53:25] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 06:53:28] [INFO ] Dead Transitions using invariants and state equation in 3058 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7673 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1382 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85446 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85446 steps, saw 42736 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:53:31] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 06:53:44] [INFO ] After 13069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Graph (complete) has 8478 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2797 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2797 transition count 2692
Deduced a syphon composed of 1 places in 60 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2796 transition count 2296
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2400 transition count 2296
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2400 transition count 2296
Applied a total of 1196 rules in 882 ms. Remains 2400 /2799 variables (removed 399) and now considering 2296/2695 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 882 ms. Remains : 2400/2799 places, 2296/2695 transitions.
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97637 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97637 steps, saw 48861 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-11 06:53:48] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-11 06:54:13] [INFO ] After 25045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 248 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 251 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-11 06:54:14] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 06:54:34] [INFO ] Implicit Places using invariants in 20346 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-11 06:54:34] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 06:54:56] [INFO ] Implicit Places using invariants and state equation in 22294 ms returned []
Implicit Place search using SMT with State Equation took 42644 ms to find 0 implicit places.
[2023-03-11 06:54:57] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-11 06:54:57] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 06:55:00] [INFO ] Dead Transitions using invariants and state equation in 3326 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46372 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2400 transition count 2097
Deduced a syphon composed of 199 places in 152 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2201 transition count 2097
Applied a total of 398 rules in 601 ms. Remains 2201 /2400 variables (removed 199) and now considering 2097/2296 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2201 cols
[2023-03-11 06:55:01] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-11 06:55:18] [INFO ] After 17103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13879 reset in 246 ms.
Product exploration explored 100000 steps with 13919 reset in 268 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 206 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
[2023-03-11 06:55:20] [INFO ] Redundant transitions in 131 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:55:20] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 06:55:23] [INFO ] Dead Transitions using invariants and state equation in 3031 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3374 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Built C files in :
/tmp/ltsmin16763402157047597722
[2023-03-11 06:55:23] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16763402157047597722
Running compilation step : cd /tmp/ltsmin16763402157047597722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16763402157047597722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16763402157047597722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 186 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:55:26] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 06:55:29] [INFO ] Implicit Places using invariants in 3223 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:55:29] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 06:55:30] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 4257 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-11 06:55:30] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 06:55:33] [INFO ] Dead Transitions using invariants and state equation in 2558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7002 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Built C files in :
/tmp/ltsmin11042840874174935063
[2023-03-11 06:55:33] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11042840874174935063
Running compilation step : cd /tmp/ltsmin11042840874174935063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11042840874174935063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11042840874174935063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 06:55:36] [INFO ] Flatten gal took : 80 ms
[2023-03-11 06:55:36] [INFO ] Flatten gal took : 81 ms
[2023-03-11 06:55:36] [INFO ] Time to serialize gal into /tmp/LTL1928454107307227282.gal : 13 ms
[2023-03-11 06:55:36] [INFO ] Time to serialize properties into /tmp/LTL16702406119241529858.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1928454107307227282.gal' '-t' 'CGAL' '-hoa' '/tmp/aut506975586373439854.hoa' '-atoms' '/tmp/LTL16702406119241529858.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL16702406119241529858.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut506975586373439854.hoa
Detected timeout of ITS tools.
[2023-03-11 06:55:51] [INFO ] Flatten gal took : 82 ms
[2023-03-11 06:55:51] [INFO ] Flatten gal took : 98 ms
[2023-03-11 06:55:51] [INFO ] Time to serialize gal into /tmp/LTL9303231649748484556.gal : 13 ms
[2023-03-11 06:55:51] [INFO ] Time to serialize properties into /tmp/LTL6461606738422156222.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9303231649748484556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6461606738422156222.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p672<1)||(p742<1))")))))
Formula 0 simplified : XXF!"((p672<1)||(p742<1))"
Detected timeout of ITS tools.
[2023-03-11 06:56:07] [INFO ] Flatten gal took : 85 ms
[2023-03-11 06:56:07] [INFO ] Applying decomposition
[2023-03-11 06:56:07] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9946728947780956153.txt' '-o' '/tmp/graph9946728947780956153.bin' '-w' '/tmp/graph9946728947780956153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9946728947780956153.bin' '-l' '-1' '-v' '-w' '/tmp/graph9946728947780956153.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:56:07] [INFO ] Decomposing Gal with order
[2023-03-11 06:56:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:56:07] [INFO ] Removed a total of 2051 redundant transitions.
[2023-03-11 06:56:07] [INFO ] Flatten gal took : 245 ms
[2023-03-11 06:56:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 87 ms.
[2023-03-11 06:56:08] [INFO ] Time to serialize gal into /tmp/LTL4693754298424638138.gal : 55 ms
[2023-03-11 06:56:08] [INFO ] Time to serialize properties into /tmp/LTL14414876235877807003.ltl : 2 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4693754298424638138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14414876235877807003.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i21.u945.p672<1)||(i21.u959.p742<1))")))))
Formula 0 simplified : XXF!"((i21.u945.p672<1)||(i21.u959.p742<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3060536665536549646
[2023-03-11 06:56:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3060536665536549646
Running compilation step : cd /tmp/ltsmin3060536665536549646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3060536665536549646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3060536665536549646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLFireability-10 finished in 290842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(F(p2))||p0))))'
[2023-03-11 06:56:26] [INFO ] Flatten gal took : 120 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10386831388187777011
[2023-03-11 06:56:26] [INFO ] Too many transitions (4998) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:56:26] [INFO ] Applying decomposition
[2023-03-11 06:56:26] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10386831388187777011
Running compilation step : cd /tmp/ltsmin10386831388187777011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 06:56:26] [INFO ] Flatten gal took : 210 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14820372910326526758.txt' '-o' '/tmp/graph14820372910326526758.bin' '-w' '/tmp/graph14820372910326526758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14820372910326526758.bin' '-l' '-1' '-v' '-w' '/tmp/graph14820372910326526758.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:56:27] [INFO ] Decomposing Gal with order
[2023-03-11 06:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:56:29] [INFO ] Removed a total of 1427 redundant transitions.
[2023-03-11 06:56:29] [INFO ] Flatten gal took : 248 ms
[2023-03-11 06:56:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 100 ms.
[2023-03-11 06:56:29] [INFO ] Time to serialize gal into /tmp/LTLFireability2971810872956799141.gal : 71 ms
[2023-03-11 06:56:29] [INFO ] Time to serialize properties into /tmp/LTLFireability396628318610604551.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2971810872956799141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability396628318610604551.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 4 LTL properties
Checking formula 0 : !((G(("(i15.i1.i1.i0.u1243.p3613<1)")&&(("((i4.i0.i3.i0.u304.p1626>=1)&&(i4.i1.i1.i3.u340.p1696>=1))")||(X(F(("((i7.u520.p2069>=1)&&(i...228
Formula 0 simplified : F(!"(i15.i1.i1.i0.u1243.p3613<1)" | (!"((i4.i0.i3.i0.u304.p1626>=1)&&(i4.i1.i1.i3.u340.p1696>=1))" & XG(!"((i7.u520.p2069>=1)&&(i7.u...218
Compilation finished in 31312 ms.
Running link step : cd /tmp/ltsmin10386831388187777011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin10386831388187777011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)&&((LTLAPp1==true)||X(<>(((LTLAPp2==true)||[]((LTLAPp3==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10386831388187777011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)&&((LTLAPp1==true)||X(<>(((LTLAPp2==true)||[]((LTLAPp3==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10386831388187777011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1158988 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16031684 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DoubleExponent-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-100, 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 r133-smll-167819411100492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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