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.r165-tall-167838851000867.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 GPPP-PT-C0100N0000010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838851000867
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000010000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679597739616

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000010000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 18:55:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 18:55:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:55:41] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-23 18:55:41] [INFO ] Transformed 33 places.
[2023-03-23 18:55:41] [INFO ] Transformed 22 transitions.
[2023-03-23 18:55:41] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 18:55:42] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-23 18:55:42] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
[2023-03-23 18:55:42] [INFO ] Invariant cache hit.
[2023-03-23 18:55:42] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-23 18:55:42] [INFO ] Invariant cache hit.
[2023-03-23 18:55:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 257 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 22 out of 32 places after structural reductions.
[2023-03-23 18:55:42] [INFO ] Flatten gal took : 18 ms
[2023-03-23 18:55:42] [INFO ] Flatten gal took : 6 ms
[2023-03-23 18:55:42] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10065 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=193 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 18:55:43] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-23 18:55:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-23 18:55:43] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-23 18:55:43] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-23 18:55:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-23 18:55:43] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-23 18:55:43] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
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)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:55:43] [INFO ] Invariant cache hit.
[2023-03-23 18:55:43] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-23 18:55:43] [INFO ] Invariant cache hit.
[2023-03-23 18:55:43] [INFO ] Implicit Places using invariants in 45 ms returned [1, 2, 3, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2060 steps with 0 reset in 24 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-00 finished in 351 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))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 24 transition count 15
Applied a total of 13 rules in 18 ms. Remains 24 /32 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-23 18:55:44] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 18:55:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-23 18:55:44] [INFO ] Invariant cache hit.
[2023-03-23 18:55:44] [INFO ] Implicit Places using invariants in 34 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 15/22 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 17 transition count 12
Applied a total of 6 rules in 2 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-23 18:55:44] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 18:55:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-23 18:55:44] [INFO ] Invariant cache hit.
[2023-03-23 18:55:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 18:55:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 163 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-02 finished in 210 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((!(p0 U (X(!p0) U p1))||F(X(p2)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 18:55:44] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-23 18:55:44] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-23 18:55:44] [INFO ] Invariant cache hit.
[2023-03-23 18:55:44] [INFO ] Implicit Places using invariants in 36 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(GT s27 s1), p1:(LEQ 3 s22), p0:(LEQ 1 s8)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 164 ms.
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 9 factoid took 201 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-03 finished in 820 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(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:55:45] [INFO ] Invariant cache hit.
[2023-03-23 18:55:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-23 18:55:45] [INFO ] Invariant cache hit.
[2023-03-23 18:55:45] [INFO ] Implicit Places using invariants in 39 ms returned [1, 2, 3, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s12 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 4506 steps with 2 reset in 8 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-04 finished in 186 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' '!(((p0 U p1)||G(p2)||G(!p2)))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 28 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 28 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 25 transition count 16
Applied a total of 12 rules in 13 ms. Remains 25 /32 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-23 18:55:45] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 18:55:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-23 18:55:45] [INFO ] Invariant cache hit.
[2023-03-23 18:55:45] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 3, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 17 transition count 12
Applied a total of 8 rules in 3 ms. Remains 17 /21 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-23 18:55:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 18:55:45] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2023-03-23 18:55:45] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 18:55:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:55:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 131 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p1), false, (NOT p2), p2, (AND (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(LEQ 2 s13), p0:(LEQ s12 s0), p2:(GT s13 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-05 finished in 404 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 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 18:55:45] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-23 18:55:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 18:55:45] [INFO ] Invariant cache hit.
[2023-03-23 18:55:45] [INFO ] Implicit Places using invariants in 30 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-07 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:(LEQ 3 s15)], 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 34 reset in 175 ms.
Product exploration explored 100000 steps with 34 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 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 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 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 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 29 cols
[2023-03-23 18:55:46] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-23 18:55:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 18:55:46] [INFO ] [Real]Absence check using 4 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-23 18:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:55:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 18:55:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:55:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 18:55:46] [INFO ] [Nat]Absence check using 4 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 18:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:55:46] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-23 18:55:46] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 18:55:46] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:55:46] [INFO ] Invariant cache hit.
[2023-03-23 18:55:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-23 18:55:46] [INFO ] Invariant cache hit.
[2023-03-23 18:55:46] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-23 18:55:46] [INFO ] Invariant cache hit.
[2023-03-23 18:55:47] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 28/29 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 60 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 401 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)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 99 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 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 28 cols
[2023-03-23 18:55:47] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 18:55:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 18:55:47] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 18:55:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:55:47] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 18:55:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:55:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 18:55:48] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-23 18:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:55:48] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-23 18:55:48] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-23 18:55:48] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34 reset in 88 ms.
Product exploration explored 100000 steps with 34 reset in 144 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 5 edges and 28 vertex of which 2 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 58 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 25 transition count 19
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 25 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 25 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 6 rules in 11 ms. Remains 25 /28 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 25 cols
[2023-03-23 18:55:48] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 18:55:48] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-23 18:55:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 18:55:48] [INFO ] Invariant cache hit.
[2023-03-23 18:55:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/28 places, 19/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 25/28 places, 19/22 transitions.
Built C files in :
/tmp/ltsmin10784148973905613453
[2023-03-23 18:55:48] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10784148973905613453
Running compilation step : cd /tmp/ltsmin10784148973905613453;'/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'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin10784148973905613453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10784148973905613453;'/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' '--hoa' '/tmp/stateBased11267882725425486421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2023-03-23 18:56:03] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 18:56:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-23 18:56:03] [INFO ] Invariant cache hit.
[2023-03-23 18:56:03] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-23 18:56:03] [INFO ] Invariant cache hit.
[2023-03-23 18:56:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-23 18:56:03] [INFO ] Invariant cache hit.
[2023-03-23 18:56:03] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 28/28 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin7430304724359973993
[2023-03-23 18:56:03] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7430304724359973993
Running compilation step : cd /tmp/ltsmin7430304724359973993;'/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'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin7430304724359973993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7430304724359973993;'/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' '--hoa' '/tmp/stateBased8094013040828575780.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 18:56:19] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:56:19] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:56:19] [INFO ] Time to serialize gal into /tmp/LTL5982922731582464528.gal : 1 ms
[2023-03-23 18:56:19] [INFO ] Time to serialize properties into /tmp/LTL16934786167682291693.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/LTL5982922731582464528.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5185292546762134732.hoa' '-atoms' '/tmp/LTL16934786167682291693.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/LTL16934786167682291693.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5185292546762134732.hoa
Detected timeout of ITS tools.
[2023-03-23 18:56:34] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:56:34] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:56:34] [INFO ] Time to serialize gal into /tmp/LTL3473674580722901136.gal : 1 ms
[2023-03-23 18:56:34] [INFO ] Time to serialize properties into /tmp/LTL5540862191993681028.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/LTL3473674580722901136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5540862191993681028.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("(ADP>=3)")))))
Formula 0 simplified : XXF!"(ADP>=3)"
Detected timeout of ITS tools.
[2023-03-23 18:56:49] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:56:49] [INFO ] Applying decomposition
[2023-03-23 18:56:49] [INFO ] Flatten gal took : 2 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/graph6958751206266144246.txt' '-o' '/tmp/graph6958751206266144246.bin' '-w' '/tmp/graph6958751206266144246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6958751206266144246.bin' '-l' '-1' '-v' '-w' '/tmp/graph6958751206266144246.weights' '-q' '0' '-e' '0.001'
[2023-03-23 18:56:49] [INFO ] Decomposing Gal with order
[2023-03-23 18:56:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 18:56:49] [INFO ] Flatten gal took : 23 ms
[2023-03-23 18:56:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-23 18:56:49] [INFO ] Time to serialize gal into /tmp/LTL13004851613888605880.gal : 1 ms
[2023-03-23 18:56:49] [INFO ] Time to serialize properties into /tmp/LTL10153804592075643492.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/LTL13004851613888605880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10153804592075643492.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("(u3.ADP>=3)")))))
Formula 0 simplified : XXF!"(u3.ADP>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10548968795982711902
[2023-03-23 18:57:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10548968795982711902
Running compilation step : cd /tmp/ltsmin10548968795982711902;'/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'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin10548968795982711902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10548968795982711902;'/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' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-07 finished in 93848 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' '!((!p0&&G(F(p0))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 24 transition count 15
Applied a total of 13 rules in 9 ms. Remains 24 /32 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-23 18:57:19] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-23 18:57:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-23 18:57:19] [INFO ] Invariant cache hit.
[2023-03-23 18:57:19] [INFO ] Implicit Places using invariants in 34 ms returned [1, 2, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 15/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 20 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 16 transition count 11
Applied a total of 9 rules in 4 ms. Remains 16 /21 variables (removed 5) and now considering 11/15 (removed 4) transitions.
// Phase 1: matrix 11 rows 16 cols
[2023-03-23 18:57:19] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 18:57:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-23 18:57:19] [INFO ] Invariant cache hit.
[2023-03-23 18:57:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 18:57:19] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/32 places, 11/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 141 ms. Remains : 15/32 places, 11/22 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s7 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-08 finished in 275 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||G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 24 transition count 15
Applied a total of 13 rules in 8 ms. Remains 24 /32 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-23 18:57:19] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-23 18:57:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-23 18:57:19] [INFO ] Invariant cache hit.
[2023-03-23 18:57:19] [INFO ] Implicit Places using invariants in 27 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 15/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 17 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 15 transition count 10
Applied a total of 10 rules in 5 ms. Remains 15 /20 variables (removed 5) and now considering 10/15 (removed 5) transitions.
// Phase 1: matrix 10 rows 15 cols
[2023-03-23 18:57:19] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 18:57:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-23 18:57:19] [INFO ] Invariant cache hit.
[2023-03-23 18:57:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 18:57:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 10/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 112 ms. Remains : 14/32 places, 10/22 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s11), p0:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-09 finished in 199 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)&&F(G((p1 U p2))))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 10 ms. Remains 25 /32 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-23 18:57:19] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-23 18:57:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-23 18:57:19] [INFO ] Invariant cache hit.
[2023-03-23 18:57:20] [INFO ] Implicit Places using invariants in 34 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Applied a total of 4 rules in 4 ms. Remains 19 /21 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 19 cols
[2023-03-23 18:57:20] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 18:57:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-23 18:57:20] [INFO ] Invariant cache hit.
[2023-03-23 18:57:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 18:57:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/32 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s7), p2:(LEQ 2 s14), p1:(AND (LEQ 1 s0) (LEQ s9 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 621 steps with 1 reset in 6 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-10 finished in 328 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 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-23 18:57:20] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-23 18:57:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-23 18:57:20] [INFO ] Invariant cache hit.
[2023-03-23 18:57:20] [INFO ] Implicit Places using invariants in 29 ms returned [1, 2, 3, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 30 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-13 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:(LEQ 3 s26)], 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]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-13 finished in 164 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&&X(X(F(p1))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:57:20] [INFO ] Invariant cache hit.
[2023-03-23 18:57:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 18:57:20] [INFO ] Invariant cache hit.
[2023-03-23 18:57:20] [INFO ] Implicit Places using invariants in 29 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT 1 s15), p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (X (X p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-14 finished in 472 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((p0||G(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:57:20] [INFO ] Invariant cache hit.
[2023-03-23 18:57:20] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2023-03-23 18:57:20] [INFO ] Invariant cache hit.
[2023-03-23 18:57:20] [INFO ] Implicit Places using invariants in 35 ms returned [1, 2, 3, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-15 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:(LEQ s6 s22), p0:(GT 1 s5)], 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 72 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT 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 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-15 finished in 469 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))))'
Found a Lengthening insensitive property : GPPP-PT-C0100N0000010000-LTLCardinality-07
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 4 ms. Remains 25 /32 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-23 18:57:21] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-23 18:57:21] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-23 18:57:21] [INFO ] Invariant cache hit.
[2023-03-23 18:57:21] [INFO ] Implicit Places using invariants in 31 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/32 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 21 cols
[2023-03-23 18:57:21] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-23 18:57:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-23 18:57:21] [INFO ] Invariant cache hit.
[2023-03-23 18:57:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:21] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 21/32 places, 15/22 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 173 ms. Remains : 21/32 places, 15/22 transitions.
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-07 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:(LEQ 3 s10)], 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 79 reset in 73 ms.
Product exploration explored 100000 steps with 79 reset in 78 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 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 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 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 588 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-23 18:57:22] [INFO ] Invariant cache hit.
[2023-03-23 18:57:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:22] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-23 18:57:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-23 18:57:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:22] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-23 18:57:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-23 18:57:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:22] [INFO ] Computed and/alt/rep : 14/35/14 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-23 18:57:22] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-23 18:57:22] [INFO ] Invariant cache hit.
[2023-03-23 18:57:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-23 18:57:22] [INFO ] Invariant cache hit.
[2023-03-23 18:57:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-23 18:57:23] [INFO ] Invariant cache hit.
[2023-03-23 18:57:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-23 18:57:23] [INFO ] Invariant cache hit.
[2023-03-23 18:57:23] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 21/21 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 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 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
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 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-23 18:57:23] [INFO ] Invariant cache hit.
[2023-03-23 18:57:23] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 18:57:23] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-23 18:57:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:23] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-23 18:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-23 18:57:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:23] [INFO ] Computed and/alt/rep : 14/35/14 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-23 18:57:23] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 79 reset in 74 ms.
Product exploration explored 100000 steps with 79 reset in 78 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-23 18:57:24] [INFO ] Invariant cache hit.
[2023-03-23 18:57:24] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-23 18:57:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 18:57:24] [INFO ] Invariant cache hit.
[2023-03-23 18:57:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 21/21 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin14261870395453503737
[2023-03-23 18:57:24] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14261870395453503737
Running compilation step : cd /tmp/ltsmin14261870395453503737;'/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'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin14261870395453503737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14261870395453503737;'/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' '--hoa' '/tmp/stateBased1734984354054078051.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-23 18:57:39] [INFO ] Invariant cache hit.
[2023-03-23 18:57:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-23 18:57:39] [INFO ] Invariant cache hit.
[2023-03-23 18:57:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-23 18:57:39] [INFO ] Invariant cache hit.
[2023-03-23 18:57:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:39] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-23 18:57:39] [INFO ] Invariant cache hit.
[2023-03-23 18:57:39] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 21/21 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin15103101925730958263
[2023-03-23 18:57:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15103101925730958263
Running compilation step : cd /tmp/ltsmin15103101925730958263;'/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'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin15103101925730958263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15103101925730958263;'/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' '--hoa' '/tmp/stateBased13175271140285932260.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 18:57:54] [INFO ] Flatten gal took : 4 ms
[2023-03-23 18:57:54] [INFO ] Flatten gal took : 1 ms
[2023-03-23 18:57:54] [INFO ] Time to serialize gal into /tmp/LTL4641166864702857038.gal : 0 ms
[2023-03-23 18:57:54] [INFO ] Time to serialize properties into /tmp/LTL16610029052140851723.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/LTL4641166864702857038.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16520132290690465020.hoa' '-atoms' '/tmp/LTL16610029052140851723.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/LTL16610029052140851723.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16520132290690465020.hoa
Detected timeout of ITS tools.
[2023-03-23 18:58:09] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:58:09] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:58:09] [INFO ] Time to serialize gal into /tmp/LTL16755340837456322834.gal : 0 ms
[2023-03-23 18:58:09] [INFO ] Time to serialize properties into /tmp/LTL4559491650367185557.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/LTL16755340837456322834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4559491650367185557.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("(ADP>=3)")))))
Formula 0 simplified : XXF!"(ADP>=3)"
Detected timeout of ITS tools.
[2023-03-23 18:58:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:58:24] [INFO ] Applying decomposition
[2023-03-23 18:58:24] [INFO ] Flatten gal took : 2 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/graph18345820343204359392.txt' '-o' '/tmp/graph18345820343204359392.bin' '-w' '/tmp/graph18345820343204359392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18345820343204359392.bin' '-l' '-1' '-v' '-w' '/tmp/graph18345820343204359392.weights' '-q' '0' '-e' '0.001'
[2023-03-23 18:58:24] [INFO ] Decomposing Gal with order
[2023-03-23 18:58:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 18:58:24] [INFO ] Removed a total of 2 redundant transitions.
[2023-03-23 18:58:24] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:58:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-23 18:58:24] [INFO ] Time to serialize gal into /tmp/LTL18389592158688760228.gal : 1 ms
[2023-03-23 18:58:24] [INFO ] Time to serialize properties into /tmp/LTL2776219483695972216.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/LTL18389592158688760228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2776219483695972216.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("(u1.ADP>=3)")))))
Formula 0 simplified : XXF!"(u1.ADP>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2168731658330026802
[2023-03-23 18:58:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2168731658330026802
Running compilation step : cd /tmp/ltsmin2168731658330026802;'/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'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin2168731658330026802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2168731658330026802;'/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' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-07 finished in 93635 ms.
[2023-03-23 18:58:54] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10341244473910710591
[2023-03-23 18:58:55] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2023-03-23 18:58:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 18:58:55] [INFO ] Applying decomposition
[2023-03-23 18:58:55] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2023-03-23 18:58:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 18:58:55] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2023-03-23 18:58:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 18:58:55] [INFO ] Flatten gal took : 1 ms
[2023-03-23 18:58:55] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10341244473910710591
Running compilation step : cd /tmp/ltsmin10341244473910710591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
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/graph7066173055509700635.txt' '-o' '/tmp/graph7066173055509700635.bin' '-w' '/tmp/graph7066173055509700635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7066173055509700635.bin' '-l' '-1' '-v' '-w' '/tmp/graph7066173055509700635.weights' '-q' '0' '-e' '0.001'
[2023-03-23 18:58:55] [INFO ] Decomposing Gal with order
[2023-03-23 18:58:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 18:58:55] [INFO ] Flatten gal took : 2 ms
[2023-03-23 18:58:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-23 18:58:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality17741744808629020959.gal : 1 ms
[2023-03-23 18:58:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality14516239858815361165.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/LTLCardinality17741744808629020959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14516239858815361165.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...278
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i0.u0.ADP>=3)")))))
Formula 0 simplified : XXF!"(i0.u0.ADP>=3)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-23 18:58:55] [INFO ] Flatten gal took : 3 ms
[2023-03-23 18:58:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality10220115640076927745.gal : 1 ms
[2023-03-23 18:58:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality18302111520631163681.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/LTLCardinality10220115640076927745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18302111520631163681.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...299
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(ADP>=3)")))))
Formula 0 simplified : XXF!"(ADP>=3)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-23 18:58:55] [INFO ] Flatten gal took : 1 ms
[2023-03-23 18:58:55] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-23 18:58:55] [INFO ] Transformed 32 places.
[2023-03-23 18:58:55] [INFO ] Transformed 22 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Compilation finished in 110 ms.
Running link step : cd /tmp/ltsmin10341244473910710591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2023-03-23 18:58:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality10315441058615509643.gal : 0 ms
[2023-03-23 18:58:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality17060554113569564202.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/LTLCardinality10315441058615509643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17060554113569564202.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G("(ADP>=3)")))))
Formula 0 simplified : XXF!"(ADP>=3)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin10341244473910710591;'/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' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: LTL layer: formula: X(X([]((LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: "X(X([]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: buchi has 4 states
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.072: DFS-FIFO for weak LTL, using special progress label 24
pins2lts-mc-linux64( 0/ 8), 0.072: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.072: State length is 33, there are 27 groups
pins2lts-mc-linux64( 0/ 8), 0.072: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.072: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.072: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.072: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.098: ~1 levels ~960 states ~4016 transitions
pins2lts-mc-linux64( 3/ 8), 0.105: ~1 levels ~1920 states ~8928 transitions
pins2lts-mc-linux64( 3/ 8), 0.127: ~1 levels ~3840 states ~18984 transitions
pins2lts-mc-linux64( 3/ 8), 0.159: ~1 levels ~7680 states ~40272 transitions
pins2lts-mc-linux64( 3/ 8), 0.229: ~1 levels ~15360 states ~84848 transitions
pins2lts-mc-linux64( 3/ 8), 0.372: ~1 levels ~30720 states ~181872 transitions
pins2lts-mc-linux64( 3/ 8), 0.581: ~1 levels ~61440 states ~395224 transitions
pins2lts-mc-linux64( 3/ 8), 0.999: ~1 levels ~122880 states ~837552 transitions
pins2lts-mc-linux64( 3/ 8), 1.516: ~1 levels ~245760 states ~1758752 transitions
pins2lts-mc-linux64( 3/ 8), 2.255: ~1 levels ~491520 states ~3649728 transitions
pins2lts-mc-linux64( 6/ 8), 3.175: ~1 levels ~983040 states ~7161344 transitions
pins2lts-mc-linux64( 6/ 8), 4.711: ~1 levels ~1966080 states ~14735032 transitions
pins2lts-mc-linux64( 6/ 8), 7.962: ~1 levels ~3932160 states ~30422736 transitions
pins2lts-mc-linux64( 4/ 8), 14.565: ~1 levels ~7864320 states ~63273672 transitions
pins2lts-mc-linux64( 2/ 8), 28.093: ~1 levels ~15728640 states ~130198536 transitions
pins2lts-mc-linux64( 2/ 8), 55.417: ~1 levels ~31457280 states ~266768624 transitions
pins2lts-mc-linux64( 2/ 8), 111.247: ~1 levels ~62914560 states ~532745144 transitions
pins2lts-mc-linux64( 4/ 8), 241.184: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 241.208:
pins2lts-mc-linux64( 0/ 8), 241.208: mean standard work distribution: 6.2% (states) 6.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 241.208:
pins2lts-mc-linux64( 0/ 8), 241.208: Explored 114687421 states 984978237 transitions, fanout: 8.588
pins2lts-mc-linux64( 0/ 8), 241.208: Total exploration time 241.130 sec (241.080 sec minimum, 241.111 sec on average)
pins2lts-mc-linux64( 0/ 8), 241.208: States per second: 475625, Transitions per second: 4084843
pins2lts-mc-linux64( 0/ 8), 241.208:
pins2lts-mc-linux64( 0/ 8), 241.208: Progress states detected: 134217051
pins2lts-mc-linux64( 0/ 8), 241.208: Redundant explorations: -14.5509
pins2lts-mc-linux64( 0/ 8), 241.208:
pins2lts-mc-linux64( 0/ 8), 241.208: Queue width: 8B, total height: 42640665, memory: 325.32MB
pins2lts-mc-linux64( 0/ 8), 241.208: Tree memory: 1205.3MB, 9.4 B/state, compr.: 7.0%
pins2lts-mc-linux64( 0/ 8), 241.208: Tree fill ratio (roots/leafs): 99.0%/70.0%
pins2lts-mc-linux64( 0/ 8), 241.208: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 241.208: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 241.208: Est. total memory use: 1530.7MB (~1349.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10341244473910710591;'/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' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10341244473910710591;'/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' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Total runtime 434877 ms.

BK_STOP 1679598177533

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="GPPP-PT-C0100N0000010000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0100N0000010000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838851000867"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000010000.tgz
mv GPPP-PT-C0100N0000010000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;