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.r295-tall-167873947800387.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 lolaxred
Input is PolyORBLF-COL-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947800387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 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 PolyORBLF-COL-S02J06T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678835249929

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 23:07:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 23:07:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 23:07:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 23:07:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 23:07:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 765 ms
[2023-03-14 23:07:32] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 23:07:32] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-14 23:07:32] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 5 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 33) seen :18
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :1
Running SMT prover for 14 properties.
[2023-03-14 23:07:33] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-14 23:07:33] [INFO ] Computed 26 place invariants in 12 ms
[2023-03-14 23:07:33] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-14 23:07:33] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-14 23:07:33] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:9
[2023-03-14 23:07:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-14 23:07:33] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-14 23:07:33] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :4
[2023-03-14 23:07:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-14 23:07:33] [INFO ] After 70ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :10 sat :4
[2023-03-14 23:07:33] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
[2023-03-14 23:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-14 23:07:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2023-03-14 23:07:34] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2023-03-14 23:07:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-14 23:07:34] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :4
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-14 23:07:34] [INFO ] After 642ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :4
Fused 14 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 33 place count 64 transition count 49
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 64 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 62 transition count 47
Applied a total of 37 rules in 22 ms. Remains 62 /81 variables (removed 19) and now considering 47/65 (removed 18) transitions.
[2023-03-14 23:07:34] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 62 cols
[2023-03-14 23:07:34] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-14 23:07:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/81 places, 45/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 43
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 60 /62 variables (removed 2) and now considering 41/45 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77 ms. Remains : 60/81 places, 41/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Finished Best-First random walk after 4739 steps, including 1 resets, run visited all 2 properties in 24 ms. (steps per millisecond=197 )
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 23:07:34] [INFO ] Flatten gal took : 27 ms
[2023-03-14 23:07:34] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-14 23:07:34] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 33 ms.
[2023-03-14 23:07:34] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 376 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Applied a total of 22 rules in 78 ms. Remains 832 /844 variables (removed 12) and now considering 1642/1652 (removed 10) transitions.
[2023-03-14 23:07:34] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 832 cols
[2023-03-14 23:07:34] [INFO ] Computed 56 place invariants in 79 ms
[2023-03-14 23:07:35] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
[2023-03-14 23:07:35] [INFO ] Flow matrix only has 1512 transitions (discarded 20 similar events)
// Phase 1: matrix 1512 rows 832 cols
[2023-03-14 23:07:35] [INFO ] Computed 56 place invariants in 45 ms
[2023-03-14 23:07:35] [INFO ] Implicit Places using invariants in 404 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 407 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 822/844 places, 1532/1652 transitions.
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 820 transition count 1512
Reduce places removed 10 places and 20 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 810 transition count 1492
Deduced a syphon composed of 10 places in 3 ms
Applied a total of 12 rules in 18 ms. Remains 810 /822 variables (removed 12) and now considering 1492/1532 (removed 40) transitions.
[2023-03-14 23:07:35] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 810 cols
[2023-03-14 23:07:36] [INFO ] Computed 56 place invariants in 34 ms
[2023-03-14 23:07:36] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-14 23:07:36] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:07:36] [INFO ] Invariant cache hit.
[2023-03-14 23:07:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:07:42] [INFO ] Implicit Places using invariants and state equation in 6158 ms returned []
Implicit Place search using SMT with State Equation took 6517 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 810/844 places, 1492/1652 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7847 ms. Remains : 810/844 places, 1492/1652 transitions.
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Support contains 346 out of 800 places after structural reductions.
[2023-03-14 23:07:42] [INFO ] Flatten gal took : 114 ms
[2023-03-14 23:07:42] [INFO ] Flatten gal took : 91 ms
[2023-03-14 23:07:42] [INFO ] Input system was already deterministic with 1492 transitions.
Support contains 336 out of 800 places (down from 346) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-14 23:07:43] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 800 cols
[2023-03-14 23:07:43] [INFO ] Computed 46 place invariants in 26 ms
[2023-03-14 23:07:43] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 23:07:43] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 37 ms returned sat
[2023-03-14 23:07:44] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-14 23:07:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 23:07:44] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 39 ms returned sat
[2023-03-14 23:07:46] [INFO ] After 2073ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-14 23:07:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:07:47] [INFO ] After 1682ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-14 23:07:49] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 2 ms to minimize.
[2023-03-14 23:07:49] [INFO ] Deduced a trap composed of 542 places in 319 ms of which 1 ms to minimize.
[2023-03-14 23:07:50] [INFO ] Deduced a trap composed of 422 places in 372 ms of which 1 ms to minimize.
[2023-03-14 23:07:50] [INFO ] Deduced a trap composed of 566 places in 336 ms of which 1 ms to minimize.
[2023-03-14 23:07:51] [INFO ] Deduced a trap composed of 481 places in 313 ms of which 1 ms to minimize.
[2023-03-14 23:07:51] [INFO ] Deduced a trap composed of 402 places in 305 ms of which 1 ms to minimize.
[2023-03-14 23:07:52] [INFO ] Deduced a trap composed of 450 places in 307 ms of which 1 ms to minimize.
[2023-03-14 23:07:52] [INFO ] Deduced a trap composed of 434 places in 360 ms of which 1 ms to minimize.
[2023-03-14 23:07:52] [INFO ] Deduced a trap composed of 152 places in 301 ms of which 2 ms to minimize.
[2023-03-14 23:07:53] [INFO ] Deduced a trap composed of 136 places in 321 ms of which 1 ms to minimize.
[2023-03-14 23:07:53] [INFO ] Deduced a trap composed of 485 places in 301 ms of which 1 ms to minimize.
[2023-03-14 23:07:54] [INFO ] Deduced a trap composed of 471 places in 295 ms of which 0 ms to minimize.
[2023-03-14 23:07:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5421 ms
[2023-03-14 23:07:55] [INFO ] Deduced a trap composed of 441 places in 306 ms of which 1 ms to minimize.
[2023-03-14 23:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2023-03-14 23:07:55] [INFO ] After 9232ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 1218 ms.
[2023-03-14 23:07:56] [INFO ] After 12697ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 30 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 800 transition count 1422
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 730 transition count 1422
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 730 transition count 1322
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 630 transition count 1322
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 460 place count 570 transition count 1262
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 470 place count 560 transition count 1252
Iterating global reduction 2 with 10 rules applied. Total rules applied 480 place count 560 transition count 1252
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 500 place count 560 transition count 1232
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 520 place count 540 transition count 1232
Applied a total of 520 rules in 158 ms. Remains 540 /800 variables (removed 260) and now considering 1232/1492 (removed 260) transitions.
[2023-03-14 23:07:56] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
// Phase 1: matrix 1212 rows 540 cols
[2023-03-14 23:07:56] [INFO ] Computed 46 place invariants in 23 ms
[2023-03-14 23:07:57] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 540/800 places, 1232/1492 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 189308 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{1=1}
Probabilistic random walk after 189308 steps, saw 108719 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-14 23:08:00] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
[2023-03-14 23:08:00] [INFO ] Invariant cache hit.
[2023-03-14 23:08:00] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:08:00] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 24 ms returned sat
[2023-03-14 23:08:01] [INFO ] After 944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 23:08:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:08:01] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 25 ms returned sat
[2023-03-14 23:08:02] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 23:08:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:08:03] [INFO ] After 883ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 23:08:03] [INFO ] After 1077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-14 23:08:04] [INFO ] After 2524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1232/1232 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 530 transition count 1222
Applied a total of 20 rules in 36 ms. Remains 530 /540 variables (removed 10) and now considering 1222/1232 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 530/540 places, 1222/1232 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306093 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 306093 steps, saw 172338 distinct states, run finished after 3007 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 23:08:07] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 530 cols
[2023-03-14 23:08:07] [INFO ] Computed 46 place invariants in 25 ms
[2023-03-14 23:08:07] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:08:07] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 27 ms returned sat
[2023-03-14 23:08:08] [INFO ] After 1358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 23:08:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:08:08] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 22 ms returned sat
[2023-03-14 23:08:09] [INFO ] After 1085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 23:08:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:08:10] [INFO ] After 841ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 23:08:11] [INFO ] After 1286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 255 ms.
[2023-03-14 23:08:11] [INFO ] After 2799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 26 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 530/530 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 27 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2023-03-14 23:08:11] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:08:11] [INFO ] Invariant cache hit.
[2023-03-14 23:08:11] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-14 23:08:12] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:08:12] [INFO ] Invariant cache hit.
[2023-03-14 23:08:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:08:14] [INFO ] Implicit Places using invariants and state equation in 2754 ms returned []
Implicit Place search using SMT with State Equation took 3328 ms to find 0 implicit places.
[2023-03-14 23:08:14] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-14 23:08:14] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:08:14] [INFO ] Invariant cache hit.
[2023-03-14 23:08:15] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3946 ms. Remains : 530/530 places, 1222/1222 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 530 transition count 1202
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 530 transition count 1182
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 530 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 520 transition count 1172
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 520 transition count 1150
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 104 place count 498 transition count 1150
Applied a total of 104 rules in 65 ms. Remains 498 /530 variables (removed 32) and now considering 1150/1222 (removed 72) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1150 rows 498 cols
[2023-03-14 23:08:15] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-14 23:08:15] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-14 23:08:15] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 20 ms returned sat
[2023-03-14 23:08:15] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 23:08:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-14 23:08:15] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 20 ms returned sat
[2023-03-14 23:08:16] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 23:08:16] [INFO ] After 851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-14 23:08:16] [INFO ] After 1197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
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(F(p0)) U (p1 U p2))))'
Support contains 37 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Applied a total of 0 rules in 8 ms. Remains 800 /800 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
[2023-03-14 23:08:17] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 800 cols
[2023-03-14 23:08:17] [INFO ] Computed 46 place invariants in 20 ms
[2023-03-14 23:08:17] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
[2023-03-14 23:08:17] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:17] [INFO ] Invariant cache hit.
[2023-03-14 23:08:18] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-14 23:08:18] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:18] [INFO ] Invariant cache hit.
[2023-03-14 23:08:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:08:21] [INFO ] Implicit Places using invariants and state equation in 3691 ms returned []
Implicit Place search using SMT with State Equation took 4219 ms to find 0 implicit places.
[2023-03-14 23:08:21] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:21] [INFO ] Invariant cache hit.
[2023-03-14 23:08:22] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5495 ms. Remains : 800/800 places, 1492/1492 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ 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=[p2:(GT (ADD s497 s498 s499 s500 s501 s502 s503 s504 s505 s506) (ADD s438 s439 s440 s441 s442 s443 s444 s445 s446 s447)), p1:(LEQ 1 (ADD s296 s297 s298 s29...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4817 reset in 514 ms.
Product exploration explored 100000 steps with 4804 reset in 356 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 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 542 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 484 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
[2023-03-14 23:08:25] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:25] [INFO ] Invariant cache hit.
[2023-03-14 23:08:26] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-14 23:08:26] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 184 ms returned sat
[2023-03-14 23:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 23:08:27] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2023-03-14 23:08:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 23:08:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 23:08:28] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 98 ms returned sat
[2023-03-14 23:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 23:08:31] [INFO ] [Nat]Absence check using state equation in 2632 ms returned sat
[2023-03-14 23:08:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:08:31] [INFO ] [Nat]Added 120 Read/Feed constraints in 811 ms returned sat
[2023-03-14 23:08:32] [INFO ] Computed and/alt/rep : 780/1518/770 causal constraints (skipped 700 transitions) in 211 ms.
[2023-03-14 23:08:34] [INFO ] Added : 99 causal constraints over 20 iterations in 2525 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-14 23:08:34] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:34] [INFO ] Invariant cache hit.
[2023-03-14 23:08:35] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 23:08:35] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 223 ms returned sat
[2023-03-14 23:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 23:08:36] [INFO ] [Real]Absence check using state equation in 1189 ms returned sat
[2023-03-14 23:08:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 23:08:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 23:08:37] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 71 ms returned sat
[2023-03-14 23:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 23:08:39] [INFO ] [Nat]Absence check using state equation in 2406 ms returned sat
[2023-03-14 23:08:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:08:40] [INFO ] [Nat]Added 120 Read/Feed constraints in 682 ms returned sat
[2023-03-14 23:08:40] [INFO ] Deduced a trap composed of 421 places in 315 ms of which 14 ms to minimize.
[2023-03-14 23:08:41] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 1 ms to minimize.
[2023-03-14 23:08:41] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 1 ms to minimize.
[2023-03-14 23:08:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1087 ms
[2023-03-14 23:08:41] [INFO ] Computed and/alt/rep : 780/1518/770 causal constraints (skipped 700 transitions) in 78 ms.
[2023-03-14 23:08:43] [INFO ] Added : 96 causal constraints over 20 iterations in 2088 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 37 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Applied a total of 0 rules in 8 ms. Remains 800 /800 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
[2023-03-14 23:08:43] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:43] [INFO ] Invariant cache hit.
[2023-03-14 23:08:44] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2023-03-14 23:08:44] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:44] [INFO ] Invariant cache hit.
[2023-03-14 23:08:44] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-14 23:08:44] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:44] [INFO ] Invariant cache hit.
[2023-03-14 23:08:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:08:49] [INFO ] Implicit Places using invariants and state equation in 4319 ms returned []
Implicit Place search using SMT with State Equation took 4847 ms to find 0 implicit places.
[2023-03-14 23:08:49] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:49] [INFO ] Invariant cache hit.
[2023-03-14 23:08:49] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6147 ms. Remains : 800/800 places, 1492/1492 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 : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 493 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 582 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
[2023-03-14 23:08:51] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:08:51] [INFO ] Invariant cache hit.
[2023-03-14 23:08:52] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-14 23:08:52] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 152 ms returned sat
[2023-03-14 23:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 23:08:53] [INFO ] [Real]Absence check using state equation in 1232 ms returned sat
[2023-03-14 23:08:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 23:08:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 23:08:54] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 100 ms returned sat
[2023-03-14 23:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 23:08:57] [INFO ] [Nat]Absence check using state equation in 2818 ms returned sat
[2023-03-14 23:08:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:08:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 853 ms returned sat
[2023-03-14 23:08:58] [INFO ] Computed and/alt/rep : 780/1518/770 causal constraints (skipped 700 transitions) in 109 ms.
[2023-03-14 23:09:00] [INFO ] Added : 99 causal constraints over 20 iterations in 2246 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-14 23:09:00] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:09:00] [INFO ] Invariant cache hit.
[2023-03-14 23:09:01] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 23:09:01] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 223 ms returned sat
[2023-03-14 23:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 23:09:02] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2023-03-14 23:09:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 23:09:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 23:09:03] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 70 ms returned sat
[2023-03-14 23:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 23:09:05] [INFO ] [Nat]Absence check using state equation in 2514 ms returned sat
[2023-03-14 23:09:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:09:06] [INFO ] [Nat]Added 120 Read/Feed constraints in 673 ms returned sat
[2023-03-14 23:09:06] [INFO ] Deduced a trap composed of 421 places in 325 ms of which 1 ms to minimize.
[2023-03-14 23:09:07] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 0 ms to minimize.
[2023-03-14 23:09:07] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 0 ms to minimize.
[2023-03-14 23:09:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 894 ms
[2023-03-14 23:09:07] [INFO ] Computed and/alt/rep : 780/1518/770 causal constraints (skipped 700 transitions) in 84 ms.
[2023-03-14 23:09:09] [INFO ] Added : 96 causal constraints over 20 iterations in 2100 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4825 reset in 304 ms.
Product exploration explored 100000 steps with 4816 reset in 313 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
Support contains 37 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 800 transition count 1492
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 50 place count 800 transition count 1602
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 150 place count 800 transition count 1602
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 170 place count 780 transition count 1582
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 190 place count 780 transition count 1582
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 260 place count 780 transition count 1582
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 280 place count 760 transition count 1562
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 300 place count 760 transition count 1562
Deduced a syphon composed of 190 places in 1 ms
Applied a total of 300 rules in 130 ms. Remains 760 /800 variables (removed 40) and now considering 1562/1492 (removed -70) transitions.
[2023-03-14 23:09:10] [INFO ] Flow matrix only has 1542 transitions (discarded 20 similar events)
// Phase 1: matrix 1542 rows 760 cols
[2023-03-14 23:09:10] [INFO ] Computed 46 place invariants in 34 ms
[2023-03-14 23:09:11] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
[2023-03-14 23:09:11] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-14 23:09:11] [INFO ] Flow matrix only has 1542 transitions (discarded 20 similar events)
[2023-03-14 23:09:11] [INFO ] Invariant cache hit.
[2023-03-14 23:09:12] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/800 places, 1562/1492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1538 ms. Remains : 760/800 places, 1562/1492 transitions.
Support contains 37 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Applied a total of 0 rules in 16 ms. Remains 800 /800 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
[2023-03-14 23:09:12] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 800 cols
[2023-03-14 23:09:12] [INFO ] Computed 46 place invariants in 24 ms
[2023-03-14 23:09:12] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
[2023-03-14 23:09:12] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:09:12] [INFO ] Invariant cache hit.
[2023-03-14 23:09:13] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-14 23:09:13] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:09:13] [INFO ] Invariant cache hit.
[2023-03-14 23:09:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:09:17] [INFO ] Implicit Places using invariants and state equation in 4513 ms returned []
Implicit Place search using SMT with State Equation took 5030 ms to find 0 implicit places.
[2023-03-14 23:09:17] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-14 23:09:17] [INFO ] Invariant cache hit.
[2023-03-14 23:09:18] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6276 ms. Remains : 800/800 places, 1492/1492 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-00 finished in 61635 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(G(p0))))))'
Support contains 15 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 800 transition count 1442
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 750 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 740 transition count 1432
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 120 place count 740 transition count 1322
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 340 place count 630 transition count 1322
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 460 place count 570 transition count 1262
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 470 place count 560 transition count 1252
Iterating global reduction 3 with 10 rules applied. Total rules applied 480 place count 560 transition count 1252
Applied a total of 480 rules in 74 ms. Remains 560 /800 variables (removed 240) and now considering 1252/1492 (removed 240) transitions.
[2023-03-14 23:09:18] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
// Phase 1: matrix 1232 rows 560 cols
[2023-03-14 23:09:18] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-14 23:09:19] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
[2023-03-14 23:09:19] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-14 23:09:19] [INFO ] Invariant cache hit.
[2023-03-14 23:09:19] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-14 23:09:19] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-14 23:09:19] [INFO ] Invariant cache hit.
[2023-03-14 23:09:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:09:25] [INFO ] Implicit Places using invariants and state equation in 5867 ms returned []
Implicit Place search using SMT with State Equation took 6275 ms to find 0 implicit places.
[2023-03-14 23:09:25] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-14 23:09:25] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-14 23:09:25] [INFO ] Invariant cache hit.
[2023-03-14 23:09:26] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 560/800 places, 1252/1492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7427 ms. Remains : 560/800 places, 1252/1492 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s527 (ADD s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3721 steps with 0 reset in 18 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-01 finished in 7629 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(F(p0))))'
Support contains 17 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 22 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-14 23:09:26] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 790 cols
[2023-03-14 23:09:26] [INFO ] Computed 46 place invariants in 25 ms
[2023-03-14 23:09:26] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
[2023-03-14 23:09:26] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:26] [INFO ] Invariant cache hit.
[2023-03-14 23:09:27] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-14 23:09:27] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:27] [INFO ] Invariant cache hit.
[2023-03-14 23:09:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:09:32] [INFO ] Implicit Places using invariants and state equation in 5314 ms returned []
Implicit Place search using SMT with State Equation took 5801 ms to find 0 implicit places.
[2023-03-14 23:09:32] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:32] [INFO ] Invariant cache hit.
[2023-03-14 23:09:33] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7054 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s552 s553 s554 s555 s556 s557 s558 s559 s560 s561) (ADD s289 s290 s291 s292 s293 s294 s295))], 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 592 ms.
Product exploration explored 100000 steps with 33333 reset in 602 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-05 finished in 8549 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 11 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 16 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-14 23:09:34] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:34] [INFO ] Invariant cache hit.
[2023-03-14 23:09:35] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
[2023-03-14 23:09:35] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:35] [INFO ] Invariant cache hit.
[2023-03-14 23:09:36] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-14 23:09:36] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:36] [INFO ] Invariant cache hit.
[2023-03-14 23:09:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:09:40] [INFO ] Implicit Places using invariants and state equation in 4174 ms returned []
Implicit Place search using SMT with State Equation took 4643 ms to find 0 implicit places.
[2023-03-14 23:09:40] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:40] [INFO ] Invariant cache hit.
[2023-03-14 23:09:40] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5966 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-06 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 s675 (ADD s414 s415 s416 s417 s418 s419 s420 s421 s422 s423))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 703 ms.
Product exploration explored 100000 steps with 50000 reset in 715 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-06 finished in 7552 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 10 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 21 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-14 23:09:42] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:42] [INFO ] Invariant cache hit.
[2023-03-14 23:09:43] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2023-03-14 23:09:43] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:43] [INFO ] Invariant cache hit.
[2023-03-14 23:09:43] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-14 23:09:43] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:43] [INFO ] Invariant cache hit.
[2023-03-14 23:09:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:09:47] [INFO ] Implicit Places using invariants and state equation in 4115 ms returned []
Implicit Place search using SMT with State Equation took 4622 ms to find 0 implicit places.
[2023-03-14 23:09:47] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:47] [INFO ] Invariant cache hit.
[2023-03-14 23:09:48] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5835 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s634 s635 s636 s637 s638 s639 s640 s641 s642 s643))], 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 7071 steps with 31 reset in 27 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-07 finished in 5933 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 U p1)))))'
Support contains 91 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 13 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-14 23:09:48] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:48] [INFO ] Invariant cache hit.
[2023-03-14 23:09:48] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
[2023-03-14 23:09:48] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:48] [INFO ] Invariant cache hit.
[2023-03-14 23:09:49] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-14 23:09:49] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:49] [INFO ] Invariant cache hit.
[2023-03-14 23:09:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:09:54] [INFO ] Implicit Places using invariants and state equation in 4596 ms returned []
Implicit Place search using SMT with State Equation took 5065 ms to find 0 implicit places.
[2023-03-14 23:09:54] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:54] [INFO ] Invariant cache hit.
[2023-03-14 23:09:54] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6353 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s664 s665 s666 s667 s668 s669 s670 s671 s672 s673) (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-08 finished in 6524 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&&X((p0 U (p1||G(p0))))))))'
Support contains 22 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 19 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-14 23:09:54] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:54] [INFO ] Invariant cache hit.
[2023-03-14 23:09:55] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2023-03-14 23:09:55] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:55] [INFO ] Invariant cache hit.
[2023-03-14 23:09:56] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-14 23:09:56] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:09:56] [INFO ] Invariant cache hit.
[2023-03-14 23:09:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:10:00] [INFO ] Implicit Places using invariants and state equation in 4353 ms returned []
Implicit Place search using SMT with State Equation took 4933 ms to find 0 implicit places.
[2023-03-14 23:10:00] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:10:00] [INFO ] Invariant cache hit.
[2023-03-14 23:10:01] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6205 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s243 s496), p1:(GT (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s202 s203 s204 s205 s206 s207 s208 s209 s210 s211))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33272 reset in 549 ms.
Product exploration explored 100000 steps with 33389 reset in 563 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 23:10:03] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:10:03] [INFO ] Invariant cache hit.
[2023-03-14 23:10:03] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:10:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-14 23:10:03] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 34 ms returned sat
[2023-03-14 23:10:05] [INFO ] After 2311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:10:06] [INFO ] After 842ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:07] [INFO ] Deduced a trap composed of 478 places in 336 ms of which 1 ms to minimize.
[2023-03-14 23:10:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2023-03-14 23:10:07] [INFO ] After 2064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 651 ms.
[2023-03-14 23:10:08] [INFO ] After 5226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 22 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 790 transition count 1412
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 720 transition count 1412
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 720 transition count 1312
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 620 transition count 1312
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 460 place count 560 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 470 place count 550 transition count 1242
Iterating global reduction 2 with 10 rules applied. Total rules applied 480 place count 550 transition count 1242
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 500 place count 550 transition count 1222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 520 place count 530 transition count 1222
Applied a total of 520 rules in 72 ms. Remains 530 /790 variables (removed 260) and now considering 1222/1482 (removed 260) transitions.
[2023-03-14 23:10:08] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 530 cols
[2023-03-14 23:10:08] [INFO ] Computed 46 place invariants in 14 ms
[2023-03-14 23:10:09] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 877 ms. Remains : 530/790 places, 1222/1482 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 179847 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179847 steps, saw 103666 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 23:10:12] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:10:12] [INFO ] Invariant cache hit.
[2023-03-14 23:10:12] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:10:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:10:12] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 24 ms returned sat
[2023-03-14 23:10:13] [INFO ] After 936ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:10:14] [INFO ] After 706ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:14] [INFO ] After 1137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 490 ms.
[2023-03-14 23:10:15] [INFO ] After 2694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 22 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 530/530 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2023-03-14 23:10:15] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:10:15] [INFO ] Invariant cache hit.
[2023-03-14 23:10:15] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-14 23:10:15] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:10:15] [INFO ] Invariant cache hit.
[2023-03-14 23:10:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:10:23] [INFO ] Implicit Places using invariants and state equation in 7739 ms returned []
Implicit Place search using SMT with State Equation took 8255 ms to find 0 implicit places.
[2023-03-14 23:10:23] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 23:10:23] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:10:23] [INFO ] Invariant cache hit.
[2023-03-14 23:10:24] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8797 ms. Remains : 530/530 places, 1222/1222 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 530 transition count 1202
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 530 transition count 1182
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 530 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 520 transition count 1172
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 520 transition count 1150
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 104 place count 498 transition count 1150
Applied a total of 104 rules in 95 ms. Remains 498 /530 variables (removed 32) and now considering 1150/1222 (removed 72) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1150 rows 498 cols
[2023-03-14 23:10:24] [INFO ] Computed 46 place invariants in 17 ms
[2023-03-14 23:10:24] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:10:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 23:10:24] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-14 23:10:25] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:26] [INFO ] Deduced a trap composed of 215 places in 207 ms of which 0 ms to minimize.
[2023-03-14 23:10:26] [INFO ] Deduced a trap composed of 207 places in 243 ms of which 0 ms to minimize.
[2023-03-14 23:10:27] [INFO ] Deduced a trap composed of 210 places in 192 ms of which 6 ms to minimize.
[2023-03-14 23:10:27] [INFO ] Deduced a trap composed of 200 places in 207 ms of which 1 ms to minimize.
[2023-03-14 23:10:28] [INFO ] Deduced a trap composed of 185 places in 203 ms of which 2 ms to minimize.
[2023-03-14 23:10:28] [INFO ] Deduced a trap composed of 183 places in 203 ms of which 0 ms to minimize.
[2023-03-14 23:10:28] [INFO ] Deduced a trap composed of 224 places in 200 ms of which 2 ms to minimize.
[2023-03-14 23:10:29] [INFO ] Deduced a trap composed of 201 places in 190 ms of which 1 ms to minimize.
[2023-03-14 23:10:29] [INFO ] Deduced a trap composed of 215 places in 198 ms of which 0 ms to minimize.
[2023-03-14 23:10:29] [INFO ] Deduced a trap composed of 179 places in 189 ms of which 0 ms to minimize.
[2023-03-14 23:10:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3690 ms
[2023-03-14 23:10:30] [INFO ] After 5618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 630 ms.
[2023-03-14 23:10:30] [INFO ] After 6356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 22 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Applied a total of 0 rules in 12 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
[2023-03-14 23:10:31] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 790 cols
[2023-03-14 23:10:31] [INFO ] Computed 46 place invariants in 30 ms
[2023-03-14 23:10:32] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
[2023-03-14 23:10:32] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:10:32] [INFO ] Invariant cache hit.
[2023-03-14 23:10:32] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-14 23:10:32] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:10:32] [INFO ] Invariant cache hit.
[2023-03-14 23:10:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:10:36] [INFO ] Implicit Places using invariants and state equation in 3647 ms returned []
Implicit Place search using SMT with State Equation took 4129 ms to find 0 implicit places.
[2023-03-14 23:10:36] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:10:36] [INFO ] Invariant cache hit.
[2023-03-14 23:10:36] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5350 ms. Remains : 790/790 places, 1482/1482 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 : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 290 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 23:10:37] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:10:37] [INFO ] Invariant cache hit.
[2023-03-14 23:10:37] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:10:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-14 23:10:37] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 36 ms returned sat
[2023-03-14 23:10:40] [INFO ] After 2418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:10:40] [INFO ] After 844ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:42] [INFO ] Deduced a trap composed of 478 places in 292 ms of which 0 ms to minimize.
[2023-03-14 23:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 446 ms
[2023-03-14 23:10:42] [INFO ] After 2070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 665 ms.
[2023-03-14 23:10:42] [INFO ] After 5327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 22 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 790 transition count 1412
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 720 transition count 1412
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 720 transition count 1312
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 620 transition count 1312
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 460 place count 560 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 470 place count 550 transition count 1242
Iterating global reduction 2 with 10 rules applied. Total rules applied 480 place count 550 transition count 1242
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 500 place count 550 transition count 1222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 520 place count 530 transition count 1222
Applied a total of 520 rules in 58 ms. Remains 530 /790 variables (removed 260) and now considering 1222/1482 (removed 260) transitions.
[2023-03-14 23:10:42] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 530 cols
[2023-03-14 23:10:42] [INFO ] Computed 46 place invariants in 22 ms
[2023-03-14 23:10:43] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 547 ms. Remains : 530/790 places, 1222/1482 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 190497 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190497 steps, saw 109553 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 23:10:46] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:10:46] [INFO ] Invariant cache hit.
[2023-03-14 23:10:46] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:10:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:10:46] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 23 ms returned sat
[2023-03-14 23:10:47] [INFO ] After 893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:10:48] [INFO ] After 693ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 23:10:48] [INFO ] After 1118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 464 ms.
[2023-03-14 23:10:49] [INFO ] After 2590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 22 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 14 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 530/530 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2023-03-14 23:10:49] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:10:49] [INFO ] Invariant cache hit.
[2023-03-14 23:10:49] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-14 23:10:49] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:10:49] [INFO ] Invariant cache hit.
[2023-03-14 23:10:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:10:58] [INFO ] Implicit Places using invariants and state equation in 8748 ms returned []
Implicit Place search using SMT with State Equation took 9199 ms to find 0 implicit places.
[2023-03-14 23:10:58] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-14 23:10:58] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:10:58] [INFO ] Invariant cache hit.
[2023-03-14 23:10:59] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9758 ms. Remains : 530/530 places, 1222/1222 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 530 transition count 1202
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 530 transition count 1182
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 530 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 520 transition count 1172
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 520 transition count 1150
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 104 place count 498 transition count 1150
Applied a total of 104 rules in 69 ms. Remains 498 /530 variables (removed 32) and now considering 1150/1222 (removed 72) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1150 rows 498 cols
[2023-03-14 23:10:59] [INFO ] Computed 46 place invariants in 20 ms
[2023-03-14 23:10:59] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:10:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 23:10:59] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 15 ms returned sat
[2023-03-14 23:11:00] [INFO ] After 909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:11:01] [INFO ] Deduced a trap composed of 215 places in 204 ms of which 0 ms to minimize.
[2023-03-14 23:11:01] [INFO ] Deduced a trap composed of 207 places in 225 ms of which 1 ms to minimize.
[2023-03-14 23:11:02] [INFO ] Deduced a trap composed of 210 places in 228 ms of which 0 ms to minimize.
[2023-03-14 23:11:02] [INFO ] Deduced a trap composed of 200 places in 183 ms of which 0 ms to minimize.
[2023-03-14 23:11:03] [INFO ] Deduced a trap composed of 185 places in 180 ms of which 1 ms to minimize.
[2023-03-14 23:11:03] [INFO ] Deduced a trap composed of 183 places in 187 ms of which 1 ms to minimize.
[2023-03-14 23:11:03] [INFO ] Deduced a trap composed of 224 places in 190 ms of which 1 ms to minimize.
[2023-03-14 23:11:03] [INFO ] Deduced a trap composed of 201 places in 202 ms of which 0 ms to minimize.
[2023-03-14 23:11:04] [INFO ] Deduced a trap composed of 215 places in 218 ms of which 1 ms to minimize.
[2023-03-14 23:11:04] [INFO ] Deduced a trap composed of 179 places in 198 ms of which 1 ms to minimize.
[2023-03-14 23:11:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3672 ms
[2023-03-14 23:11:05] [INFO ] After 5586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 632 ms.
[2023-03-14 23:11:05] [INFO ] After 6337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33286 reset in 548 ms.
Product exploration explored 100000 steps with 33352 reset in 571 ms.
Support contains 22 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Applied a total of 0 rules in 12 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
[2023-03-14 23:11:07] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 790 cols
[2023-03-14 23:11:07] [INFO ] Computed 46 place invariants in 24 ms
[2023-03-14 23:11:08] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
[2023-03-14 23:11:08] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:08] [INFO ] Invariant cache hit.
[2023-03-14 23:11:08] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-14 23:11:08] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:08] [INFO ] Invariant cache hit.
[2023-03-14 23:11:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:11:13] [INFO ] Implicit Places using invariants and state equation in 4598 ms returned []
Implicit Place search using SMT with State Equation took 5070 ms to find 0 implicit places.
[2023-03-14 23:11:13] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:13] [INFO ] Invariant cache hit.
[2023-03-14 23:11:13] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6319 ms. Remains : 790/790 places, 1482/1482 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-09 finished in 79086 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((G(!p0)||(p1&&X(!p0)))))))))'
Support contains 90 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 33 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-14 23:11:13] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:13] [INFO ] Invariant cache hit.
[2023-03-14 23:11:14] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
[2023-03-14 23:11:14] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:14] [INFO ] Invariant cache hit.
[2023-03-14 23:11:15] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-14 23:11:15] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:15] [INFO ] Invariant cache hit.
[2023-03-14 23:11:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:11:19] [INFO ] Implicit Places using invariants and state equation in 4541 ms returned []
Implicit Place search using SMT with State Equation took 5015 ms to find 0 implicit places.
[2023-03-14 23:11:19] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:19] [INFO ] Invariant cache hit.
[2023-03-14 23:11:20] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6237 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, p0, p0, p0]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s720 s721 s722 s723 s724 s725 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s742 s743 s744 s745 s746 s747 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1942 reset in 681 ms.
Stack based approach found an accepted trace after 73491 steps with 1375 reset with depth 262 and stack size 262 in 509 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-10 finished in 7641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p0||(p1 U p2)))))))'
Support contains 11 out of 800 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 20 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-14 23:11:21] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:21] [INFO ] Invariant cache hit.
[2023-03-14 23:11:22] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
[2023-03-14 23:11:22] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:22] [INFO ] Invariant cache hit.
[2023-03-14 23:11:22] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-14 23:11:22] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:22] [INFO ] Invariant cache hit.
[2023-03-14 23:11:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:11:27] [INFO ] Implicit Places using invariants and state equation in 4347 ms returned []
Implicit Place search using SMT with State Equation took 4836 ms to find 0 implicit places.
[2023-03-14 23:11:27] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:27] [INFO ] Invariant cache hit.
[2023-03-14 23:11:27] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6043 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-11 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 (ADD s612 s613 s614 s615 s616 s617 s618 s619 s620 s621) s288)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-11 finished in 6148 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(p0)&&G(p1))))'
Support contains 18 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 22 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-14 23:11:27] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:27] [INFO ] Invariant cache hit.
[2023-03-14 23:11:28] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
[2023-03-14 23:11:28] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:28] [INFO ] Invariant cache hit.
[2023-03-14 23:11:28] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-14 23:11:28] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:28] [INFO ] Invariant cache hit.
[2023-03-14 23:11:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:11:33] [INFO ] Implicit Places using invariants and state equation in 4565 ms returned []
Implicit Place search using SMT with State Equation took 5030 ms to find 0 implicit places.
[2023-03-14 23:11:33] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-14 23:11:33] [INFO ] Invariant cache hit.
[2023-03-14 23:11:33] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6214 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 2 (ADD s644 s645 s646 s647 s648 s649 s650 s651 s652 s653)), p0:(LEQ s674 (ADD s289 s290 s291 s292 s293 s294 s295))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-15 finished in 6422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (p1 U p2))))'
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&&X((p0 U (p1||G(p0))))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T10-LTLCardinality-09
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 22 out of 800 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 800 transition count 1422
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 730 transition count 1422
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 730 transition count 1322
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 630 transition count 1322
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 480 place count 560 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 490 place count 550 transition count 1242
Iterating global reduction 2 with 10 rules applied. Total rules applied 500 place count 550 transition count 1242
Applied a total of 500 rules in 42 ms. Remains 550 /800 variables (removed 250) and now considering 1242/1492 (removed 250) transitions.
[2023-03-14 23:11:34] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 550 cols
[2023-03-14 23:11:34] [INFO ] Computed 46 place invariants in 24 ms
[2023-03-14 23:11:34] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
[2023-03-14 23:11:34] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:11:34] [INFO ] Invariant cache hit.
[2023-03-14 23:11:35] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-14 23:11:35] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:11:35] [INFO ] Invariant cache hit.
[2023-03-14 23:11:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:11:41] [INFO ] Implicit Places using invariants and state equation in 6580 ms returned []
Implicit Place search using SMT with State Equation took 7023 ms to find 0 implicit places.
[2023-03-14 23:11:41] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:11:41] [INFO ] Invariant cache hit.
[2023-03-14 23:11:42] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 550/800 places, 1242/1492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8055 ms. Remains : 550/800 places, 1242/1492 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s223 s406), p1:(GT (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s192 s193 s194 s195 s196 s197 s198 s199 s200 s201))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33217 reset in 435 ms.
Product exploration explored 100000 steps with 33410 reset in 452 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 302 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 23:11:44] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:11:44] [INFO ] Invariant cache hit.
[2023-03-14 23:11:44] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:11:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:11:44] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 26 ms returned sat
[2023-03-14 23:11:45] [INFO ] After 1231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:11:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:11:47] [INFO ] After 2305ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 23:11:48] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2023-03-14 23:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-14 23:11:48] [INFO ] After 3223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 385 ms.
[2023-03-14 23:11:49] [INFO ] After 4974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 22 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1242/1242 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 550 transition count 1222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 530 transition count 1222
Applied a total of 40 rules in 30 ms. Remains 530 /550 variables (removed 20) and now considering 1222/1242 (removed 20) transitions.
[2023-03-14 23:11:49] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 530 cols
[2023-03-14 23:11:49] [INFO ] Computed 46 place invariants in 16 ms
[2023-03-14 23:11:49] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 530/550 places, 1222/1242 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 203962 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203962 steps, saw 117015 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 23:11:52] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:11:52] [INFO ] Invariant cache hit.
[2023-03-14 23:11:52] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:11:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 23:11:52] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 23 ms returned sat
[2023-03-14 23:11:54] [INFO ] After 1024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:11:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:11:54] [INFO ] After 571ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 23:11:55] [INFO ] After 1448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 445 ms.
[2023-03-14 23:11:55] [INFO ] After 3048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 22 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 18 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 530/530 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2023-03-14 23:11:55] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:11:55] [INFO ] Invariant cache hit.
[2023-03-14 23:11:56] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-14 23:11:56] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:11:56] [INFO ] Invariant cache hit.
[2023-03-14 23:11:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:12:04] [INFO ] Implicit Places using invariants and state equation in 8085 ms returned []
Implicit Place search using SMT with State Equation took 8526 ms to find 0 implicit places.
[2023-03-14 23:12:04] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-14 23:12:04] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:12:04] [INFO ] Invariant cache hit.
[2023-03-14 23:12:04] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9047 ms. Remains : 530/530 places, 1222/1222 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 530 transition count 1202
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 530 transition count 1182
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 530 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 520 transition count 1172
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 520 transition count 1150
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 104 place count 498 transition count 1150
Applied a total of 104 rules in 58 ms. Remains 498 /530 variables (removed 32) and now considering 1150/1222 (removed 72) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1150 rows 498 cols
[2023-03-14 23:12:05] [INFO ] Computed 46 place invariants in 20 ms
[2023-03-14 23:12:05] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:12:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-14 23:12:05] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-14 23:12:06] [INFO ] After 1055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:12:06] [INFO ] Deduced a trap composed of 194 places in 217 ms of which 1 ms to minimize.
[2023-03-14 23:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-14 23:12:07] [INFO ] Deduced a trap composed of 189 places in 209 ms of which 0 ms to minimize.
[2023-03-14 23:12:07] [INFO ] Deduced a trap composed of 146 places in 206 ms of which 0 ms to minimize.
[2023-03-14 23:12:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 587 ms
[2023-03-14 23:12:07] [INFO ] After 2466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 594 ms.
[2023-03-14 23:12:08] [INFO ] After 3167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 22 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 550 /550 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-14 23:12:08] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 550 cols
[2023-03-14 23:12:08] [INFO ] Computed 46 place invariants in 22 ms
[2023-03-14 23:12:09] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
[2023-03-14 23:12:09] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:12:09] [INFO ] Invariant cache hit.
[2023-03-14 23:12:09] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-14 23:12:09] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:12:09] [INFO ] Invariant cache hit.
[2023-03-14 23:12:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:12:17] [INFO ] Implicit Places using invariants and state equation in 7571 ms returned []
Implicit Place search using SMT with State Equation took 8013 ms to find 0 implicit places.
[2023-03-14 23:12:17] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:12:17] [INFO ] Invariant cache hit.
[2023-03-14 23:12:17] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9029 ms. Remains : 550/550 places, 1242/1242 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 : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 23:12:18] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:12:18] [INFO ] Invariant cache hit.
[2023-03-14 23:12:18] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:12:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:12:18] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 26 ms returned sat
[2023-03-14 23:12:20] [INFO ] After 1230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:12:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:12:22] [INFO ] After 2316ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 23:12:22] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2023-03-14 23:12:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-14 23:12:23] [INFO ] After 3229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 385 ms.
[2023-03-14 23:12:23] [INFO ] After 4978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 22 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1242/1242 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 550 transition count 1222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 530 transition count 1222
Applied a total of 40 rules in 32 ms. Remains 530 /550 variables (removed 20) and now considering 1222/1242 (removed 20) transitions.
[2023-03-14 23:12:23] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 530 cols
[2023-03-14 23:12:23] [INFO ] Computed 46 place invariants in 23 ms
[2023-03-14 23:12:24] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 530/550 places, 1222/1242 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 197241 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197241 steps, saw 113391 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 23:12:27] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:12:27] [INFO ] Invariant cache hit.
[2023-03-14 23:12:27] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:12:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 23:12:27] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 25 ms returned sat
[2023-03-14 23:12:28] [INFO ] After 1019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:12:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:12:29] [INFO ] After 580ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 23:12:30] [INFO ] After 1442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 441 ms.
[2023-03-14 23:12:30] [INFO ] After 3019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 22 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 530/530 places, 1222/1222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2023-03-14 23:12:30] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:12:30] [INFO ] Invariant cache hit.
[2023-03-14 23:12:30] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-14 23:12:30] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:12:30] [INFO ] Invariant cache hit.
[2023-03-14 23:12:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:12:39] [INFO ] Implicit Places using invariants and state equation in 8086 ms returned []
Implicit Place search using SMT with State Equation took 8516 ms to find 0 implicit places.
[2023-03-14 23:12:39] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-14 23:12:39] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-14 23:12:39] [INFO ] Invariant cache hit.
[2023-03-14 23:12:39] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9011 ms. Remains : 530/530 places, 1222/1222 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 530 transition count 1202
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 530 transition count 1182
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 530 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 520 transition count 1172
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 520 transition count 1150
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 104 place count 498 transition count 1150
Applied a total of 104 rules in 53 ms. Remains 498 /530 variables (removed 32) and now considering 1150/1222 (removed 72) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1150 rows 498 cols
[2023-03-14 23:12:39] [INFO ] Computed 46 place invariants in 17 ms
[2023-03-14 23:12:39] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 23:12:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-14 23:12:39] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-14 23:12:40] [INFO ] After 1014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 23:12:41] [INFO ] Deduced a trap composed of 194 places in 221 ms of which 3 ms to minimize.
[2023-03-14 23:12:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-14 23:12:41] [INFO ] Deduced a trap composed of 189 places in 211 ms of which 1 ms to minimize.
[2023-03-14 23:12:42] [INFO ] Deduced a trap composed of 146 places in 214 ms of which 2 ms to minimize.
[2023-03-14 23:12:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 580 ms
[2023-03-14 23:12:42] [INFO ] After 2396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 565 ms.
[2023-03-14 23:12:42] [INFO ] After 3064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 367 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33114 reset in 447 ms.
Product exploration explored 100000 steps with 33309 reset in 459 ms.
Support contains 22 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 550 /550 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-14 23:12:44] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 550 cols
[2023-03-14 23:12:44] [INFO ] Computed 46 place invariants in 30 ms
[2023-03-14 23:12:44] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
[2023-03-14 23:12:44] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:12:44] [INFO ] Invariant cache hit.
[2023-03-14 23:12:45] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-14 23:12:45] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:12:45] [INFO ] Invariant cache hit.
[2023-03-14 23:12:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-14 23:12:53] [INFO ] Implicit Places using invariants and state equation in 8135 ms returned []
Implicit Place search using SMT with State Equation took 8576 ms to find 0 implicit places.
[2023-03-14 23:12:53] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-14 23:12:53] [INFO ] Invariant cache hit.
[2023-03-14 23:12:54] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9598 ms. Remains : 550/550 places, 1242/1242 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-09 finished in 79867 ms.
[2023-03-14 23:12:54] [INFO ] Flatten gal took : 65 ms
[2023-03-14 23:12:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-14 23:12:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 800 places, 1492 transitions and 6350 arcs took 10 ms.
Total runtime 322743 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-COL-S02J06T10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
LTLCardinality

BK_STOP 1678835650348

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBLF-COL-S02J06T10-LTLCardinality-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 6/32 PolyORBLF-COL-S02J06T10-LTLCardinality-00 495960 m, 99192 m/sec, 951270 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 12/32 PolyORBLF-COL-S02J06T10-LTLCardinality-00 946161 m, 90040 m/sec, 1926866 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 17/32 PolyORBLF-COL-S02J06T10-LTLCardinality-00 1406969 m, 92161 m/sec, 2867507 t fired, .

Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 21/32 PolyORBLF-COL-S02J06T10-LTLCardinality-00 1840439 m, 86694 m/sec, 3794984 t fired, .

Time elapsed: 20 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 26/32 PolyORBLF-COL-S02J06T10-LTLCardinality-00 2290984 m, 90109 m/sec, 4712885 t fired, .

Time elapsed: 25 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1800 31/32 PolyORBLF-COL-S02J06T10-LTLCardinality-00 2709764 m, 83756 m/sec, 5650393 t fired, .

Time elapsed: 30 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for PolyORBLF-COL-S02J06T10-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 PolyORBLF-COL-S02J06T10-LTLCardinality-09
lola: time limit : 3565 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3565 5/32 PolyORBLF-COL-S02J06T10-LTLCardinality-09 555877 m, 111175 m/sec, 884427 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3565 9/32 PolyORBLF-COL-S02J06T10-LTLCardinality-09 1075169 m, 103858 m/sec, 1745907 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3565 14/32 PolyORBLF-COL-S02J06T10-LTLCardinality-09 1596286 m, 104223 m/sec, 2602369 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3565 18/32 PolyORBLF-COL-S02J06T10-LTLCardinality-09 2096464 m, 100035 m/sec, 3458433 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3565 22/32 PolyORBLF-COL-S02J06T10-LTLCardinality-09 2607485 m, 102204 m/sec, 4312547 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3565 26/32 PolyORBLF-COL-S02J06T10-LTLCardinality-09 3099917 m, 98486 m/sec, 5162089 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3565 30/32 PolyORBLF-COL-S02J06T10-LTLCardinality-09 3593402 m, 98697 m/sec, 6013754 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for PolyORBLF-COL-S02J06T10-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S02J06T10-LTLCardinality-00: LTL unknown AGGR
PolyORBLF-COL-S02J06T10-LTLCardinality-09: LTL unknown AGGR


Time elapsed: 75 secs. Pages in use: 32

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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is PolyORBLF-COL-S02J06T10, 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 r295-tall-167873947800387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 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 ;