Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445700347.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S06J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 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-PT-S06J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716874017142

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:26:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:26:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:26:59] [INFO ] Load time of PNML (sax parser for PT used): 604 ms
[2024-05-28 05:26:59] [INFO ] Transformed 700 places.
[2024-05-28 05:26:59] [INFO ] Transformed 10740 transitions.
[2024-05-28 05:26:59] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 804 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 204 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Applied a total of 6 rules in 147 ms. Remains 694 /700 variables (removed 6) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-05-28 05:26:59] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 694 cols
[2024-05-28 05:27:00] [INFO ] Computed 52 invariants in 214 ms
[2024-05-28 05:27:00] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 42329ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 42414ms
[2024-05-28 05:27:42] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 05:27:42] [INFO ] Invariant cache hit.
[2024-05-28 05:27:43] [INFO ] Implicit Places using invariants in 848 ms returned [64, 183, 469, 533, 669, 674]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 871 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 688/700 places, 2670/2670 transitions.
Applied a total of 0 rules in 37 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43556 ms. Remains : 688/700 places, 2670/2670 transitions.
Support contains 204 out of 688 places after structural reductions.
[2024-05-28 05:27:43] [INFO ] Flatten gal took : 267 ms
[2024-05-28 05:27:43] [INFO ] Flatten gal took : 247 ms
[2024-05-28 05:27:44] [INFO ] Input system was already deterministic with 2670 transitions.
RANDOM walk for 40000 steps (242 resets) in 2259 ms. (17 steps per ms) remains 7/26 properties
BEST_FIRST walk for 40002 steps (83 resets) in 269 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (101 resets) in 289 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (104 resets) in 319 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (96 resets) in 351 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (100 resets) in 345 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (95 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
[2024-05-28 05:27:45] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-05-28 05:27:45] [INFO ] Computed 46 invariants in 62 ms
[2024-05-28 05:27:46] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 87/145 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/175 variables, 6/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 108/283 variables, 4/16 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 7 (OVERLAPS) 392/675 variables, 21/37 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/677 variables, 2/39 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/686 variables, 6/45 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-28 05:27:47] [INFO ] Deduced a trap composed of 94 places in 595 ms of which 37 ms to minimize.
[2024-05-28 05:27:48] [INFO ] Deduced a trap composed of 94 places in 641 ms of which 6 ms to minimize.
[2024-05-28 05:27:48] [INFO ] Deduced a trap composed of 94 places in 536 ms of which 19 ms to minimize.
[2024-05-28 05:27:49] [INFO ] Deduced a trap composed of 122 places in 477 ms of which 4 ms to minimize.
[2024-05-28 05:27:49] [INFO ] Deduced a trap composed of 94 places in 185 ms of which 1 ms to minimize.
[2024-05-28 05:27:49] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 6/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 0/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3320/3322 variables, and 737 constraints, problems are : Problem set: 4 solved, 3 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 686/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 601/635 variables, 13/17 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/659 variables, 14/31 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 9 (OVERLAPS) 27/686 variables, 14/45 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 6/51 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-28 05:27:52] [INFO ] Deduced a trap composed of 94 places in 738 ms of which 4 ms to minimize.
[2024-05-28 05:27:52] [INFO ] Deduced a trap composed of 389 places in 555 ms of which 6 ms to minimize.
[2024-05-28 05:27:53] [INFO ] Deduced a trap composed of 395 places in 518 ms of which 4 ms to minimize.
[2024-05-28 05:27:53] [INFO ] Deduced a trap composed of 411 places in 507 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 4/55 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/55 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3320/3322 variables, and 741 constraints, problems are : Problem set: 5 solved, 2 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 686/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 10275ms problems are : Problem set: 5 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 688 transition count 2619
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 637 transition count 2618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 636 transition count 2618
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 104 place count 636 transition count 2533
Deduced a syphon composed of 85 places in 3 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 277 place count 548 transition count 2530
Iterating global reduction 3 with 3 rules applied. Total rules applied 280 place count 548 transition count 2530
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 422 place count 477 transition count 2459
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 434 place count 477 transition count 2447
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 446 place count 465 transition count 2447
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 465 transition count 2447
Applied a total of 447 rules in 581 ms. Remains 465 /688 variables (removed 223) and now considering 2447/2670 (removed 223) transitions.
Running 2441 sub problems to find dead transitions.
[2024-05-28 05:27:56] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
// Phase 1: matrix 2411 rows 465 cols
[2024-05-28 05:27:56] [INFO ] Computed 46 invariants in 40 ms
[2024-05-28 05:27:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-05-28 05:28:35] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-28 05:28:36] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/2876 variables, and 37 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2441/1100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-05-28 05:28:41] [INFO ] Deduced a trap composed of 29 places in 599 ms of which 3 ms to minimize.
[2024-05-28 05:28:42] [INFO ] Deduced a trap composed of 56 places in 508 ms of which 3 ms to minimize.
[2024-05-28 05:28:42] [INFO ] Deduced a trap composed of 64 places in 558 ms of which 3 ms to minimize.
[2024-05-28 05:28:43] [INFO ] Deduced a trap composed of 52 places in 516 ms of which 3 ms to minimize.
[2024-05-28 05:28:43] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 0 ms to minimize.
[2024-05-28 05:28:44] [INFO ] Deduced a trap composed of 56 places in 408 ms of which 2 ms to minimize.
[2024-05-28 05:28:44] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 2 ms to minimize.
[2024-05-28 05:28:44] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 0 ms to minimize.
[2024-05-28 05:28:44] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-28 05:28:45] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-05-28 05:28:50] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 4)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/2876 variables, and 48 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1100 constraints, Known Traps: 13/13 constraints]
After SMT, in 62625ms problems are : Problem set: 0 solved, 2441 unsolved
Search for dead transitions found 0 dead transitions in 62668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63257 ms. Remains : 465/688 places, 2447/2670 transitions.
RANDOM walk for 40000 steps (455 resets) in 1240 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (114 resets) in 419 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 406 ms. (98 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 75719 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 2
Probabilistic random walk after 75719 steps, saw 36955 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-28 05:29:03] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-05-28 05:29:03] [INFO ] Invariant cache hit.
[2024-05-28 05:29:03] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/376 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/432 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/462 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 05:29:03] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 1 ms to minimize.
[2024-05-28 05:29:03] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2024-05-28 05:29:03] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-28 05:29:03] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/463 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2411/2874 variables, 463/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2874 variables, 168/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 05:29:09] [INFO ] Deduced a trap composed of 37 places in 557 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2874 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2874 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2876 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2876 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2876 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2876 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2876/2876 variables, and 684 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7418 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 465/465 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/376 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/432 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 05:29:10] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-28 05:29:10] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-28 05:29:11] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/462 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 05:29:11] [INFO ] Deduced a trap composed of 248 places in 584 ms of which 3 ms to minimize.
[2024-05-28 05:29:12] [INFO ] Deduced a trap composed of 235 places in 492 ms of which 5 ms to minimize.
[2024-05-28 05:29:12] [INFO ] Deduced a trap composed of 221 places in 565 ms of which 3 ms to minimize.
[2024-05-28 05:29:13] [INFO ] Deduced a trap composed of 243 places in 560 ms of which 7 ms to minimize.
[2024-05-28 05:29:13] [INFO ] Deduced a trap composed of 210 places in 572 ms of which 3 ms to minimize.
[2024-05-28 05:29:14] [INFO ] Deduced a trap composed of 224 places in 590 ms of which 3 ms to minimize.
[2024-05-28 05:29:15] [INFO ] Deduced a trap composed of 242 places in 610 ms of which 3 ms to minimize.
[2024-05-28 05:29:15] [INFO ] Deduced a trap composed of 229 places in 586 ms of which 2 ms to minimize.
[2024-05-28 05:29:16] [INFO ] Deduced a trap composed of 205 places in 508 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2411/2874 variables, 463/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2874 variables, 168/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2874 variables, 2/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2874 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/2876 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2876 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2876 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2876 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2876/2876 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20611 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 465/465 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 28050ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 6007 ms.
Support contains 9 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 2447/2447 transitions.
Applied a total of 0 rules in 54 ms. Remains 465 /465 variables (removed 0) and now considering 2447/2447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 465/465 places, 2447/2447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 2447/2447 transitions.
Applied a total of 0 rules in 51 ms. Remains 465 /465 variables (removed 0) and now considering 2447/2447 (removed 0) transitions.
[2024-05-28 05:29:37] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-05-28 05:29:37] [INFO ] Invariant cache hit.
[2024-05-28 05:29:38] [INFO ] Implicit Places using invariants in 791 ms returned []
[2024-05-28 05:29:38] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-05-28 05:29:38] [INFO ] Invariant cache hit.
[2024-05-28 05:29:39] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:29:56] [INFO ] Implicit Places using invariants and state equation in 18021 ms returned []
Implicit Place search using SMT with State Equation took 18813 ms to find 0 implicit places.
[2024-05-28 05:29:56] [INFO ] Redundant transitions in 142 ms returned []
Running 2441 sub problems to find dead transitions.
[2024-05-28 05:29:56] [INFO ] Flow matrix only has 2411 transitions (discarded 36 similar events)
[2024-05-28 05:29:56] [INFO ] Invariant cache hit.
[2024-05-28 05:29:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-05-28 05:30:34] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-28 05:30:35] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/2876 variables, and 37 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2441/1100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2441 unsolved
[2024-05-28 05:30:51] [INFO ] Deduced a trap composed of 29 places in 617 ms of which 3 ms to minimize.
[2024-05-28 05:30:52] [INFO ] Deduced a trap composed of 57 places in 562 ms of which 3 ms to minimize.
[2024-05-28 05:30:53] [INFO ] Deduced a trap composed of 57 places in 601 ms of which 3 ms to minimize.
[2024-05-28 05:30:53] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/2876 variables, and 41 constraints, problems are : Problem set: 0 solved, 2441 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 16/24 constraints, State Equation: 0/465 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1100 constraints, Known Traps: 6/6 constraints]
After SMT, in 82196ms problems are : Problem set: 0 solved, 2441 unsolved
Search for dead transitions found 0 dead transitions in 82222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101240 ms. Remains : 465/465 places, 2447/2447 transitions.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 547 transition count 2529
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 475 transition count 2457
Applied a total of 426 rules in 239 ms. Remains 475 /688 variables (removed 213) and now considering 2457/2670 (removed 213) transitions.
Running 2451 sub problems to find dead transitions.
[2024-05-28 05:31:19] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
// Phase 1: matrix 2421 rows 475 cols
[2024-05-28 05:31:19] [INFO ] Computed 46 invariants in 58 ms
[2024-05-28 05:31:19] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:31:55] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-28 05:31:55] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-28 05:31:58] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 38 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:32:09] [INFO ] Deduced a trap composed of 59 places in 610 ms of which 4 ms to minimize.
[2024-05-28 05:32:09] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-28 05:32:09] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
[2024-05-28 05:32:19] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:32:19] [INFO ] Invariant cache hit.
[2024-05-28 05:32:20] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-28 05:32:20] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:32:20] [INFO ] Invariant cache hit.
[2024-05-28 05:32:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:32:40] [INFO ] Implicit Places using invariants and state equation in 20519 ms returned []
Implicit Place search using SMT with State Equation took 21182 ms to find 0 implicit places.
[2024-05-28 05:32:40] [INFO ] Redundant transitions in 79 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-05-28 05:32:40] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:32:40] [INFO ] Invariant cache hit.
[2024-05-28 05:32:40] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:33:15] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-28 05:33:17] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:33:33] [INFO ] Deduced a trap composed of 29 places in 530 ms of which 3 ms to minimize.
[2024-05-28 05:33:33] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-05-28 05:33:34] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-28 05:33:34] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:33:59] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-28 05:34:00] [INFO ] Deduced a trap composed of 35 places in 402 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 43 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 8/8 constraints]
After SMT, in 80099ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 80122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/688 places, 2457/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162011 ms. Remains : 475/688 places, 2457/2670 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-00
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 8 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-00 finished in 162245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0))) U p1))'
Support contains 56 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Applied a total of 12 rules in 56 ms. Remains 682 /688 variables (removed 6) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-05-28 05:34:01] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 682 cols
[2024-05-28 05:34:01] [INFO ] Computed 46 invariants in 109 ms
[2024-05-28 05:34:01] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 39899ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 39930ms
[2024-05-28 05:34:40] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 05:34:40] [INFO ] Invariant cache hit.
[2024-05-28 05:34:41] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-28 05:34:41] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 05:34:41] [INFO ] Invariant cache hit.
[2024-05-28 05:34:46] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:35:16] [INFO ] Performed 666/682 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 05:35:16] [INFO ] Implicit Places using invariants and state equation in 34977 ms returned []
Implicit Place search using SMT with State Equation took 35778 ms to find 0 implicit places.
Running 2658 sub problems to find dead transitions.
[2024-05-28 05:35:16] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 05:35:16] [INFO ] Invariant cache hit.
[2024-05-28 05:35:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-05-28 05:36:02] [INFO ] Deduced a trap composed of 161 places in 295 ms of which 4 ms to minimize.
[2024-05-28 05:36:03] [INFO ] Deduced a trap composed of 123 places in 300 ms of which 3 ms to minimize.
[2024-05-28 05:36:03] [INFO ] Deduced a trap composed of 151 places in 291 ms of which 3 ms to minimize.
[2024-05-28 05:36:04] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 2 ms to minimize.
[2024-05-28 05:36:05] [INFO ] Deduced a trap composed of 319 places in 390 ms of which 4 ms to minimize.
[2024-05-28 05:36:06] [INFO ] Deduced a trap composed of 337 places in 362 ms of which 4 ms to minimize.
SMT process timed out in 49881ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 49911ms
Starting structural reductions in LTL mode, iteration 1 : 682/688 places, 2664/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125690 ms. Remains : 682/688 places, 2664/2670 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 600 steps with 7 reset in 8 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-01 finished in 125828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 64 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:36:06] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-05-28 05:36:06] [INFO ] Computed 46 invariants in 49 ms
[2024-05-28 05:36:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 39848ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 39872ms
[2024-05-28 05:36:46] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:36:46] [INFO ] Invariant cache hit.
[2024-05-28 05:36:47] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-28 05:36:47] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:36:47] [INFO ] Invariant cache hit.
[2024-05-28 05:36:48] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:37:19] [INFO ] Performed 660/676 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 05:37:19] [INFO ] Implicit Places using invariants and state equation in 32004 ms returned []
Implicit Place search using SMT with State Equation took 32690 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:37:19] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:37:19] [INFO ] Invariant cache hit.
[2024-05-28 05:37:19] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 05:38:02] [INFO ] Deduced a trap composed of 182 places in 309 ms of which 3 ms to minimize.
[2024-05-28 05:38:02] [INFO ] Deduced a trap composed of 146 places in 295 ms of which 3 ms to minimize.
[2024-05-28 05:38:02] [INFO ] Deduced a trap composed of 145 places in 289 ms of which 3 ms to minimize.
[2024-05-28 05:38:03] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 2 ms to minimize.
[2024-05-28 05:38:04] [INFO ] Deduced a trap composed of 324 places in 361 ms of which 3 ms to minimize.
[2024-05-28 05:38:05] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 4 ms to minimize.
[2024-05-28 05:38:06] [INFO ] Deduced a trap composed of 319 places in 346 ms of which 3 ms to minimize.
[2024-05-28 05:38:07] [INFO ] Deduced a trap composed of 318 places in 339 ms of which 3 ms to minimize.
[2024-05-28 05:38:08] [INFO ] Deduced a trap composed of 142 places in 340 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 48 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/3298 variables, and 48 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 9/9 constraints]
After SMT, in 79696ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 79721ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152358 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-03 finished in 152481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 43 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Applied a total of 0 rules in 20 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-05-28 05:38:39] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-05-28 05:38:39] [INFO ] Computed 46 invariants in 54 ms
[2024-05-28 05:38:39] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 39612ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 39638ms
[2024-05-28 05:39:18] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 05:39:18] [INFO ] Invariant cache hit.
[2024-05-28 05:39:19] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-05-28 05:39:19] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 05:39:19] [INFO ] Invariant cache hit.
[2024-05-28 05:39:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:39:51] [INFO ] Performed 512/688 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 05:39:55] [INFO ] Implicit Places using invariants and state equation in 36152 ms returned []
Implicit Place search using SMT with State Equation took 36825 ms to find 0 implicit places.
Running 2664 sub problems to find dead transitions.
[2024-05-28 05:39:55] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 05:39:55] [INFO ] Invariant cache hit.
[2024-05-28 05:39:55] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-05-28 05:40:40] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-28 05:40:42] [INFO ] Deduced a trap composed of 122 places in 184 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/3322 variables, and 37 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2664/1410 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-05-28 05:41:00] [INFO ] Deduced a trap composed of 94 places in 499 ms of which 3 ms to minimize.
[2024-05-28 05:41:00] [INFO ] Deduced a trap composed of 94 places in 513 ms of which 3 ms to minimize.
[2024-05-28 05:41:01] [INFO ] Deduced a trap composed of 35 places in 565 ms of which 4 ms to minimize.
[2024-05-28 05:41:01] [INFO ] Deduced a trap composed of 47 places in 555 ms of which 4 ms to minimize.
[2024-05-28 05:41:01] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2024-05-28 05:41:02] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-05-28 05:41:02] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/3322 variables, and 44 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1410 constraints, Known Traps: 9/9 constraints]
After SMT, in 79684ms problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 79730ms
Finished structural reductions in LTL mode , in 1 iterations and 156232 ms. Remains : 688/688 places, 2670/2670 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-05
Stuttering criterion allowed to conclude after 380 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-05 finished in 156387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1&&F(p2)))))'
Support contains 15 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 688 transition count 2622
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 640 transition count 2622
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 96 place count 640 transition count 2538
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 264 place count 556 transition count 2538
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 553 transition count 2535
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 553 transition count 2535
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 402 place count 487 transition count 2469
Applied a total of 402 rules in 185 ms. Remains 487 /688 variables (removed 201) and now considering 2469/2670 (removed 201) transitions.
Running 2463 sub problems to find dead transitions.
[2024-05-28 05:41:15] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
// Phase 1: matrix 2433 rows 487 cols
[2024-05-28 05:41:15] [INFO ] Computed 46 invariants in 80 ms
[2024-05-28 05:41:15] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-05-28 05:41:55] [INFO ] Deduced a trap composed of 15 places in 342 ms of which 1 ms to minimize.
[2024-05-28 05:41:56] [INFO ] Deduced a trap composed of 67 places in 322 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/2920 variables, and 41 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2463/1209 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-05-28 05:42:03] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 2 ms to minimize.
[2024-05-28 05:42:03] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 1 ms to minimize.
[2024-05-28 05:42:03] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-28 05:42:03] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/2920 variables, and 45 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1209 constraints, Known Traps: 6/6 constraints]
After SMT, in 62813ms problems are : Problem set: 0 solved, 2463 unsolved
Search for dead transitions found 0 dead transitions in 62837ms
[2024-05-28 05:42:18] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-05-28 05:42:18] [INFO ] Invariant cache hit.
[2024-05-28 05:42:19] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-28 05:42:19] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-05-28 05:42:19] [INFO ] Invariant cache hit.
[2024-05-28 05:42:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:42:51] [INFO ] Performed 471/487 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 05:42:52] [INFO ] Implicit Places using invariants and state equation in 32953 ms returned []
Implicit Place search using SMT with State Equation took 33683 ms to find 0 implicit places.
[2024-05-28 05:42:52] [INFO ] Redundant transitions in 203 ms returned []
Running 2463 sub problems to find dead transitions.
[2024-05-28 05:42:52] [INFO ] Flow matrix only has 2433 transitions (discarded 36 similar events)
[2024-05-28 05:42:52] [INFO ] Invariant cache hit.
[2024-05-28 05:42:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-05-28 05:43:29] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 1 ms to minimize.
[2024-05-28 05:43:30] [INFO ] Deduced a trap composed of 67 places in 301 ms of which 2 ms to minimize.
[2024-05-28 05:43:30] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 2.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/2920 variables, and 42 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2463/1209 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 2463 unsolved
[2024-05-28 05:43:46] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-05-28 05:43:46] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2024-05-28 05:43:46] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-28 05:43:46] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 0 ms to minimize.
[2024-05-28 05:43:46] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-28 05:43:59] [INFO ] Deduced a trap composed of 157 places in 248 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/2920 variables, and 48 constraints, problems are : Problem set: 0 solved, 2463 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/487 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1209 constraints, Known Traps: 9/9 constraints]
After SMT, in 79498ms problems are : Problem set: 0 solved, 2463 unsolved
Search for dead transitions found 0 dead transitions in 79526ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/688 places, 2469/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176453 ms. Remains : 487/688 places, 2469/2670 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-06
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-06 finished in 176578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 547 transition count 2529
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 475 transition count 2457
Applied a total of 426 rules in 204 ms. Remains 475 /688 variables (removed 213) and now considering 2457/2670 (removed 213) transitions.
Running 2451 sub problems to find dead transitions.
[2024-05-28 05:44:12] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
// Phase 1: matrix 2421 rows 475 cols
[2024-05-28 05:44:12] [INFO ] Computed 46 invariants in 43 ms
[2024-05-28 05:44:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:44:47] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 05:44:48] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-28 05:44:50] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 38 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:45:02] [INFO ] Deduced a trap composed of 59 places in 522 ms of which 3 ms to minimize.
[2024-05-28 05:45:02] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 1 ms to minimize.
[2024-05-28 05:45:02] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 59990ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 60014ms
[2024-05-28 05:45:12] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:45:12] [INFO ] Invariant cache hit.
[2024-05-28 05:45:13] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-28 05:45:13] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:45:13] [INFO ] Invariant cache hit.
[2024-05-28 05:45:14] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:45:42] [INFO ] Implicit Places using invariants and state equation in 29514 ms returned []
Implicit Place search using SMT with State Equation took 30199 ms to find 0 implicit places.
[2024-05-28 05:45:42] [INFO ] Redundant transitions in 143 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-05-28 05:45:42] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:45:42] [INFO ] Invariant cache hit.
[2024-05-28 05:45:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:46:19] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-28 05:46:22] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:46:35] [INFO ] Deduced a trap composed of 29 places in 506 ms of which 2 ms to minimize.
[2024-05-28 05:46:35] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-05-28 05:46:35] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 0 ms to minimize.
[2024-05-28 05:46:35] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:47:01] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-28 05:47:01] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 43 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 8/8 constraints]
After SMT, in 79591ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 79617ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/688 places, 2457/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170201 ms. Remains : 475/688 places, 2457/2670 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 1120 reset in 810 ms.
Product exploration explored 100000 steps with 1160 reset in 805 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 : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3766 steps (43 resets) in 46 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 2457/2457 transitions.
Applied a total of 0 rules in 45 ms. Remains 475 /475 variables (removed 0) and now considering 2457/2457 (removed 0) transitions.
Running 2451 sub problems to find dead transitions.
[2024-05-28 05:47:04] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:47:04] [INFO ] Invariant cache hit.
[2024-05-28 05:47:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:47:40] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-28 05:47:42] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:47:47] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 2 ms to minimize.
[2024-05-28 05:47:47] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-28 05:47:47] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-28 05:47:48] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
[2024-05-28 05:48:04] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:48:04] [INFO ] Invariant cache hit.
[2024-05-28 05:48:05] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-28 05:48:05] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:48:05] [INFO ] Invariant cache hit.
[2024-05-28 05:48:06] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:48:34] [INFO ] Implicit Places using invariants and state equation in 29087 ms returned []
Implicit Place search using SMT with State Equation took 29698 ms to find 0 implicit places.
[2024-05-28 05:48:34] [INFO ] Redundant transitions in 108 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-05-28 05:48:34] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:48:34] [INFO ] Invariant cache hit.
[2024-05-28 05:48:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:49:10] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-28 05:49:12] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:49:27] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 3 ms to minimize.
[2024-05-28 05:49:27] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-28 05:49:27] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-28 05:49:27] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 80065ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 80105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 170070 ms. Remains : 475/475 places, 2457/2457 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1200 steps (17 resets) in 18 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1118 reset in 753 ms.
Product exploration explored 100000 steps with 1165 reset in 770 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 2457/2457 transitions.
Applied a total of 0 rules in 43 ms. Remains 475 /475 variables (removed 0) and now considering 2457/2457 (removed 0) transitions.
Running 2451 sub problems to find dead transitions.
[2024-05-28 05:49:56] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:49:56] [INFO ] Invariant cache hit.
[2024-05-28 05:49:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:50:33] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-28 05:50:36] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:50:39] [INFO ] Deduced a trap composed of 29 places in 418 ms of which 2 ms to minimize.
[2024-05-28 05:50:39] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2024-05-28 05:50:39] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-05-28 05:50:39] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 41 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 6/6 constraints]
After SMT, in 59897ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 59918ms
[2024-05-28 05:50:56] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:50:56] [INFO ] Invariant cache hit.
[2024-05-28 05:50:57] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-28 05:50:57] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:50:57] [INFO ] Invariant cache hit.
[2024-05-28 05:50:58] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:51:25] [INFO ] Implicit Places using invariants and state equation in 28464 ms returned []
Implicit Place search using SMT with State Equation took 29117 ms to find 0 implicit places.
[2024-05-28 05:51:25] [INFO ] Redundant transitions in 149 ms returned []
Running 2451 sub problems to find dead transitions.
[2024-05-28 05:51:25] [INFO ] Flow matrix only has 2421 transitions (discarded 36 similar events)
[2024-05-28 05:51:25] [INFO ] Invariant cache hit.
[2024-05-28 05:51:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:52:01] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-28 05:52:04] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/2896 variables, and 37 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2451/1197 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:52:18] [INFO ] Deduced a trap composed of 29 places in 467 ms of which 2 ms to minimize.
[2024-05-28 05:52:18] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-28 05:52:18] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-28 05:52:19] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2451 unsolved
[2024-05-28 05:52:43] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-28 05:52:44] [INFO ] Deduced a trap composed of 35 places in 418 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 10)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 6)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 3)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 8)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/2896 variables, and 43 constraints, problems are : Problem set: 0 solved, 2451 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/475 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1197 constraints, Known Traps: 8/8 constraints]
After SMT, in 79792ms problems are : Problem set: 0 solved, 2451 unsolved
Search for dead transitions found 0 dead transitions in 79819ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 169066 ms. Remains : 475/475 places, 2457/2457 transitions.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-08 finished in 513698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 688 transition count 2617
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 635 transition count 2617
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 106 place count 635 transition count 2533
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 548 transition count 2530
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 548 transition count 2530
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 420 place count 478 transition count 2460
Applied a total of 420 rules in 179 ms. Remains 478 /688 variables (removed 210) and now considering 2460/2670 (removed 210) transitions.
Running 2454 sub problems to find dead transitions.
[2024-05-28 05:52:46] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
// Phase 1: matrix 2424 rows 478 cols
[2024-05-28 05:52:46] [INFO ] Computed 46 invariants in 67 ms
[2024-05-28 05:52:46] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:53:22] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-28 05:53:24] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:53:29] [INFO ] Deduced a trap composed of 58 places in 393 ms of which 2 ms to minimize.
[2024-05-28 05:53:29] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-28 05:53:33] [INFO ] Deduced a trap composed of 30 places in 442 ms of which 3 ms to minimize.
[2024-05-28 05:53:33] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-28 05:53:33] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
(s290 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 3)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 10)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 5)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 3)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 42 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 7/7 constraints]
After SMT, in 59985ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 60008ms
[2024-05-28 05:53:46] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:53:46] [INFO ] Invariant cache hit.
[2024-05-28 05:53:46] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-28 05:53:46] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:53:46] [INFO ] Invariant cache hit.
[2024-05-28 05:53:48] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:54:17] [INFO ] Implicit Places using invariants and state equation in 30360 ms returned []
Implicit Place search using SMT with State Equation took 30956 ms to find 0 implicit places.
[2024-05-28 05:54:17] [INFO ] Redundant transitions in 83 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-05-28 05:54:17] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:54:17] [INFO ] Invariant cache hit.
[2024-05-28 05:54:17] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:54:52] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-28 05:54:54] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:55:09] [INFO ] Deduced a trap composed of 38 places in 474 ms of which 2 ms to minimize.
[2024-05-28 05:55:09] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
[2024-05-28 05:55:09] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-28 05:55:21] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-28 05:55:21] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-28 05:55:22] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:55:35] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 44 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 9/9 constraints]
After SMT, in 79921ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 79944ms
Starting structural reductions in SI_LTL mode, iteration 1 : 478/688 places, 2460/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171186 ms. Remains : 478/688 places, 2460/2670 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-09
Product exploration explored 100000 steps with 1068 reset in 781 ms.
Product exploration explored 100000 steps with 1046 reset in 787 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 : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 4739 steps (49 resets) in 58 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 2460/2460 transitions.
Applied a total of 0 rules in 44 ms. Remains 478 /478 variables (removed 0) and now considering 2460/2460 (removed 0) transitions.
Running 2454 sub problems to find dead transitions.
[2024-05-28 05:55:39] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:55:39] [INFO ] Invariant cache hit.
[2024-05-28 05:55:39] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:56:15] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-28 05:56:16] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:56:21] [INFO ] Deduced a trap composed of 38 places in 395 ms of which 2 ms to minimize.
[2024-05-28 05:56:21] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-28 05:56:21] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-28 05:56:34] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-28 05:56:34] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 0 ms to minimize.
[2024-05-28 05:56:34] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 43 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 8/8 constraints]
After SMT, in 59790ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 59816ms
[2024-05-28 05:56:38] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:56:38] [INFO ] Invariant cache hit.
[2024-05-28 05:56:39] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-28 05:56:39] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:56:39] [INFO ] Invariant cache hit.
[2024-05-28 05:56:40] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:57:10] [INFO ] Implicit Places using invariants and state equation in 31360 ms returned []
Implicit Place search using SMT with State Equation took 31950 ms to find 0 implicit places.
[2024-05-28 05:57:10] [INFO ] Redundant transitions in 86 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-05-28 05:57:11] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:57:11] [INFO ] Invariant cache hit.
[2024-05-28 05:57:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:57:47] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-28 05:57:48] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:58:03] [INFO ] Deduced a trap composed of 38 places in 410 ms of which 2 ms to minimize.
[2024-05-28 05:58:03] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-28 05:58:03] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 0 ms to minimize.
[2024-05-28 05:58:15] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-28 05:58:15] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-28 05:58:15] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:58:30] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 44 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 9/9 constraints]
After SMT, in 80218ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 80261ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172185 ms. Remains : 478/478 places, 2460/2460 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 5074 steps (49 resets) in 49 ms. (101 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1065 reset in 783 ms.
Product exploration explored 100000 steps with 1102 reset in 802 ms.
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 2460/2460 transitions.
Applied a total of 0 rules in 44 ms. Remains 478 /478 variables (removed 0) and now considering 2460/2460 (removed 0) transitions.
Running 2454 sub problems to find dead transitions.
[2024-05-28 05:58:33] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:58:33] [INFO ] Invariant cache hit.
[2024-05-28 05:58:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:59:09] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-28 05:59:10] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:59:16] [INFO ] Deduced a trap composed of 38 places in 404 ms of which 2 ms to minimize.
[2024-05-28 05:59:16] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 1 ms to minimize.
[2024-05-28 05:59:16] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 0 ms to minimize.
[2024-05-28 05:59:28] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-28 05:59:28] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-05-28 05:59:28] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 43 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 8/8 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
[2024-05-28 05:59:33] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:59:33] [INFO ] Invariant cache hit.
[2024-05-28 05:59:34] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-28 05:59:34] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 05:59:34] [INFO ] Invariant cache hit.
[2024-05-28 05:59:35] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 06:00:04] [INFO ] Implicit Places using invariants and state equation in 30324 ms returned []
Implicit Place search using SMT with State Equation took 30917 ms to find 0 implicit places.
[2024-05-28 06:00:04] [INFO ] Redundant transitions in 82 ms returned []
Running 2454 sub problems to find dead transitions.
[2024-05-28 06:00:04] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-05-28 06:00:04] [INFO ] Invariant cache hit.
[2024-05-28 06:00:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 06:00:42] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-28 06:00:43] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/2902 variables, and 37 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 06:00:57] [INFO ] Deduced a trap composed of 38 places in 403 ms of which 2 ms to minimize.
[2024-05-28 06:00:57] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-28 06:00:57] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2024-05-28 06:01:09] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-28 06:01:09] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2024-05-28 06:01:09] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 06:01:23] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/2902 variables, and 44 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 15/24 constraints, State Equation: 0/478 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 9/9 constraints]
After SMT, in 80630ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 80672ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172277 ms. Remains : 478/478 places, 2460/2460 transitions.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-09 finished in 519584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 688 transition count 2623
Reduce places removed 47 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 100 place count 641 transition count 2617
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 635 transition count 2617
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 106 place count 635 transition count 2533
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 274 place count 551 transition count 2533
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 278 place count 547 transition count 2529
Iterating global reduction 3 with 4 rules applied. Total rules applied 282 place count 547 transition count 2529
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 424 place count 476 transition count 2458
Applied a total of 424 rules in 218 ms. Remains 476 /688 variables (removed 212) and now considering 2458/2670 (removed 212) transitions.
Running 2452 sub problems to find dead transitions.
[2024-05-28 06:01:25] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
// Phase 1: matrix 2422 rows 476 cols
[2024-05-28 06:01:25] [INFO ] Computed 46 invariants in 72 ms
[2024-05-28 06:01:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-05-28 06:02:01] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 06:02:01] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-28 06:02:01] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-28 06:02:02] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2024-05-28 06:02:02] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2898 variables, and 40 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2452/1198 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 4)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 3)
(s86 0)
(s87 0)
(s88 0)
(s90 1)
(s91 2)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 3)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 2)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 4)
(s122 1)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 4)
(s131 10)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 2)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 0)
(s158 2)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 0)
(s188 6)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 1)
(s198 2)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 4)
(s206 0)
(s207 0)
(s208 1)
(s209 4)
(s210 1)
(s211 0)
(s212 3)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 3)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 1)
(s248 4)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 1)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 2)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 3)
(s270 0)
(s271 0)
(s272 1)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 4)
(s279 1)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 9)
(s320 2)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2898 variables, and 40 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1198 constraints, Known Traps: 5/5 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 2452 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
[2024-05-28 06:02:25] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-05-28 06:02:25] [INFO ] Invariant cache hit.
[2024-05-28 06:02:26] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-28 06:02:26] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-05-28 06:02:26] [INFO ] Invariant cache hit.
[2024-05-28 06:02:28] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 06:02:49] [INFO ] Implicit Places using invariants and state equation in 22496 ms returned []
Implicit Place search using SMT with State Equation took 23079 ms to find 0 implicit places.
[2024-05-28 06:02:49] [INFO ] Redundant transitions in 125 ms returned []
Running 2452 sub problems to find dead transitions.
[2024-05-28 06:02:49] [INFO ] Flow matrix only has 2422 transitions (discarded 36 similar events)
[2024-05-28 06:02:49] [INFO ] Invariant cache hit.
[2024-05-28 06:02:49] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-05-28 06:03:24] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-28 06:03:24] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-28 06:03:25] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2898 variables, and 38 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2452/1198 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
[2024-05-28 06:03:44] [INFO ] Deduced a trap composed of 59 places in 457 ms of which 3 ms to minimize.
[2024-05-28 06:03:45] [INFO ] Deduced a trap composed of 42 places in 549 ms of which 3 ms to minimize.
[2024-05-28 06:03:45] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 0 ms to minimize.
[2024-05-28 06:03:46] [INFO ] Deduced a trap composed of 35 places in 529 ms of which 3 ms to minimize.
[2024-05-28 06:03:46] [INFO ] Deduced a trap composed of 29 places in 525 ms of which 2 ms to minimize.
[2024-05-28 06:03:47] [INFO ] Deduced a trap composed of 29 places in 496 ms of which 3 ms to minimize.
[2024-05-28 06:03:47] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-28 06:03:47] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 2452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2898 variables, and 46 constraints, problems are : Problem set: 0 solved, 2452 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1198 constraints, Known Traps: 11/11 constraints]
After SMT, in 79666ms problems are : Problem set: 0 solved, 2452 unsolved
Search for dead transitions found 0 dead transitions in 79692ms
Starting structural reductions in SI_LTL mode, iteration 1 : 476/688 places, 2458/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163370 ms. Remains : 476/688 places, 2458/2670 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-10
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-10 finished in 163566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||(p1&&F(p0))))'
Support contains 4 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 688 transition count 2621
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 639 transition count 2620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 638 transition count 2620
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 100 place count 638 transition count 2534
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 272 place count 552 transition count 2534
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 275 place count 549 transition count 2531
Iterating global reduction 3 with 3 rules applied. Total rules applied 278 place count 549 transition count 2531
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 406 place count 485 transition count 2467
Applied a total of 406 rules in 175 ms. Remains 485 /688 variables (removed 203) and now considering 2467/2670 (removed 203) transitions.
Running 2461 sub problems to find dead transitions.
[2024-05-28 06:04:09] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-05-28 06:04:09] [INFO ] Computed 46 invariants in 48 ms
[2024-05-28 06:04:09] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:04:45] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-28 06:04:47] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 37 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:04:51] [INFO ] Deduced a trap composed of 29 places in 515 ms of which 2 ms to minimize.
[2024-05-28 06:04:52] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 1 ms to minimize.
[2024-05-28 06:04:52] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2024-05-28 06:04:52] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:04:52] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-28 06:04:56] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-28 06:04:56] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-28 06:04:59] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 45 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 10/10 constraints]
After SMT, in 59819ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 59842ms
[2024-05-28 06:05:09] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:05:09] [INFO ] Invariant cache hit.
[2024-05-28 06:05:09] [INFO ] Implicit Places using invariants in 739 ms returned []
[2024-05-28 06:05:09] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:05:09] [INFO ] Invariant cache hit.
[2024-05-28 06:05:11] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 06:05:42] [INFO ] Performed 412/485 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 06:05:45] [INFO ] Implicit Places using invariants and state equation in 35781 ms returned []
Implicit Place search using SMT with State Equation took 36523 ms to find 0 implicit places.
[2024-05-28 06:05:45] [INFO ] Redundant transitions in 89 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-05-28 06:05:45] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:05:45] [INFO ] Invariant cache hit.
[2024-05-28 06:05:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:06:22] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 06:06:22] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-28 06:06:22] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-28 06:06:23] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:06:39] [INFO ] Deduced a trap composed of 60 places in 498 ms of which 3 ms to minimize.
[2024-05-28 06:06:40] [INFO ] Deduced a trap composed of 58 places in 497 ms of which 3 ms to minimize.
[2024-05-28 06:06:40] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-05-28 06:06:40] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 29 places in 418 ms of which 2 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 35 places in 357 ms of which 2 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 54 places in 345 ms of which 3 ms to minimize.
[2024-05-28 06:06:53] [INFO ] Deduced a trap composed of 29 places in 330 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 79858ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 79880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 485/688 places, 2467/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176522 ms. Remains : 485/688 places, 2467/2670 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-11
Product exploration explored 100000 steps with 2006 reset in 1062 ms.
Product exploration explored 100000 steps with 1962 reset in 881 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (396 resets) in 690 ms. (57 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (62 resets) in 771 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (42 resets) in 531 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (52 resets) in 454 ms. (87 steps per ms) remains 3/3 properties
[2024-05-28 06:07:08] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:07:08] [INFO ] Invariant cache hit.
[2024-05-28 06:07:08] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 06:07:09] [INFO ] Deduced a trap composed of 35 places in 443 ms of which 5 ms to minimize.
[2024-05-28 06:07:09] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 6 ms to minimize.
[2024-05-28 06:07:09] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2024-05-28 06:07:09] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-28 06:07:09] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/2916 variables, and 533 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4323 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 1/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/2916 variables, and 534 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3688 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 8027ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 485 transition count 2455
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 473 transition count 2455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 473 transition count 2455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 472 transition count 2454
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 472 transition count 2454
Applied a total of 28 rules in 163 ms. Remains 472 /485 variables (removed 13) and now considering 2454/2467 (removed 13) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 06:07:17] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-05-28 06:07:17] [INFO ] Computed 46 invariants in 91 ms
[2024-05-28 06:07:17] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 06:07:55] [INFO ] Deduced a trap composed of 147 places in 377 ms of which 3 ms to minimize.
[2024-05-28 06:07:55] [INFO ] Deduced a trap composed of 139 places in 305 ms of which 2 ms to minimize.
[2024-05-28 06:07:56] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2024-05-28 06:07:56] [INFO ] Deduced a trap composed of 57 places in 348 ms of which 2 ms to minimize.
[2024-05-28 06:07:58] [INFO ] Deduced a trap composed of 148 places in 368 ms of which 2 ms to minimize.
[2024-05-28 06:07:58] [INFO ] Deduced a trap composed of 157 places in 417 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 2.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 45 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1107 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 06:08:01] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 2 ms to minimize.
[2024-05-28 06:08:01] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2024-05-28 06:08:02] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 35 places in 367 ms of which 3 ms to minimize.
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 142 places in 339 ms of which 2 ms to minimize.
[2024-05-28 06:08:09] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 3 ms to minimize.
[2024-05-28 06:08:14] [INFO ] Deduced a trap composed of 152 places in 345 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1107 constraints, Known Traps: 13/13 constraints]
After SMT, in 61617ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 61639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61807 ms. Remains : 472/485 places, 2454/2467 transitions.
RANDOM walk for 40000 steps (413 resets) in 1368 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (57 resets) in 460 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (37 resets) in 470 ms. (84 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 68754 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 68754 steps, saw 30541 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-28 06:08:22] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 06:08:22] [INFO ] Invariant cache hit.
[2024-05-28 06:08:22] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 06:08:23] [INFO ] Deduced a trap composed of 34 places in 486 ms of which 3 ms to minimize.
[2024-05-28 06:08:23] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 2 ms to minimize.
[2024-05-28 06:08:23] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2024-05-28 06:08:23] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-28 06:08:23] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/470 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2418/2888 variables, 470/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2888 variables, 168/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/2890 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2890 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2890/2890 variables, and 691 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8577 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 06:08:31] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/470 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2888/2890 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11229 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 470/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 19821ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 283 ms.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 54 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 472/472 places, 2454/2454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 54 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
[2024-05-28 06:08:42] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 06:08:42] [INFO ] Invariant cache hit.
[2024-05-28 06:08:43] [INFO ] Implicit Places using invariants in 844 ms returned []
[2024-05-28 06:08:43] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 06:08:43] [INFO ] Invariant cache hit.
[2024-05-28 06:08:45] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 06:09:08] [INFO ] Implicit Places using invariants and state equation in 24882 ms returned []
Implicit Place search using SMT with State Equation took 25728 ms to find 0 implicit places.
[2024-05-28 06:09:08] [INFO ] Redundant transitions in 78 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 06:09:08] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 06:09:08] [INFO ] Invariant cache hit.
[2024-05-28 06:09:08] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 06:09:46] [INFO ] Deduced a trap composed of 147 places in 344 ms of which 2 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 139 places in 330 ms of which 4 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 4 ms to minimize.
[2024-05-28 06:09:48] [INFO ] Deduced a trap composed of 57 places in 368 ms of which 2 ms to minimize.
[2024-05-28 06:09:49] [INFO ] Deduced a trap composed of 149 places in 353 ms of which 3 ms to minimize.
[2024-05-28 06:09:49] [INFO ] Deduced a trap composed of 161 places in 422 ms of which 3 ms to minimize.
[2024-05-28 06:09:49] [INFO ] Deduced a trap composed of 158 places in 386 ms of which 2 ms to minimize.
[2024-05-28 06:09:50] [INFO ] Deduced a trap composed of 148 places in 300 ms of which 2 ms to minimize.
[2024-05-28 06:09:51] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2024-05-28 06:09:54] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 3 ms to minimize.
[2024-05-28 06:10:00] [INFO ] Deduced a trap composed of 161 places in 277 ms of which 3 ms to minimize.
SMT process timed out in 52194ms, After SMT, problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 52236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78118 ms. Remains : 472/472 places, 2454/2454 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 168 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Applied a total of 0 rules in 44 ms. Remains 485 /485 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Running 2461 sub problems to find dead transitions.
[2024-05-28 06:10:01] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-05-28 06:10:01] [INFO ] Computed 46 invariants in 75 ms
[2024-05-28 06:10:01] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:10:38] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-28 06:10:40] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 37 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:10:44] [INFO ] Deduced a trap composed of 29 places in 428 ms of which 3 ms to minimize.
[2024-05-28 06:10:44] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2024-05-28 06:10:44] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2024-05-28 06:10:44] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 0 ms to minimize.
[2024-05-28 06:10:45] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:10:48] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-28 06:10:48] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-28 06:10:52] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 45 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 10/10 constraints]
After SMT, in 60668ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 60691ms
[2024-05-28 06:11:01] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:11:01] [INFO ] Invariant cache hit.
[2024-05-28 06:11:02] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-05-28 06:11:02] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:11:02] [INFO ] Invariant cache hit.
[2024-05-28 06:11:04] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 06:11:35] [INFO ] Performed 425/485 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 06:11:37] [INFO ] Implicit Places using invariants and state equation in 34896 ms returned []
Implicit Place search using SMT with State Equation took 35500 ms to find 0 implicit places.
[2024-05-28 06:11:37] [INFO ] Redundant transitions in 86 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-05-28 06:11:37] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:11:37] [INFO ] Invariant cache hit.
[2024-05-28 06:11:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:12:15] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-28 06:12:15] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-28 06:12:15] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-28 06:12:16] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:12:31] [INFO ] Deduced a trap composed of 60 places in 433 ms of which 2 ms to minimize.
[2024-05-28 06:12:32] [INFO ] Deduced a trap composed of 58 places in 458 ms of which 3 ms to minimize.
[2024-05-28 06:12:32] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-05-28 06:12:32] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 0 ms to minimize.
[2024-05-28 06:12:33] [INFO ] Deduced a trap composed of 29 places in 406 ms of which 2 ms to minimize.
[2024-05-28 06:12:33] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-28 06:12:45] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 2 ms to minimize.
[2024-05-28 06:12:45] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 2 ms to minimize.
[2024-05-28 06:12:45] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 80236ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 80259ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 176601 ms. Remains : 485/485 places, 2467/2467 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 92 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40001 steps (383 resets) in 1247 ms. (32 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (51 resets) in 483 ms. (82 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (41 resets) in 398 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (58 resets) in 380 ms. (104 steps per ms) remains 3/3 properties
[2024-05-28 06:12:58] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:12:58] [INFO ] Invariant cache hit.
[2024-05-28 06:12:58] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 06:12:59] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 3 ms to minimize.
[2024-05-28 06:12:59] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-05-28 06:12:59] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2024-05-28 06:12:59] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-28 06:12:59] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2914/2916 variables, and 533 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4061 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 330/340 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/415 variables, 19/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 68/483 variables, 23/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 06:13:03] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 1/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/2916 variables, and 534 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3777 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 483/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 7860ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 485 transition count 2455
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 473 transition count 2455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 473 transition count 2455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 472 transition count 2454
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 472 transition count 2454
Applied a total of 28 rules in 202 ms. Remains 472 /485 variables (removed 13) and now considering 2454/2467 (removed 13) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 06:13:07] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-05-28 06:13:07] [INFO ] Computed 46 invariants in 83 ms
[2024-05-28 06:13:07] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 06:13:46] [INFO ] Deduced a trap composed of 147 places in 343 ms of which 2 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 139 places in 293 ms of which 2 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 1 ms to minimize.
[2024-05-28 06:13:48] [INFO ] Deduced a trap composed of 57 places in 387 ms of which 2 ms to minimize.
[2024-05-28 06:13:49] [INFO ] Deduced a trap composed of 148 places in 323 ms of which 2 ms to minimize.
[2024-05-28 06:13:49] [INFO ] Deduced a trap composed of 157 places in 305 ms of which 2 ms to minimize.
SMT process timed out in 42506ms, After SMT, problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 42532ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42739 ms. Remains : 472/485 places, 2454/2467 transitions.
RANDOM walk for 40000 steps (434 resets) in 1240 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 472 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (53 resets) in 437 ms. (91 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 76934 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 2
Probabilistic random walk after 76934 steps, saw 34170 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-28 06:13:53] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 06:13:53] [INFO ] Invariant cache hit.
[2024-05-28 06:13:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 06:13:53] [INFO ] Deduced a trap composed of 34 places in 453 ms of which 3 ms to minimize.
[2024-05-28 06:13:53] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2024-05-28 06:13:54] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 1 ms to minimize.
[2024-05-28 06:13:54] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-28 06:13:54] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/470 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2418/2888 variables, 470/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2888 variables, 168/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/2890 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2890 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2890 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2890/2890 variables, and 691 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6661 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 244/254 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/355 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/469 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 06:14:00] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/470 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2418/2888 variables, 470/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2888 variables, 168/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2888 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2888 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/2890 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2890 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2890 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2890 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2890/2890 variables, and 694 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9830 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 472/472 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 16508ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 197 ms.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 53 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 472/472 places, 2454/2454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 52 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
[2024-05-28 06:14:10] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 06:14:10] [INFO ] Invariant cache hit.
[2024-05-28 06:14:10] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-28 06:14:10] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 06:14:10] [INFO ] Invariant cache hit.
[2024-05-28 06:14:12] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 06:14:33] [INFO ] Implicit Places using invariants and state equation in 22770 ms returned []
Implicit Place search using SMT with State Equation took 23497 ms to find 0 implicit places.
[2024-05-28 06:14:33] [INFO ] Redundant transitions in 84 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 06:14:33] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 06:14:33] [INFO ] Invariant cache hit.
[2024-05-28 06:14:33] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 06:15:12] [INFO ] Deduced a trap composed of 147 places in 349 ms of which 2 ms to minimize.
[2024-05-28 06:15:13] [INFO ] Deduced a trap composed of 139 places in 346 ms of which 3 ms to minimize.
[2024-05-28 06:15:13] [INFO ] Deduced a trap composed of 39 places in 360 ms of which 1 ms to minimize.
[2024-05-28 06:15:14] [INFO ] Deduced a trap composed of 57 places in 431 ms of which 2 ms to minimize.
[2024-05-28 06:15:15] [INFO ] Deduced a trap composed of 149 places in 337 ms of which 2 ms to minimize.
[2024-05-28 06:15:16] [INFO ] Deduced a trap composed of 161 places in 369 ms of which 3 ms to minimize.
[2024-05-28 06:15:16] [INFO ] Deduced a trap composed of 158 places in 300 ms of which 2 ms to minimize.
[2024-05-28 06:15:17] [INFO ] Deduced a trap composed of 148 places in 287 ms of which 2 ms to minimize.
[2024-05-28 06:15:17] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2024-05-28 06:15:20] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 49 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1107 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 06:15:30] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:15:30] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-05-28 06:15:30] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-28 06:15:30] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2024-05-28 06:15:31] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-28 06:15:31] [INFO ] Deduced a trap composed of 39 places in 399 ms of which 4 ms to minimize.
[2024-05-28 06:15:33] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-28 06:15:38] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 3 ms to minimize.
[2024-05-28 06:15:38] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 3 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 154 places in 370 ms of which 4 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 160 places in 366 ms of which 3 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 153 places in 354 ms of which 3 ms to minimize.
[2024-05-28 06:15:48] [INFO ] Deduced a trap composed of 154 places in 307 ms of which 3 ms to minimize.
[2024-05-28 06:15:48] [INFO ] Deduced a trap composed of 153 places in 263 ms of which 2 ms to minimize.
[2024-05-28 06:15:48] [INFO ] Deduced a trap composed of 152 places in 267 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 64 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/1107 constraints, Known Traps: 25/25 constraints]
After SMT, in 82942ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 82965ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106608 ms. Remains : 472/472 places, 2454/2454 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 321 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1984 reset in 864 ms.
Product exploration explored 100000 steps with 1945 reset in 875 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 2467/2467 transitions.
Applied a total of 0 rules in 41 ms. Remains 485 /485 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Running 2461 sub problems to find dead transitions.
[2024-05-28 06:15:59] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
// Phase 1: matrix 2431 rows 485 cols
[2024-05-28 06:15:59] [INFO ] Computed 46 invariants in 39 ms
[2024-05-28 06:15:59] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:16:40] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 36 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 65 places in 472 ms of which 2 ms to minimize.
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 29 places in 486 ms of which 2 ms to minimize.
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 2 ms to minimize.
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-28 06:16:45] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-28 06:16:54] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-05-28 06:16:54] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-28 06:17:00] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 44 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 9/9 constraints]
After SMT, in 62408ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 62457ms
[2024-05-28 06:17:01] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:17:01] [INFO ] Invariant cache hit.
[2024-05-28 06:17:02] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-28 06:17:02] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:17:02] [INFO ] Invariant cache hit.
[2024-05-28 06:17:04] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 06:17:35] [INFO ] Performed 427/485 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 06:17:37] [INFO ] Implicit Places using invariants and state equation in 34834 ms returned []
Implicit Place search using SMT with State Equation took 35558 ms to find 0 implicit places.
[2024-05-28 06:17:37] [INFO ] Redundant transitions in 150 ms returned []
Running 2461 sub problems to find dead transitions.
[2024-05-28 06:17:37] [INFO ] Flow matrix only has 2431 transitions (discarded 36 similar events)
[2024-05-28 06:17:37] [INFO ] Invariant cache hit.
[2024-05-28 06:17:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:18:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 06:18:15] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-28 06:18:15] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/2916 variables, and 39 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2461/1207 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2461 unsolved
[2024-05-28 06:18:33] [INFO ] Deduced a trap composed of 60 places in 551 ms of which 3 ms to minimize.
[2024-05-28 06:18:34] [INFO ] Deduced a trap composed of 58 places in 588 ms of which 2 ms to minimize.
[2024-05-28 06:18:34] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2024-05-28 06:18:34] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-28 06:18:35] [INFO ] Deduced a trap composed of 29 places in 483 ms of which 3 ms to minimize.
[2024-05-28 06:18:35] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-28 06:18:48] [INFO ] Deduced a trap composed of 35 places in 434 ms of which 3 ms to minimize.
[2024-05-28 06:18:48] [INFO ] Deduced a trap composed of 54 places in 368 ms of which 2 ms to minimize.
[2024-05-28 06:18:49] [INFO ] Deduced a trap composed of 29 places in 291 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/2916 variables, and 48 constraints, problems are : Problem set: 0 solved, 2461 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/485 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1207 constraints, Known Traps: 13/13 constraints]
After SMT, in 81716ms problems are : Problem set: 0 solved, 2461 unsolved
Search for dead transitions found 0 dead transitions in 81742ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 179979 ms. Remains : 485/485 places, 2467/2467 transitions.
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-11 finished in 890281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&X(p1)))))))'
Support contains 4 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 71 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 06:18:59] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-05-28 06:18:59] [INFO ] Computed 46 invariants in 91 ms
[2024-05-28 06:18:59] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40815ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40839ms
[2024-05-28 06:19:40] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 06:19:40] [INFO ] Invariant cache hit.
[2024-05-28 06:19:41] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-28 06:19:41] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 06:19:41] [INFO ] Invariant cache hit.
[2024-05-28 06:19:42] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 06:20:03] [INFO ] Implicit Places using invariants and state equation in 22244 ms returned []
Implicit Place search using SMT with State Equation took 23119 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 06:20:03] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 06:20:03] [INFO ] Invariant cache hit.
[2024-05-28 06:20:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 06:20:48] [INFO ] Deduced a trap composed of 182 places in 361 ms of which 4 ms to minimize.
[2024-05-28 06:20:48] [INFO ] Deduced a trap composed of 146 places in 337 ms of which 4 ms to minimize.
[2024-05-28 06:20:48] [INFO ] Deduced a trap composed of 145 places in 306 ms of which 3 ms to minimize.
[2024-05-28 06:20:50] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 1 ms to minimize.
[2024-05-28 06:20:51] [INFO ] Deduced a trap composed of 324 places in 446 ms of which 4 ms to minimize.
[2024-05-28 06:20:51] [INFO ] Deduced a trap composed of 3 places in 436 ms of which 4 ms to minimize.
[2024-05-28 06:20:53] [INFO ] Deduced a trap composed of 319 places in 468 ms of which 15 ms to minimize.
SMT process timed out in 50426ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 50449ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114491 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J06T06-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 83 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T06-LTLCardinality-12 finished in 114720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||(p1&&F(p0))))'
[2024-05-28 06:20:54] [INFO ] Flatten gal took : 186 ms
[2024-05-28 06:20:54] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 06:20:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 688 places, 2670 transitions and 15834 arcs took 28 ms.
Total runtime 3236385 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 688
TRANSITIONS: 2670
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.097s, Sys 0.007s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.012s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2784
MODEL NAME: /home/mcc/execution/417/model
688 places, 2670 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-PT-S06J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S06J06T06, 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 r289-tajo-171654445700347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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