Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 5.5K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 4.1M Jun 7 06:26 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 ResIsolation-PT-N08P1-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717748465125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N08P1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-07 08:21:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 08:21:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:21:08] [INFO ] Load time of PNML (sax parser for PT used): 937 ms
[2024-06-07 08:21:08] [INFO ] Transformed 270 places.
[2024-06-07 08:21:08] [INFO ] Transformed 4850 transitions.
[2024-06-07 08:21:08] [INFO ] Found NUPN structural information;
[2024-06-07 08:21:08] [INFO ] Parsed PT model containing 270 places and 4850 transitions and 83436 arcs in 1283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResIsolation-PT-N08P1-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 4850/4850 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 261 transition count 4850
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 160 place count 110 transition count 4699
Iterating global reduction 1 with 151 rules applied. Total rules applied 311 place count 110 transition count 4699
Ensure Unique test removed 773 transitions
Reduce isomorphic transitions removed 773 transitions.
Iterating post reduction 1 with 773 rules applied. Total rules applied 1084 place count 110 transition count 3926
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1100 place count 94 transition count 3910
Iterating global reduction 2 with 16 rules applied. Total rules applied 1116 place count 94 transition count 3910
Applied a total of 1116 rules in 201 ms. Remains 94 /270 variables (removed 176) and now considering 3910/4850 (removed 940) transitions.
// Phase 1: matrix 3910 rows 94 cols
[2024-06-07 08:21:09] [INFO ] Computed 0 invariants in 141 ms
[2024-06-07 08:21:09] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-07 08:21:09] [INFO ] Invariant cache hit.
[2024-06-07 08:21:12] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned []
Implicit Place search using SMT with State Equation took 2878 ms to find 0 implicit places.
Running 3909 sub problems to find dead transitions.
[2024-06-07 08:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3909 unsolved
SMT process timed out in 98463ms, After SMT, problems are : Problem set: 0 solved, 3909 unsolved
Search for dead transitions found 0 dead transitions in 98646ms
Starting structural reductions in LTL mode, iteration 1 : 94/270 places, 3910/4850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101812 ms. Remains : 94/270 places, 3910/4850 transitions.
Support contains 39 out of 94 places after structural reductions.
[2024-06-07 08:22:52] [INFO ] Flatten gal took : 1108 ms
[2024-06-07 08:22:53] [INFO ] Flatten gal took : 681 ms
[2024-06-07 08:22:54] [INFO ] Input system was already deterministic with 3910 transitions.
RANDOM walk for 40000 steps (8 resets) in 3805 ms. (10 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 202536 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :2 out of 26
Probabilistic random walk after 202536 steps, saw 34378 distinct states, run finished after 3007 ms. (steps per millisecond=67 ) properties seen :2
[2024-06-07 08:22:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 3858/3897 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3897 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 42/3939 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3939 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/3966 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3966 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SMT process timed out in 5827ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.58 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 92 transition count 3885
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 38 place count 78 transition count 3885
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 86 place count 54 transition count 3861
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 54 transition count 3859
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 52 transition count 3859
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 51 transition count 3858
Applied a total of 91 rules in 1212 ms. Remains 51 /94 variables (removed 43) and now considering 3858/3910 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1219 ms. Remains : 51/94 places, 3858/3910 transitions.
RANDOM walk for 40000 steps (8 resets) in 3383 ms. (11 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (5 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (1 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (2 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (2 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (4 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (1 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (1 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (1 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 208501 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :3 out of 23
Probabilistic random walk after 208501 steps, saw 31384 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :3
// Phase 1: matrix 3858 rows 51 cols
[2024-06-07 08:23:10] [INFO ] Computed 9 invariants in 53 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 12/51 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 3858/3909 variables, 51/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3909/3909 variables, and 60 constraints, problems are : Problem set: 3 solved, 17 unsolved in 9301 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 15/51 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 3858/3909 variables, 51/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3909/3909 variables, and 60 constraints, problems are : Problem set: 3 solved, 17 unsolved in 7030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 17/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 16922ms problems are : Problem set: 3 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 9 properties in 4099 ms.
Support contains 26 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 3858/3858 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 3855
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 3855
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 48 transition count 3854
Applied a total of 7 rules in 1056 ms. Remains 48 /51 variables (removed 3) and now considering 3854/3858 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1058 ms. Remains : 48/51 places, 3854/3858 transitions.
RANDOM walk for 40000 steps (8 resets) in 2895 ms. (13 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 325 ms. (122 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 450 ms. (88 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 472 ms. (84 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
// Phase 1: matrix 3854 rows 48 cols
[2024-06-07 08:23:34] [INFO ] Computed 9 invariants in 41 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 23/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3854/3902 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3902 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/3902 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3902/3902 variables, and 57 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 23/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3854/3902 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3902 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/3902 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3902/3902 variables, and 57 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6905ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 6 properties in 917 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA ResIsolation-PT-N08P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.90 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(p0))&&((!p1||G(p1)) U X(p2))))'
Support contains 20 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 38 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:23:42] [INFO ] Computed 0 invariants in 74 ms
[2024-06-07 08:23:43] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-07 08:23:43] [INFO ] Invariant cache hit.
[2024-06-07 08:23:45] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:23:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
SMT process timed out in 95990ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 96070ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98534 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 540 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 1899 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-00 finished in 101078 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(G((X(G(!p1))||p0))))'
Support contains 10 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 70 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 08:25:23] [INFO ] Computed 0 invariants in 30 ms
[2024-06-07 08:25:24] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-07 08:25:24] [INFO ] Invariant cache hit.
[2024-06-07 08:25:26] [INFO ] Implicit Places using invariants and state equation in 2074 ms returned []
Implicit Place search using SMT with State Equation took 2517 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:25:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
SMT process timed out in 85212ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 85272ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87873 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1565 ms.
Product exploration explored 100000 steps with 0 reset in 1221 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.35 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 1278 ms. (31 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 463 ms. (86 steps per ms) remains 1/1 properties
[2024-06-07 08:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/3162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/3191 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/3213 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/3230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3230 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3232 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3232/3232 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1492 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/3162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/3191 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/3213 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/3230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3230 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3232 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3232/3232 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1863 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3398ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 195 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Applied a total of 0 rules in 28 ms. Remains 91 /91 variables (removed 0) and now considering 3141/3141 (removed 0) transitions.
[2024-06-07 08:26:59] [INFO ] Invariant cache hit.
[2024-06-07 08:26:59] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-06-07 08:26:59] [INFO ] Invariant cache hit.
[2024-06-07 08:27:01] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2285 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:27:01] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
SMT process timed out in 85591ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 85651ms
Finished structural reductions in LTL mode , in 1 iterations and 87976 ms. Remains : 91/91 places, 3141/3141 transitions.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.56 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 977 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 303367 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :1 out of 2
Probabilistic random walk after 303367 steps, saw 49215 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :1
[2024-06-07 08:28:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/3162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/3191 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/3213 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/3230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3230 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3232 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3232/3232 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2111 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/3162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/3191 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/3213 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/3230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3230 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3232 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3232/3232 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1639 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3805ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 143 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 135 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 1472 ms.
Product exploration explored 100000 steps with 0 reset in 1222 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 150 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.38 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 89 transition count 3139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 89 transition count 3137
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 89 transition count 3146
Deduced a syphon composed of 16 places in 2 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 89 transition count 3146
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 85 transition count 3142
Deduced a syphon composed of 12 places in 3 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 85 transition count 3142
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 46 place count 85 transition count 3143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 82 transition count 3139
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 82 transition count 3139
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 82 transition count 3174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 79 transition count 3168
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 79 transition count 3168
Deduced a syphon composed of 28 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 79 transition count 3167
Deduced a syphon composed of 28 places in 1 ms
Applied a total of 62 rules in 1449 ms. Remains 79 /91 variables (removed 12) and now considering 3167/3141 (removed -26) transitions.
[2024-06-07 08:28:52] [INFO ] Redundant transitions in 12066 ms returned []
Running 3151 sub problems to find dead transitions.
// Phase 1: matrix 3167 rows 79 cols
[2024-06-07 08:28:52] [INFO ] Computed 0 invariants in 26 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3151 unsolved
SMT process timed out in 83887ms, After SMT, problems are : Problem set: 0 solved, 3151 unsolved
Search for dead transitions found 0 dead transitions in 83923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/91 places, 3167/3141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97456 ms. Remains : 79/91 places, 3167/3141 transitions.
Built C files in :
/tmp/ltsmin4532057323877626353
[2024-06-07 08:30:16] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4532057323877626353
Running compilation step : cd /tmp/ltsmin4532057323877626353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4532057323877626353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4532057323877626353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Applied a total of 0 rules in 20 ms. Remains 91 /91 variables (removed 0) and now considering 3141/3141 (removed 0) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 08:30:19] [INFO ] Computed 0 invariants in 41 ms
[2024-06-07 08:30:20] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-07 08:30:20] [INFO ] Invariant cache hit.
[2024-06-07 08:30:22] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:30:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 1 (OVERLAPS) 3141/3231 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3231/3232 variables, and 90 constraints, problems are : Problem set: 0 solved, 3140 unsolved in 30083 ms.
Refiners :[State Equation: 90/91 constraints, PredecessorRefiner: 3140/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 1 (OVERLAPS) 3141/3231 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3231 variables, 56/146 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
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 Int declared 3231/3232 variables, and 146 constraints, problems are : Problem set: 0 solved, 3140 unsolved in 30081 ms.
Refiners :[State Equation: 90/91 constraints, PredecessorRefiner: 3140/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 116586ms problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 116639ms
Finished structural reductions in LTL mode , in 1 iterations and 119198 ms. Remains : 91/91 places, 3141/3141 transitions.
Built C files in :
/tmp/ltsmin5749379241944898701
[2024-06-07 08:32:18] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5749379241944898701
Running compilation step : cd /tmp/ltsmin5749379241944898701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5749379241944898701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5749379241944898701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-06-07 08:32:23] [INFO ] Flatten gal took : 545 ms
[2024-06-07 08:32:23] [INFO ] Flatten gal took : 461 ms
[2024-06-07 08:32:23] [INFO ] Time to serialize gal into /tmp/LTL3175172310127111745.gal : 185 ms
[2024-06-07 08:32:24] [INFO ] Time to serialize properties into /tmp/LTL1375494564377085516.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3175172310127111745.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4015430254098554.hoa' '-atoms' '/tmp/LTL1375494564377085516.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...314
Loading property file /tmp/LTL1375494564377085516.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4015430254098554.hoa
Detected timeout of ITS tools.
[2024-06-07 08:32:40] [INFO ] Flatten gal took : 619 ms
[2024-06-07 08:32:40] [INFO ] Flatten gal took : 461 ms
[2024-06-07 08:32:40] [INFO ] Time to serialize gal into /tmp/LTL944650428571768033.gal : 61 ms
[2024-06-07 08:32:40] [INFO ] Time to serialize properties into /tmp/LTL2783002601476079858.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL944650428571768033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2783002601476079858.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((p36!=1)||(p63!=1))||((p95!=1)||(p123!=1)))||(((p151!=1)||(p179!=1))||((p207!=1)||(p235!=1))))")||(("(p263!=1)")||(X(G("((...272
Formula 0 simplified : XF(!"((((p36!=1)||(p63!=1))||((p95!=1)||(p123!=1)))||(((p151!=1)||(p179!=1))||((p207!=1)||(p235!=1))))" & !"(p263!=1)" & XF!"(((((p3...260
Detected timeout of ITS tools.
[2024-06-07 08:32:56] [INFO ] Flatten gal took : 485 ms
[2024-06-07 08:32:56] [INFO ] Applying decomposition
[2024-06-07 08:32:57] [INFO ] Flatten gal took : 615 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9392498063000832975.txt' '-o' '/tmp/graph9392498063000832975.bin' '-w' '/tmp/graph9392498063000832975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9392498063000832975.bin' '-l' '-1' '-v' '-w' '/tmp/graph9392498063000832975.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:32:58] [INFO ] Decomposing Gal with order
[2024-06-07 08:32:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:33:00] [INFO ] Removed a total of 28513 redundant transitions.
[2024-06-07 08:33:00] [INFO ] Flatten gal took : 1492 ms
[2024-06-07 08:33:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 311 ms.
[2024-06-07 08:33:01] [INFO ] Time to serialize gal into /tmp/LTL14215795847713669467.gal : 44 ms
[2024-06-07 08:33:01] [INFO ] Time to serialize properties into /tmp/LTL1555359367538893269.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14215795847713669467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1555359367538893269.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((i3.u19.p36!=1)||(i3.u13.p63!=1))||((i3.u11.p95!=1)||(i3.u13.p123!=1)))||(((i3.u16.p151!=1)||(i3.u18.p179!=1))||((i3.u20.p...398
Formula 0 simplified : XF(!"((((i3.u19.p36!=1)||(i3.u13.p63!=1))||((i3.u11.p95!=1)||(i3.u13.p123!=1)))||(((i3.u16.p151!=1)||(i3.u18.p179!=1))||((i3.u20.p20...386
Detected timeout of ITS tools.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-03 finished in 472436 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(p1))))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (trivial) has 53 edges and 94 vertex of which 6 / 94 are part of one of the 2 SCC in 4 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 670 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 87 transition count 3896
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 80 transition count 3896
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 16 place count 80 transition count 3887
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 71 transition count 3887
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 68 transition count 3119
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 68 transition count 3119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 68 transition count 3116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 68 transition count 3113
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 65 transition count 3113
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 52 transition count 3100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 49 transition count 3108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 49 transition count 3107
Applied a total of 82 rules in 2438 ms. Remains 49 /94 variables (removed 45) and now considering 3107/3910 (removed 803) transitions.
[2024-06-07 08:33:18] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
// Phase 1: matrix 3106 rows 49 cols
[2024-06-07 08:33:18] [INFO ] Computed 0 invariants in 25 ms
[2024-06-07 08:33:18] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-07 08:33:18] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
[2024-06-07 08:33:18] [INFO ] Invariant cache hit.
[2024-06-07 08:33:20] [INFO ] State equation strengthened by 2299 read => feed constraints.
[2024-06-07 08:33:24] [INFO ] Implicit Places using invariants and state equation in 5107 ms returned []
Implicit Place search using SMT with State Equation took 5517 ms to find 0 implicit places.
[2024-06-07 08:33:36] [INFO ] Redundant transitions in 12030 ms returned []
Running 3089 sub problems to find dead transitions.
[2024-06-07 08:33:36] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
[2024-06-07 08:33:36] [INFO ] Invariant cache hit.
[2024-06-07 08:33:36] [INFO ] State equation strengthened by 2299 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3089 unsolved
At refinement iteration 1 (OVERLAPS) 3104/3151 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3089 unsolved
SMT process timed out in 86861ms, After SMT, problems are : Problem set: 0 solved, 3089 unsolved
Search for dead transitions found 0 dead transitions in 86899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/94 places, 3107/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106900 ms. Remains : 49/94 places, 3107/3910 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-04 finished in 107057 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((G(p0)||(!p1 U (G(!p1)||(!p1&&G(!p0)))))))'
Support contains 16 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 34 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:35:03] [INFO ] Computed 0 invariants in 36 ms
[2024-06-07 08:35:03] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-06-07 08:35:03] [INFO ] Invariant cache hit.
[2024-06-07 08:35:05] [INFO ] Implicit Places using invariants and state equation in 1977 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:35:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
SMT process timed out in 93477ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 93519ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95972 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), (NOT p0), (AND p1 p0), p0]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1769 ms.
Product exploration explored 100000 steps with 0 reset in 1609 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 667 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.66 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 192 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[true, p1, (AND p1 p0), p0]
RANDOM walk for 40000 steps (8 resets) in 1590 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 742 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1002 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 852 ms. (46 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 736 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 442 ms. (90 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 349809 steps, run timeout after 6001 ms. (steps per millisecond=58 ) properties seen :3 out of 6
Probabilistic random walk after 349809 steps, saw 55215 distinct states, run finished after 6001 ms. (steps per millisecond=58 ) properties seen :3
[2024-06-07 08:36:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3585/3601 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/3676 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3676 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/3703 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3703 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/3726 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3726 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 19/3745 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3745 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 11 (OVERLAPS) 2/3747 variables, 2/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2852 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3585/3601 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/3676 variables, 41/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3676 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/3703 variables, 11/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3703 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 23/3726 variables, 10/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3726 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 19/3745 variables, 13/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3745 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3747 variables, 2/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2556 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5501ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 563 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 172 ms :[true, p0, p1, (AND p0 p1)]
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 3654/3654 transitions.
Graph (trivial) has 52 edges and 93 vertex of which 6 / 93 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 661 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 86 transition count 3641
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 80 transition count 3640
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 15 place count 80 transition count 3629
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 37 place count 69 transition count 3629
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 56 transition count 3616
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 53 transition count 3624
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 53 transition count 3623
Applied a total of 70 rules in 3770 ms. Remains 53 /93 variables (removed 40) and now considering 3623/3654 (removed 31) transitions.
[2024-06-07 08:37:01] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
// Phase 1: matrix 3622 rows 53 cols
[2024-06-07 08:37:01] [INFO ] Computed 0 invariants in 60 ms
[2024-06-07 08:37:02] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-06-07 08:37:02] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:37:02] [INFO ] Invariant cache hit.
[2024-06-07 08:37:04] [INFO ] State equation strengthened by 3067 read => feed constraints.
[2024-06-07 08:37:13] [INFO ] Implicit Places using invariants and state equation in 10818 ms returned []
Implicit Place search using SMT with State Equation took 11475 ms to find 0 implicit places.
[2024-06-07 08:37:26] [INFO ] Redundant transitions in 13154 ms returned []
Running 3605 sub problems to find dead transitions.
[2024-06-07 08:37:26] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:37:26] [INFO ] Invariant cache hit.
[2024-06-07 08:37:28] [INFO ] State equation strengthened by 3067 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3605 unsolved
SMT process timed out in 96819ms, After SMT, problems are : Problem set: 0 solved, 3605 unsolved
Search for dead transitions found 0 dead transitions in 96862ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/93 places, 3623/3654 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125281 ms. Remains : 53/93 places, 3623/3654 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 226 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[true, p0, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (9 resets) in 2483 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1464 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1498 ms. (26 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1630 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 1073 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 762 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1589 ms. (25 steps per ms) remains 6/6 properties
Probably explored full state space saw : 62991 states, properties seen :5
Probabilistic random walk after 446489 steps, saw 62991 distinct states, run finished after 4890 ms. (steps per millisecond=91 ) properties seen :5
Explored full state space saw : 62991 states, properties seen :0
Exhaustive walk after 446489 steps, saw 62991 distinct states, run finished after 4043 ms. (steps per millisecond=110 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 457 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 139 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 129 ms :[true, p0, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 0 reset in 2117 ms.
Product exploration explored 100000 steps with 0 reset in 1199 ms.
Built C files in :
/tmp/ltsmin15753093763805808270
[2024-06-07 08:39:20] [INFO ] Too many transitions (3623) to apply POR reductions. Disabling POR matrices.
[2024-06-07 08:39:20] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15753093763805808270
Running compilation step : cd /tmp/ltsmin15753093763805808270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15753093763805808270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15753093763805808270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 16 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 3623/3623 transitions.
Applied a total of 0 rules in 1523 ms. Remains 53 /53 variables (removed 0) and now considering 3623/3623 (removed 0) transitions.
[2024-06-07 08:39:25] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:39:25] [INFO ] Invariant cache hit.
[2024-06-07 08:39:25] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-06-07 08:39:25] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:39:25] [INFO ] Invariant cache hit.
[2024-06-07 08:39:28] [INFO ] State equation strengthened by 3067 read => feed constraints.
[2024-06-07 08:39:38] [INFO ] Implicit Places using invariants and state equation in 12505 ms returned []
Implicit Place search using SMT with State Equation took 12984 ms to find 0 implicit places.
[2024-06-07 08:39:50] [INFO ] Redundant transitions in 12629 ms returned []
Running 3605 sub problems to find dead transitions.
[2024-06-07 08:39:50] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:39:50] [INFO ] Invariant cache hit.
[2024-06-07 08:39:52] [INFO ] State equation strengthened by 3067 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3605 unsolved
SMT process timed out in 94824ms, After SMT, problems are : Problem set: 0 solved, 3605 unsolved
Search for dead transitions found 0 dead transitions in 94867ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 122033 ms. Remains : 53/53 places, 3623/3623 transitions.
Built C files in :
/tmp/ltsmin11457433008541317779
[2024-06-07 08:41:25] [INFO ] Too many transitions (3623) to apply POR reductions. Disabling POR matrices.
[2024-06-07 08:41:25] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11457433008541317779
Running compilation step : cd /tmp/ltsmin11457433008541317779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11457433008541317779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11457433008541317779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-06-07 08:41:30] [INFO ] Flatten gal took : 904 ms
[2024-06-07 08:41:30] [INFO ] Flatten gal took : 477 ms
[2024-06-07 08:41:30] [INFO ] Time to serialize gal into /tmp/LTL862828350386007003.gal : 61 ms
[2024-06-07 08:41:30] [INFO ] Time to serialize properties into /tmp/LTL6048591307018676163.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL862828350386007003.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12142319360520232544.hoa' '-atoms' '/tmp/LTL6048591307018676163.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6048591307018676163.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12142319360520232544.hoa
Detected timeout of ITS tools.
[2024-06-07 08:41:46] [INFO ] Flatten gal took : 751 ms
[2024-06-07 08:41:47] [INFO ] Flatten gal took : 730 ms
[2024-06-07 08:41:47] [INFO ] Time to serialize gal into /tmp/LTL6467217197632067032.gal : 57 ms
[2024-06-07 08:41:47] [INFO ] Time to serialize properties into /tmp/LTL11542505677844644039.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6467217197632067032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11542505677844644039.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((p34==1)&&(p66==1))&&((p94==1)&&(p123==1)))&&(((p150==1)&&(p179==1))&&((p207==1)&&(p235==1))))&&(p262==1))"))||((!("(((((...633
Formula 0 simplified : X(F!"(((((p34==1)&&(p66==1))&&((p94==1)&&(p123==1)))&&(((p150==1)&&(p179==1))&&((p207==1)&&(p235==1))))&&(p262==1))" & (F"(((((p34==...373
Detected timeout of ITS tools.
[2024-06-07 08:42:03] [INFO ] Flatten gal took : 501 ms
[2024-06-07 08:42:03] [INFO ] Applying decomposition
[2024-06-07 08:42:03] [INFO ] Flatten gal took : 549 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10586576934305402559.txt' '-o' '/tmp/graph10586576934305402559.bin' '-w' '/tmp/graph10586576934305402559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10586576934305402559.bin' '-l' '-1' '-v' '-w' '/tmp/graph10586576934305402559.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:42:04] [INFO ] Decomposing Gal with order
[2024-06-07 08:42:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:42:05] [INFO ] Removed a total of 29043 redundant transitions.
[2024-06-07 08:42:06] [INFO ] Flatten gal took : 944 ms
[2024-06-07 08:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 195 ms.
[2024-06-07 08:42:06] [INFO ] Time to serialize gal into /tmp/LTL5456469591354111419.gal : 20 ms
[2024-06-07 08:42:06] [INFO ] Time to serialize properties into /tmp/LTL15166692409270555137.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5456469591354111419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15166692409270555137.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((i1.u1.p34==1)&&(i1.u6.p66==1))&&((i1.u1.p94==1)&&(i2.i0.u5.p123==1)))&&(((i2.i0.u2.p150==1)&&(i1.u6.p179==1))&&((i2.i1.u...987
Formula 0 simplified : X(F!"(((((i1.u1.p34==1)&&(i1.u6.p66==1))&&((i1.u1.p94==1)&&(i2.i0.u5.p123==1)))&&(((i2.i0.u2.p150==1)&&(i1.u6.p179==1))&&((i2.i1.u7....583
Reverse transition relation is NOT exact ! Due to transitions t25_t27, t19_t21_t3902, t13_t15_t3907, t7_t9_t3901, t6_t12_t18_t24_t30_t36_t42_t48_t49_t43_t4...1435
Computing Next relation with stutter on 2 deadlock states
8 unique states visited
7 strongly connected components in search stack
10 transitions explored
8 items max in DFS search stack
296 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.71732,67100,1,0,57134,3759,27767,262942,837,18980,297332
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResIsolation-PT-N08P1-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResIsolation-PT-N08P1-LTLFireability-05 finished in 427374 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(p0)))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 69 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 08:42:10] [INFO ] Computed 0 invariants in 25 ms
[2024-06-07 08:42:11] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-07 08:42:11] [INFO ] Invariant cache hit.
[2024-06-07 08:42:12] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
SMT process timed out in 83397ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 83460ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85723 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 1615 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-06 finished in 87484 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(p0)))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 45 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
[2024-06-07 08:43:38] [INFO ] Invariant cache hit.
[2024-06-07 08:43:38] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-06-07 08:43:38] [INFO ] Invariant cache hit.
[2024-06-07 08:43:40] [INFO ] Implicit Places using invariants and state equation in 2467 ms returned []
Implicit Place search using SMT with State Equation took 2892 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:43:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 1 (OVERLAPS) 3141/3231 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3231/3232 variables, and 90 constraints, problems are : Problem set: 0 solved, 3140 unsolved in 30060 ms.
Refiners :[State Equation: 90/91 constraints, PredecessorRefiner: 3140/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 1 (OVERLAPS) 3141/3231 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3231 variables, 56/146 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
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 Int declared 3231/3232 variables, and 146 constraints, problems are : Problem set: 0 solved, 3140 unsolved in 30087 ms.
Refiners :[State Equation: 90/91 constraints, PredecessorRefiner: 3140/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 112648ms problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 112707ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115657 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 1413 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-07 finished in 117196 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 14 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 91 transition count 3901
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 85 transition count 3901
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 85 transition count 3892
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 76 transition count 3892
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 74 transition count 3380
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 74 transition count 3380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 74 transition count 3378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 37 place count 74 transition count 3376
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 72 transition count 3376
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 71 place count 57 transition count 3361
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 77 place count 54 transition count 3369
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 54 transition count 3368
Applied a total of 78 rules in 787 ms. Remains 54 /94 variables (removed 40) and now considering 3368/3910 (removed 542) transitions.
// Phase 1: matrix 3368 rows 54 cols
[2024-06-07 08:45:36] [INFO ] Computed 0 invariants in 28 ms
[2024-06-07 08:45:36] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-06-07 08:45:36] [INFO ] Invariant cache hit.
[2024-06-07 08:45:38] [INFO ] Implicit Places using invariants and state equation in 2326 ms returned []
Implicit Place search using SMT with State Equation took 2828 ms to find 0 implicit places.
[2024-06-07 08:45:52] [INFO ] Redundant transitions in 13803 ms returned []
Running 3350 sub problems to find dead transitions.
[2024-06-07 08:45:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
At refinement iteration 1 (OVERLAPS) 3367/3419 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3419/3422 variables, and 52 constraints, problems are : Problem set: 0 solved, 3350 unsolved in 30067 ms.
Refiners :[State Equation: 52/54 constraints, PredecessorRefiner: 3350/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
At refinement iteration 1 (OVERLAPS) 3367/3419 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3419 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3419/3422 variables, and 63 constraints, problems are : Problem set: 0 solved, 3350 unsolved in 30075 ms.
Refiners :[State Equation: 52/54 constraints, PredecessorRefiner: 3350/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 118775ms problems are : Problem set: 0 solved, 3350 unsolved
Search for dead transitions found 0 dead transitions in 118822ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/94 places, 3368/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136259 ms. Remains : 54/94 places, 3368/3910 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 1862 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-09 finished in 138264 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(((F(!p0)&&F(!p1))||G((!p2||(F(!p0)&&F(!p1))))||(!p2&&F(!p0))))))'
Support contains 20 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 91 transition count 3901
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 85 transition count 3901
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 85 transition count 3892
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 76 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 75 transition count 3636
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 75 transition count 3636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 75 transition count 3635
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34 place count 75 transition count 3634
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 74 transition count 3634
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 66 place count 59 transition count 3619
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 56 transition count 3627
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 56 transition count 3626
Applied a total of 73 rules in 711 ms. Remains 56 /94 variables (removed 38) and now considering 3626/3910 (removed 284) transitions.
// Phase 1: matrix 3626 rows 56 cols
[2024-06-07 08:47:54] [INFO ] Computed 0 invariants in 34 ms
[2024-06-07 08:47:54] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-07 08:47:54] [INFO ] Invariant cache hit.
[2024-06-07 08:47:56] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 1970 ms to find 0 implicit places.
[2024-06-07 08:48:09] [INFO ] Redundant transitions in 12866 ms returned []
Running 3608 sub problems to find dead transitions.
[2024-06-07 08:48:09] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3608 unsolved
SMT process timed out in 94749ms, After SMT, problems are : Problem set: 0 solved, 3608 unsolved
Search for dead transitions found 0 dead transitions in 94813ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/94 places, 3626/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110388 ms. Remains : 56/94 places, 3626/3910 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (AND p0 p2) (AND p1 p2)), (AND p2 p0), (AND p1 p2), (AND p2 p0 p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 2199 ms.
Product exploration explored 100000 steps with 0 reset in 1993 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 130 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND p0 p2) (AND p1 p2)), (AND p2 p0), (AND p1 p2), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 1265 ms. (31 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1029 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 716 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 962 ms. (41 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1117 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 979 ms. (40 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 834 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 831 ms. (48 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1414 ms. (28 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 579108 steps, run timeout after 9001 ms. (steps per millisecond=64 ) properties seen :4 out of 8
Probabilistic random walk after 579108 steps, saw 83721 distinct states, run finished after 9001 ms. (steps per millisecond=64 ) properties seen :4
[2024-06-07 08:50:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3616 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3616 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/3670 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3670 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3682/3682 variables, and 56 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1902 ms.
Refiners :[State Equation: 56/56 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2017ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p2 (NOT p0) (NOT p1))), (G (OR (NOT p2) (NOT p0))), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 (NOT p0)))), (F p2), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 21 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-11 finished in 129406 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(G(p0))&&G(((X(p1) U p2) U !p3))) U p4))'
Support contains 25 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 32 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:50:03] [INFO ] Computed 0 invariants in 54 ms
[2024-06-07 08:50:03] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-07 08:50:03] [INFO ] Invariant cache hit.
[2024-06-07 08:50:05] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2261 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:50:05] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
SMT process timed out in 91384ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 91447ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93752 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-12
Product exploration explored 100000 steps with 1 reset in 1373 ms.
Product exploration explored 100000 steps with 0 reset in 1410 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 667 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.38 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND (NOT p4) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 154 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 6 states, 14 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
RANDOM walk for 40000 steps (8 resets) in 3440 ms. (11 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 668 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 686 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 783 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 717 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 781 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1110 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 850 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1043 ms. (38 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 502875 steps, run timeout after 9001 ms. (steps per millisecond=55 ) properties seen :0 out of 9
Probabilistic random walk after 502875 steps, saw 75301 distinct states, run finished after 9004 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-07 08:51:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3598/3623 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3623 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 57/3680 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3680 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 29/3709 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3709 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 21/3730 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3730 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 16/3746 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3746 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/3747 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5019 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3598/3623 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3623 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 57/3680 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3680 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 29/3709 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3709 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 21/3730 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3730 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 16/3746 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3746 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/3747 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 0)
(t3 1)
(t4 0)
(t5 2)
(t6 1)
(t7 1)
(t8 0)
(t9 1)
(t10 0)
(t11 1)
(t12 1)
(t13 1)
(t14 0)
(t15 1)
(t16 0)
(t17 2)
(t18 1)
(t19 1)
(t20 0)
(t21 1)
(t22 0)
(t23 2)
(t24 1)
(t25 1)
(t26 0)
(t27 1)
(t28 0)
(t29 1)
(t30 1)
(t31 1)
(t32 0)
(t33 1)
(t34 0)
(t35 1)
(t36 1)
(t37 1)
(t38 0)
(t39 1)
(t40 0)
(t41 2)
(t42 1)
(t43 1)
(t44 0)
(t45 1)
(t46 0)
(t47 2)
(t48 1)
(t49 0)
(t50 0)
(t51 1)
(t52 1)
(t53 1)
(t54 1)
(t55 1)
(t56 1)
(t57 0)
(t58 0)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 1)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 0)
(t242 0)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 0)
(t356 0)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 0)
(t390 0)
(t391 0)
(t392 0)
(t393 0)
(t394 0)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 0)
(t401 0)
(t402 0)
(t403 0)
(t404 0)
(t405 0)
(t406 0)
(t407 0)
(t408 0)
(t409 0)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 0)
(t424 0)
(t425 0)
(t426 0)
(t427 0)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 0)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 0)
(t492 0)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 0)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 0)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 0)
(t513 0)
(t514 0)
(t515 0)
(t516 0)
(t517 0)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 0)
(t545 0)
(t546 0)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 0)
(t586 0)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 0)
(t594 0)
(t595 0)
(t596 0)
(t597 0)
(t598 0)
(t599 0)
(t600 0)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 0)
(t641 0)
(t642 0)
(t643 0)
(t644 0)
(t645 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 0)
(t651 0)
(t652 0)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 0)
(t673 0)
(t674 0)
(t675 0)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 0)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 0)
(t733 0)
(t734 0)
(t735 0)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 0)
(t745 0)
(t746 0)
(t747 0)
(t748 0)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 0)
(t758 0)
(t759 0)
(t760 0)
(t761 0)
(t762 0)
(t763 0)
(t764 0)
(t765 0)
(t766 0)
(t767 0)
(t768 0)
(t769 0)
(t770 0)
(t771 0)
(t772 0)
(t773 0)
(t774 0)
(t775 0)
(t776 0)
(t777 0)
(t778 0)
(t779 0)
(t780 0)
(t781 0)
(t782 0)
(t783 0)
(t784 0)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 0)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 0)
(t809 0)
(t810 0)
(t811 0)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 0)
(t822 0)
(t823 0)
(t824 0)
(t825 0)
(t826 0)
(t827 0)
(t828 0)
(t829 0)
(t830 0)
(t831 0)
(t832 0)
(t833 0)
(t834 0)
(t835 0)
(t836 0)
(t837 0)
(t838 0)
(t839 0)
(t840 0)
(t841 0)
(t842 0)
(t843 0)
(t844 0)
(t845 0)
(t846 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t851 0)
(t852 0)
(t853 0)
(t854 0)
(t855 0)
(t856 0)
(t857 0)
(t858 0)
(t859 0)
(t860 0)
(t861 0)
(t862 0)
(t863 0)
(t864 0)
(t865 0)
(t866 0)
(t867 0)
(t868 0)
(t869 0)
(t870 0)
(t871 0)
(t872 0)
(t873 0)
(t874 0)
(t875 0)
(t876 0)
(t877 0)
(t878 0)
(t879 0)
(t880 0)
(t881 0)
(t882 0)
(t883 0)
(t884 0)
(t885 0)
(t886 0)
(t887 0)
(t888 0)
(t889 0)
(t890 0)
(t891 0)
(t892 0)
(t893 0)
(t894 0)
(t895 0)
(t896 0)
(t897 0)
(t898 0)
(t899 0)
(t900 0)
(t901 0)
(t902 0)
(t903 0)
(t904 0)
(t905 0)
(t906 0)
(t907 0)
(t908 0)
(t909 0)
(t910 0)
(t911 0)
(t912 0)
(t913 0)
(t914 0)
(t915 0)
(t916 0)
(t917 0)
(t918 0)
(t919 0)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 0)
(t925 0)
(t926 0)
(t927 0)
(t928 0)
(t929 0)
(t930 0)
(t931 0)
(t932 0)
(t933 0)
(t934 0)
(t935 0)
(t936 0)
(t937 0)
(t938 0)
(t939 0)
(t940 0)
(t941 0)
(t942 0)
(t943 0)
(t944 0)
(t945 0)
(t946 0)
(t947 0)
(t948 0)
(t949 0)
(t950 0)
(t951 0)
(t952 0)
(t953 0)
(t954 0)
(t955 0)
(t956 0)
(t957 0)
(t958 0)
(t959 0)
(t960 0)
(t961 0)
(t962 0)
(t963 0)
(t964 0)
(t965 0)
(t966 0)
(t967 0)
(t968 0)
(t969 0)
(t970 0)
(t971 0)
(t972 0)
(t973 0)
(t974 0)
(t975 0)
(t976 0)
(t977 0)
(t978 0)
(t979 0)
(t980 0)
(t981 0)
(t982 0)
(t983 0)
(t984 0)
(t985 0)
(t986 0)
(t987 0)
(t988 0)
(t989 0)
(t990 0)
(t991 0)
(t992 0)
(t993 0)
(t994 0)
(t995 0)
(t996 0)
(t997 0)
(t998 0)
(t999 0)
(t1000 0)
(t1001 0)
(t1002 0)
(t1003 0)
(t1004 0)
(t1005 0)
(t1006 0)
(t1007 0)
(t1008 0)
(t1009 0)
(t1010 0)
(t1011 0)
(t1012 0)
(t1013 0)
(t1014 0)
(t1015 0)
(t1016 0)
(t1017 0)
(t1018 0)
(t1019 0)
(t1020 0)
(t1021 0)
(t1022 0)
(t1023 0)
(t1024 0)
(t1025 0)
(t1026 0)
(t1027 0)
(t1028 0)
(t1029 0)
(t1030 0)
(t1031 0)
(t1032 0)
(t1033 0)
(t1034 0)
(t1035 0)
(t1036 0)
(t1037 0)
(t1038 0)
(t1039 0)
(t1040 0)
(t1041 0)
(t1042 0)
(t1043 0)
(t1044 0)
(t1045 0)
(t1046 0)
(t1047 0)
(t1048 0)
(t1049 0)
(t1050 0)
(t1051 0)
(t1052 0)
(t1053 0)
(t1054 0)
(t1055 0)
(t1056 0)
(t1057 0)
(t1058 0)
(t1059 0)
(t1060 0)
(t1061 0)
(t1062 0)
(t1063 0)
(t1064 0)
(t1065 0)
(t1066 0)
(t1067 0)
(t1068 0)
(t1069 0)
(t1070 0)
(t1071 0)
(t1072 0)
(t1073 0)
(t1074 0)
(t1075 0)
(t1076 0)
(t1077 0)
(t1078 0)
(t1079 0)
(t1080 0)
(t1081 0)
(t1082 0)
(t1083 0)
(t1084 0)
(t1085 0)
(t1086 0)
(t1087 0)
(t1088 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1092 0)
(t1093 0)
(t1094 0)
(t1095 0)
(t1096 0)
(t1097 0)
(t1098 0)
(t1099 0)
(t1100 0)
(t1101 0)
(t1102 0)
(t1103 0)
(t1104 0)
(t1105 0)
(t1106 0)
(t1107 0)
(t1108 0)
(t1109 0)
(t1110 0)
(t1111 0)
(t1112 0)
(t1113 0)
(t1114 0)
(t1115 0)
(t1116 0)
(t1117 0)
(t1118 0)
(t1119 0)
(t1120 0)
(t1121 0)
(t1122 0)
(t1123 0)
(t1124 0)
(t1125 0)
(t1126 0)
(t1127 0)
(t1128 0)
(t1129 0)
(t1130 0)
(t1131 0)
(t1132 0)
(t1133 0)
(t1134 0)
(t1135 0)
(t1136 0)
(t1137 0)
(t1138 0)
(t1139 0)
(t1140 0)
(t1141 0)
(t1142 0)
(t1143 0)
(t1144 0)
(t1145 0)
(t1146 0)
(t1147 0)
(t1148 0)
(t1149 0)
(t1150 0)
(t1151 0)
(t1152 0)
(t1153 0)
(t1154 0)
(t1155 0)
(t1156 0)
(t1157 0)
(t1158 0)
(t1159 0)
(t1160 0)
(t1161 0)
(t1162 0)
(t1163 0)
(t1164 0)
(t1165 0)
(t1166 0)
(t1167 0)
(t1168 0)
(t1169 0)
(t1170 0)
(t1171 0)
(t1172 0)
(t1173 0)
(t1174 0)
(t1175 0)
(t1176 0)
(t1177 0)
(t1178 0)
(t1179 0)
(t1180 0)
(t1181 0)
(t1182 0)
(t1183 0)
(t1184 0)
(t1185 0)
(t1186 0)
(t1187 0)
(t1188 0)
(t1189 0)
(t1190 0)
(t1191 0)
(t1192 0)
(t1193 0)
(t1194 0)
(t1195 0)
(t1196 0)
(t1197 0)
(t1198 0)
(t1199 0)
(t1200 0)
(t1201 0)
(t1202 0)
(t1203 0)
(t1204 0)
(t1205 0)
(t1206 0)
(t1207 0)
(t1208 0)
(t1209 0)
(t1210 0)
(t1211 0)
(t1212 0)
(t1213 0)
(t1214 0)
(t1215 0)
(t1216 0)
(t1217 0)
(t1218 0)
(t1219 0)
(t1220 0)
(t1221 0)
(t1222 0)
(t1223 0)
(t1224 0)
(t1225 0)
(t1226 0)
(t1227 0)
(t1228 0)
(t1229 0)
(t1230 0)
(t1231 0)
(t1232 0)
(t1233 0)
(t1234 0)
(t1235 0)
(t1236 0)
(t1237 0)
(t1238 0)
(t1239 0)
(t1240 0)
(t1241 0)
(t1242 0)
(t1243 0)
(t1244 0)
(t1245 0)
(t1246 0)
(t1247 0)
(t1248 0)
(t1249 0)
(t1250 0)
(t1251 0)
(t1252 0)
(t1253 0)
(t1254 0)
(t1255 0)
(t1256 0)
(t1257 0)
(t1258 0)
(t1259 0)
(t1260 0)
(t1261 0)
(t1262 0)
(t1263 0)
(t1264 0)
(t1265 0)
(t1266 0)
(t1267 0)
(t1268 0)
(t1269 0)
(t1270 0)
(t1271 0)
(t1272 0)
(t1273 0)
(t1274 0)
(t1275 0)
(t1276 0)
(t1277 0)
(t1278 0)
(t1279 0)
(t1280 0)
(t1281 0)
(t1282 0)
(t1283 0)
(t1284 0)
(t1285 0)
(t1286 0)
(t1287 0)
(t1288 0)
(t1289 0)
(t1290 0)
(t1291 0)
(t1292 0)
(t1293 0)
(t1294 0)
(t1295 0)
(t1296 0)
(t1297 0)
(t1298 0)
(t1299 0)
(t1300 0)
(t1301 0)
(t1302 0)
(t1303 0)
(t1304 0)
(t1305 0)
(t1306 0)
(t1307 0)
(t1308 0)
(t1309 0)
(t1310 0)
(t1311 0)
(t1312 0)
(t1313 0)
(t1314 0)
(t1315 0)
(t1316 0)
(t1317 0)
(t1318 0)
(t1319 0)
(t1320 0)
(t1321 0)
(t1322 0)
(t1323 0)
(t1324 0)
(t1325 0)
(t1326 0)
(t1327 0)
(t1328 0)
(t1329 0)
(t1330 0)
(t1331 0)
(t1332 0)
(t1333 0)
(t1334 0)
(t1335 0)
(t1336 0)
(t1337 0)
(t1338 0)
(t1339 0)
(t1340 0)
(t1341 0)
(t1342 0)
(t1343 0)
(t1344 0)
(t1345 0)
(t1346 0)
(t1347 0)
(t1348 0)
(t1349 0)
(t1350 0)
(t1351 0)
(t1352 0)
(t1353 0)
(t1354 0)
(t1355 0)
(t1356 0)
(t1357 0)
(t1358 0)
(t1359 0)
(t1360 0)
(t1361 0)
(t1362 0)
(t1363 0)
(t1364 0)
(t1365 0)
(t1366 0)
(t1367 0)
(t1368 0)
(t1369 0)
(t1370 0)
(t1371 0)
(t1372 0)
(t1373 0)
(t1374 0)
(t1375 0)
(t1376 0)
(t1377 0)
(t1378 0)
(t1379 0)
(t1380 0)
(t1381 0)
(t1382 0)
(t1383 0)
(t1384 0)
(t1385 0)
(t1386 0)
(t1387 0)
(t1388 0)
(t1389 0)
(t1390 0)
(t1391 0)
(t1392 0)
(t1393 0)
(t1394 0)
(t1395 0)
(t1396 0)
(t1397 0)
(t1398 0)
(t1399 0)
(t1400 0)
(t1401 0)
(t1402 0)
(t1403 0)
(t1404 0)
(t1405 0)
(t1406 0)
(t1407 0)
(t1408 0)
(t1409 0)
(t1410 0)
(t1411 0)
(t1412 0)
(t1413 0)
(t1414 0)
(t1415 0)
(t1416 0)
(t1417 0)
(t1418 0)
(t1419 0)
(t1420 0)
(t1421 0)
(t1422 0)
(t1423 0)
(t1424 0)
(t1425 0)
(t1426 0)
(t1427 0)
(t1428 0)
(t1429 0)
(t1430 0)
(t1431 0)
(t1432 0)
(t1433 0)
(t1434 0)
(t1435 0)
(t1436 0)
(t1437 0)
(t1438 0)
(t1439 0)
(t1440 0)
(t1441 0)
(t1442 0)
(t1443 0)
(t1444 0)
(t1445 0)
(t1446 0)
(t1447 0)
(t1448 0)
(t1449 0)
(t1450 0)
(t1451 0)
(t1452 0)
(t1453 0)
(t1454 0)
(t1455 0)
(t1456 0)
(t1457 0)
(t1458 0)
(t1459 0)
(t1460 0)
(t1461 0)
(t1462 0)
(t1463 0)
(t1464 0)
(t1465 0)
(t1466 0)
(t1467 0)
(t1468 0)
(t1469 0)
(t1470 0)
(t1471 0)
(t1472 0)
(t1473 0)
(t1474 0)
(t1475 0)
(t1476 0)
(t1477 0)
(t1478 0)
(t1479 0)
(t1480 0)
(t1481 0)
(t1482 0)
(t1483 0)
(t1484 0)
(t1485 0)
(t1486 0)
(t1487 0)
(t1488 0)
(t1489 0)
(t1490 0)
(t1491 0)
(t1492 0)
(t1493 0)
(t1494 0)
(t1495 0)
(t1496 0)
(t1497 0)
(t1498 0)
(t1499 0)
(t1500 0)
(t1501 0)
(t1502 0)
(t1503 0)
(t1504 0)
(t1505 0)
(t1506 0)
(t1507 0)
(t1508 0)
(t1509 0)
(t1510 0)
(t1511 0)
(t1512 0)
(t1513 0)
(t1514 0)
(t1515 0)
(t1516 0)
(t1517 0)
(t1518 0)
(t1519 0)
(t1520 0)
(t1521 0)
(t1522 0)
(t1523 0)
(t1524 0)
(t1525 0)
(t1526 0)
(t1527 0)
(t1528 0)
(t1529 0)
(t1530 0)
(t1531 0)
(t1532 0)
(t1533 0)
(t1534 0)
(t1535 0)
(t1536 0)
(t1537 0)
(t1538 0)
(t1539 0)
(t1540 0)
(t1541 0)
(t1542 0)
(t1543 0)
(t1544 0)
(t1545 0)
(t1546 0)
(t1547 0)
(t1548 0)
(t1549 0)
(t1550 0)
(t1551 0)
(t1552 0)
(t1553 0)
(t1554 0)
(t1555 0)
(t1556 0)
(t1557 0)
(t1558 0)
(t1559 0)
(t1560 0)
(t1561 0)
(t1562 0)
(t1563 0)
(t1564 0)
(t1565 0)
(t1566 0)
(t1567 0)
(t1568 0)
(t1569 0)
(t1570 0)
(t1571 0)
(t1572 0)
(t1573 0)
(t1574 0)
(t1575 0)
(t1576 0)
(t1577 0)
(t1578 0)
(t1579 0)
(t1580 0)
(t1581 0)
(t1582 0)
(t1583 0)
(t1584 0)
(t1585 0)
(t1586 0)
(t1587 0)
(t1588 0)
(t1589 0)
(t1590 0)
(t1591 0)
(t1592 0)
(t1593 0)
(t1594 0)
(t1595 0)
(t1596 0)
(t1597 0)
(t1598 0)
(t1599 0)
(t1600 0)
(t1601 0)
(t1602 0)
(t1603 0)
(t1604 0)
(t1605 0)
(t1606 0)
(t1607 0)
(t1608 0)
(t1609 0)
(t1610 0)
(t1611 0)
(t1612 0)
(t1613 0)
(t1614 0)
(t1615 0)
(t1616 0)
(t1617 0)
(t1618 0)
(t1619 0)
(t1620 0)
(t1621 0)
(t1622 0)
(t1623 0)
(t1624 0)
(t1625 0)
(t1626 0)
(t1627 0)
(t1628 0)
(t1629 0)
(t1630 0)
(t1631 0)
(t1632 0)
(t1633 0)
(t1634 0)
(t1635 0)
(t1636 0)
(t1637 0)
(t1638 0)
(t1639 0)
(t1640 0)
(t1641 0)
(t1642 0)
(t1643 0)
(t1644 0)
(t1645 0)
(t1646 0)
(t1647 1)
(t1648 0)
(t1649 0)
(t1650 0)
(t1651 0)
(t1652 0)
(t1653 0)
(t1654 0)
(t1655 0)
(t1656 0)
(t1657 0)
(t1658 0)
(t1659 0)
(t1660 0)
(t1661 0)
(t1662 0)
(t1663 0)
(t1664 0)
(t1665 0)
(t1666 0)
(t1667 0)
(t1668 0)
(t1669 0)
(t1670 0)
(t1671 0)
(t1672 0)
(t1673 0)
(t1674 0)
(t1675 0)
(t1676 0)
(t1677 0)
(t1678 0)
(t1679 0)
(t1680 0)
(t1681 0)
(t1682 0)
(t1683 0)
(t1684 0)
(t1685 0)
(t1686 0)
(t1687 0)
(t1688 0)
(t1689 0)
(t1690 0)
(t1691 0)
(t1692 0)
(t1693 0)
(t1694 0)
(t1695 0)
(t1696 0)
(t1697 0)
(t1698 0)
(t1699 0)
(t1700 0)
(t1701 0)
(t1702 0)
(t1703 0)
(t1704 0)
(t1705 0)
(t1706 0)
(t1707 0)
(t1708 0)
(t1709 0)
(t1710 0)
(t1711 0)
(t1712 0)
(t1713 0)
(t1714 0)
(t1715 0)
(t1716 0)
(t1717 0)
(t1718 0)
(t1719 0)
(t1720 0)
(t1721 0)
(t1722 0)
(t1723 0)
(t1724 0)
(t1725 0)
(t1726 0)
(t1727 0)
(t1728 0)
(t1729 0)
(t1730 0)
(t1731 0)
(t1732 0)
(t1733 0)
(t1734 0)
(t1735 0)
(t1736 0)
(t1737 0)
(t1738 0)
(t1739 0)
(t1740 0)
(t1741 0)
(t1742 0)
(t1743 0)
(t1744 0)
(t1745 0)
(t1746 0)
(t1747 0)
(t1748 0)
(t1749 0)
(t1750 0)
(t1751 0)
(t1752 0)
(t1753 0)
(t1754 0)
(t1755 0)
(t1756 0)
(t1757 0)
(t1758 0)
(t1759 0)
(t1760 0)
(t1761 0)
(t1762 0)
(t1763 0)
(t1764 0)
(t1765 0)
(t1766 0)
(t1767 0)
(t1768 0)
(t1769 0)
(t1770 0)
(t1771 0)
(t1772 0)
(t1773 0)
(t1774 0)
(t1775 0)
(t1776 0)
(t1777 0)
(t1778 0)
(t1779 0)
(t1780 0)
(t1781 0)
(t1782 0)
(t1783 0)
(t1784 0)
(t1785 0)
(t1786 0)
(t1787 0)
(t1788 0)
(t1789 0)
(t1790 0)
(t1791 0)
(t1792 0)
(t1793 0)
(t1794 0)
(t1795 0)
(t1796 0)
(t1797 0)
(t1798 0)
(t1799 0)
(t1800 0)
(t1801 0)
(t1802 0)
(t1803 0)
(t1804 0)
(t1805 0)
(t1806 0)
(t1807 0)
(t1808 0)
(t1809 0)
(t1810 0)
(t1811 0)
(t1812 0)
(t1813 0)
(t1814 0)
(t1815 0)
(t1816 0)
(t1817 0)
(t1818 0)
(t1819 0)
(t1820 0)
(t1821 0)
(t1822 0)
(t1823 0)
(t1824 0)
(t1825 0)
(t1826 0)
(t1827 0)
(t1828 0)
(t1829 0)
(t1830 0)
(t1831 0)
(t1832 0)
(t1833 0)
(t1834 0)
(t1835 0)
(t1836 0)
(t1837 0)
(t1838 0)
(t1839 0)
(t1840 0)
(t1841 0)
(t1842 0)
(t1843 0)
(t1844 0)
(t1845 0)
(t1846 0)
(t1847 0)
(t1848 0)
(t1849 0)
(t1850 0)
(t1851 0)
(t1852 0)
(t1853 0)
(t1854 0)
(t1855 0)
(t1856 0)
(t1857 0)
(t1858 0)
(t1859 0)
(t1860 0)
(t1861 0)
(t1862 0)
(t1863 0)
(t1864 0)
(t1865 0)
(t1866 0)
(t1867 0)
(t1868 0)
(t1869 0)
(t1870 0)
(t1871 0)
(t1872 0)
(t1873 0)
(t1874 0)
(t1875 0)
(t1876 0)
(t1877 0)
(t1878 0)
(t1879 0)
(t1880 0)
(t1881 0)
(t1882 0)
(t1883 0)
(t1884 0)
(t1885 0)
(t1886 0)
(t1887 0)
(t1888 0)
(t1889 0)
(t1890 0)
(t1891 0)
(t1892 0)
(t1893 0)
(t1894 0)
(t1895 0)
(t1896 0)
(t1897 0)
(t1898 0)
(t1899 0)
(t1900 0)
(t1901 0)
(t1902 0)
(t1903 0)
(t1904 0)
(t1905 0)
(t1906 0)
(t1907 0)
(t1908 0)
(t1909 0)
(t1910 0)
(t1911 0)
(t1912 0)
(t1913 0)
(t1914 0)
(t1915 0)
(t1916 0)
(t1917 0)
(t1918 0)
(t1919 0)
(t1920 0)
(t1921 0)
(t1922 0)
(t1923 0)
(t1924 0)
(t1925 0)
(t1926 0)
(t1927 0)
(t1928 0)
(t1929 0)
(t1930 0)
(t1931 0)
(t1932 0)
(t1933 0)
(t1934 0)
(t1935 0)
(t1936 0)
(t1937 0)
(t1938 0)
(t1939 0)
(t1940 0)
(t1941 0)
(t1942 0)
(t1943 0)
(t1944 0)
(t1945 0)
(t1946 0)
(t1947 0)
(t1948 0)
(t1949 0)
(t1950 0)
(t1951 0)
(t1952 0)
(t1953 0)
(t1954 0)
(t1955 0)
(t1956 0)
(t1957 0)
(t1958 0)
(t1959 0)
(t1960 0)
(t1961 0)
(t1962 0)
(t1963 0)
(t1964 0)
(t1965 0)
(t1966 0)
(t1967 0)
(t1968 0)
(t1969 0)
(t1970 0)
(t1971 0)
(t1972 0)
(t1973 0)
(t1974 0)
(t1975 0)
(t1976 0)
(t1977 0)
(t1978 0)
(t1979 0)
(t1980 0)
(t1981 0)
(t1982 0)
(t1983 0)
(t1984 0)
(t1985 0)
(t1986 0)
(t1987 0)
(t1988 0)
(t1989 0)
(t1990 0)
(t1991 0)
(t1992 0)
(t1993 0)
(t1994 0)
(t1995 0)
(t1996 0)
(t1997 0)
(t1998 0)
(t1999 0)
(t2000 0)
(t2001 0)
(t2002 0)
(t2003 0)
(t2004 0)
(t2005 0)
(t2006 0)
(t2007 0)
(t2008 0)
(t2009 0)
(t2010 0)
(t2011 0)
(t2012 0)
(t2013 0)
(t2014 0)
(t2015 0)
(t2016 0)
(t2017 0)
(t2018 0)
(t2019 0)
(t2020 0)
(t2021 0)
(t2022 0)
(t2023 0)
(t2024 0)
(t2025 0)
(t2026 0)
(t2027 0)
(t2028 0)
(t2029 0)
(t2030 0)
(t2031 0)
(t2032 0)
(t2033 0)
(t2034 0)
(t2035 0)
(t2036 0)
(t2037 0)
(t2038 0)
(t2039 0)
(t2040 0)
(t2041 0)
(t2042 0)
(t2043 0)
(t2044 0)
(t2045 0)
(t2046 0)
(t2047 0)
(t2048 0)
(t2049 0)
(t2050 0)
(t2051 0)
(t2052 0)
(t2053 0)
(t2054 0)
(t2055 0)
(t2056 0)
(t2057 0)
(t2058 0)
(t2059 0)
(t2060 0)
(t2061 0)
(t2062 0)
(t2063 0)
(t2064 0)
(t2065 0)
(t2066 0)
(t2067 0)
(t2068 0)
(t2069 0)
(t2070 0)
(t2071 0)
(t2072 0)
(t2073 0)
(t2074 0)
(t2075 0)
(t2076 0)
(t2077 0)
(t2078 0)
(t2079 0)
(t2080 0)
(t2081 0)
(t2082 0)
(t2083 0)
(t2084 0)
(t2085 0)
(t2086 0)
(t2087 0)
(t2088 0)
(t2089 0)
(t2090 0)
(t2091 0)
(t2092 0)
(t2093 0)
(t2094 0)
(t2095 0)
(t2096 0)
(t2097 0)
(t2098 0)
(t2099 0)
(t2100 0)
(t2101 0)
(t2102 0)
(t2103 0)
(t2104 0)
(t2105 0)
(t2106 0)
(t2107 0)
(t2108 0)
(t2109 0)
(t2110 0)
(t2111 0)
(t2112 0)
(t2113 0)
(t2114 0)
(t2115 0)
(t2116 0)
(t2117 0)
(t2118 0)
(t2119 0)
(t2120 0)
(t2121 0)
(t2122 0)
(t2123 0)
(t2124 0)
(t2125 0)
(t2126 0)
(t2127 0)
(t2128 0)
(t2129 0)
(t2130 0)
(t2131 0)
(t2132 0)
(t2133 0)
(t2134 0)
(t2135 0)
(t2136 0)
(t2137 0)
(t2138 0)
(t2139 0)
(t2140 0)
(t2141 0)
(t2142 0)
(t2143 0)
(t2144 0)
(t2145 0)
(t2146 0)
(t2147 0)
(t2148 0)
(t2149 0)
(t2150 0)
(t2151 0)
(t2152 0)
(t2153 0)
(t2154 0)
(t2155 0)
(t2156 0)
(t2157 0)
(t2158 0)
(t2159 0)
(t2160 0)
(t2161 0)
(t2162 0)
(t2163 0)
(t2164 0)
(t2165 0)
(t2166 0)
(t2167 0)
(t2168 0)
(t2169 0)
(t2170 0)
(t2171 0)
(t2172 0)
(t2173 0)
(t2174 0)
(t2175 0)
(t2176 0)
(t2177 0)
(t2178 0)
(t2179 0)
(t2180 0)
(t2181 0)
(t2182 0)
(t2183 0)
(t2184 0)
(t2185 0)
(t2186 0)
(t2187 0)
(t2188 0)
(t2189 0)
(t2190 0)
(t2191 0)
(t2192 0)
(t2193 0)
(t2194 0)
(t2195 0)
(t2196 0)
(t2197 0)
(t2198 0)
(t2199 0)
(t2200 0)
(t2201 0)
(t2202 0)
(t2203 0)
(t2204 0)
(t2205 0)
(t2206 0)
(t2207 0)
(t2208 0)
(t2209 0)
(t2210 0)
(t2211 0)
(t2212 0)
(t2213 0)
(t2214 0)
(t2215 0)
(t2216 0)
(t2217 0)
(t2218 0)
(t2219 0)
(t2220 0)
(t2221 0)
(t2222 0)
(t2223 0)
(t2224 0)
(t2225 0)
(t2226 0)
(t2227 0)
(t2228 0)
(t2229 0)
(t2230 0)
(t2231 0)
(t2232 0)
(t2233 0)
(t2234 0)
(t2235 0)
(t2236 0)
(t2237 0)
(t2238 0)
(t2239 0)
(t2240 0)
(t2241 0)
(t2242 0)
(t2243 0)
(t2244 0)
(t2245 0)
(t2246 0)
(t2247 0)
(t2248 0)
(t2249 0)
(t2250 0)
(t2251 0)
(t2252 0)
(t2253 0)
(t2254 0)
(t2255 0)
(t2256 0)
(t2257 0)
(t2258 0)
(t2259 0)
(t2260 0)
(t2261 0)
(t2262 0)
(t2263 0)
(t2264 0)
(t2265 0)
(t2266 0)
(t2267 0)
(t2268 0)
(t2269 0)
(t2270 0)
(t2271 0)
(t2272 0)
(t2273 0)
(t2274 0)
(t2275 0)
(t2276 0)
(t2277 0)
(t2278 0)
(t2279 0)
(t2280 0)
(t2281 0)
(t2282 0)
(t2283 0)
(t2284 0)
(t2285 0)
(t2286 0)
(t2287 0)
(t2288 0)
(t2289 0)
(t2290 0)
(t2291 0)
(t2292 0)
(t2293 0)
(t2294 0)
(t2295 0)
(t2296 0)
(t2297 0)
(t2298 0)
(t2299 0)
(t2300 0)
(t2301 0)
(t2302 0)
(t2303 0)
(t2304 0)
(t2305 0)
(t2306 0)
(t2307 0)
(t2308 0)
(t2309 0)
(t2310 0)
(t2311 0)
(t2312 0)
(t2313 0)
(t2314 0)
(t2315 0)
(t2316 0)
(t2317 0)
(t2318 0)
(t2319 0)
(t2320 0)
(t2321 0)
(t2322 0)
(t2323 0)
(t2324 0)
(t2325 0)
(t2326 0)
(t2327 0)
(t2328 0)
(t2329 0)
(t2330 0)
(t2331 0)
(t2332 0)
(t2333 0)
(t2334 0)
(t2335 0)
(t2336 0)
(t2337 0)
(t2338 0)
(t2339 0)
(t2340 0)
(t2341 0)
(t2342 0)
(t2343 0)
(t2344 0)
(t2345 0)
(t2346 0)
(t2347 0)
(t2348 0)
(t2349 0)
(t2350 0)
(t2351 0)
(t2352 0)
(t2353 0)
(t2354 0)
(t2355 0)
(t2356 0)
(t2357 0)
(t2358 0)
(t2359 0)
(t2360 0)
(t2361 0)
(t2362 0)
(t2363 0)
(t2364 0)
(t2365 0)
(t2366 0)
(t2367 0)
(t2368 0)
(t2369 0)
(t2370 0)
(t2371 0)
(t2372 0)
(t2373 0)
(t2374 0)
(t2375 0)
(t2376 0)
(t2377 0)
(t2378 0)
(t2379 0)
(t2380 0)
(t2381 0)
(t2382 0)
(t2383 0)
(t2384 0)
(t2385 0)
(t2386 0)
(t2387 0)
(t2388 0)
(t2389 0)
(t2390 0)
(t2391 0)
(t2392 0)
(t2393 0)
(t2394 0)
(t2395 0)
(t2396 0)
(t2397 0)
(t2398 0)
(t2399 0)
(t2400 0)
(t2401 0)
(t2402 0)
(t2403 0)
(t2404 0)
(t2405 0)
(t2406 0)
(t2407 0)
(t2408 0)
(t2409 0)
(t2410 0)
(t2411 0)
(t2412 0)
(t2413 0)
(t2414 0)
(t2415 0)
(t2416 0)
(t2417 0)
(t2418 0)
(t2419 0)
(t2420 0)
(t2421 0)
(t2422 0)
(t2423 0)
(t2424 0)
(t2425 0)
(t2426 0)
(t2427 0)
(t2428 0)
(t2429 0)
(t2430 0)
(t2431 0)
(t2432 0)
(t2433 0)
(t2434 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5022 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10229ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 892 ms.
Support contains 23 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 3654/3654 transitions.
Graph (complete) has 667 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 91 transition count 3628
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 41 place count 76 transition count 3627
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 41 place count 76 transition count 3626
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 75 transition count 3626
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 91 place count 51 transition count 3602
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 51 transition count 3601
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 51 transition count 3598
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 98 place count 48 transition count 3598
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 47 transition count 3597
Applied a total of 99 rules in 978 ms. Remains 47 /93 variables (removed 46) and now considering 3597/3654 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 980 ms. Remains : 47/93 places, 3597/3654 transitions.
RANDOM walk for 40000 steps (8 resets) in 3721 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 488 ms. (81 steps per ms) remains 2/4 properties
// Phase 1: matrix 3597 rows 47 cols
[2024-06-07 08:52:06] [INFO ] Computed 9 invariants in 19 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3597/3644 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3644 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/3644 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3644/3644 variables, and 56 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2196 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3597/3644 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3644 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/3644 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3644/3644 variables, and 56 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1692 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3982ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 2 properties in 127 ms.
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND (NOT p4) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p4), (F (NOT (OR p2 (NOT p3) p4))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F p3), (F (NOT (OR (NOT p3) p4))), (F p1), (F p0)]
Knowledge based reduction with 19 factoid took 639 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 6 states, 14 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
Stuttering acceptance computed with spot in 304 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:52:12] [INFO ] Computed 0 invariants in 58 ms
Proved EG (NOT p4)
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND (NOT p4) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p4), (F (NOT (OR p2 (NOT p3) p4))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F p3), (F (NOT (OR (NOT p3) p4))), (F p1), (F p0), (G (NOT p4))]
Property proved to be false thanks to negative knowledge :(G (NOT p4))
Knowledge based reduction with 19 factoid took 566 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-12 finished in 132361 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((X(p0)&&(p1||F(G(p2))))))'
Support contains 13 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 92 transition count 3398
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 92 transition count 3398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 3397
Applied a total of 5 rules in 58 ms. Remains 92 /94 variables (removed 2) and now considering 3397/3910 (removed 513) transitions.
// Phase 1: matrix 3397 rows 92 cols
[2024-06-07 08:52:15] [INFO ] Computed 0 invariants in 54 ms
[2024-06-07 08:52:15] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-06-07 08:52:15] [INFO ] Invariant cache hit.
[2024-06-07 08:52:17] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2095 ms to find 0 implicit places.
Running 3396 sub problems to find dead transitions.
[2024-06-07 08:52:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
At refinement iteration 1 (OVERLAPS) 3397/3488 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3488/3489 variables, and 91 constraints, problems are : Problem set: 0 solved, 3396 unsolved in 30100 ms.
Refiners :[State Equation: 91/92 constraints, PredecessorRefiner: 3396/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
At refinement iteration 1 (OVERLAPS) 3397/3488 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3488 variables, 56/147 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3488/3489 variables, and 147 constraints, problems are : Problem set: 0 solved, 3396 unsolved in 30070 ms.
Refiners :[State Equation: 91/92 constraints, PredecessorRefiner: 3396/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 119462ms problems are : Problem set: 0 solved, 3396 unsolved
Search for dead transitions found 0 dead transitions in 119506ms
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 3397/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121667 ms. Remains : 92/94 places, 3397/3910 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 1652 ms.
Product exploration explored 100000 steps with 0 reset in 1360 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 657 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.35 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 130 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 4422 ms. (9 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 914 ms. (43 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 942 ms. (42 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 651 ms. (61 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 761 ms. (52 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 842 ms. (47 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1159 ms. (34 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1255 ms. (31 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 617 ms. (64 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 719 ms. (55 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 714 ms. (55 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 953 ms. (41 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1014 ms. (39 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 888305 steps, run timeout after 15001 ms. (steps per millisecond=59 ) properties seen :7 out of 12
Probabilistic random walk after 888305 steps, saw 132801 distinct states, run finished after 15001 ms. (steps per millisecond=59 ) properties seen :7
[2024-06-07 08:54:40] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3339/3352 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3352 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/3422 variables, 45/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3422 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/3451 variables, 11/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3451 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 21/3472 variables, 10/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3472 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 16/3488 variables, 12/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3488 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/3489 variables, 1/92 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3489 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3489 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3489/3489 variables, and 92 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2607 ms.
Refiners :[State Equation: 92/92 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3339/3352 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3352 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/3422 variables, 45/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3422 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/3451 variables, 11/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3451 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 21/3472 variables, 10/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3472 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 16/3488 variables, 12/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3488 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/3489 variables, 1/92 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3489 variables, 0/92 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3489 variables, 0/92 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3489/3489 variables, and 92 constraints, problems are : Problem set: 4 solved, 1 unsolved in 1961 ms.
Refiners :[State Equation: 92/92 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4706ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 2 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p1 p2)), (G (OR (NOT p1) (NOT p2))), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1)]
Knowledge based reduction with 25 factoid took 636 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-06-07 08:54:46] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p1 p2)), (G (OR (NOT p1) (NOT p2))), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 25 factoid took 406 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-13 finished in 153483 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' '!(((p0||X(p1)) U p2))'
Support contains 17 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 36 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:54:48] [INFO ] Computed 0 invariants in 36 ms
[2024-06-07 08:54:49] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-07 08:54:49] [INFO ] Invariant cache hit.
[2024-06-07 08:54:50] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:54:50] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
SMT process timed out in 92200ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 92246ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94413 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-14 finished in 94554 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(G((X(G(!p1))||p0))))'
Found a Lengthening insensitive property : ResIsolation-PT-N08P1-LTLFireability-03
Stuttering acceptance computed with spot in 163 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 94 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.42 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 91 transition count 3900
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 84 transition count 3900
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 84 transition count 3891
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 75 transition count 3891
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 72 transition count 3123
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 72 transition count 3123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 72 transition count 3120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 42 place count 72 transition count 3117
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 69 transition count 3117
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 78 place count 54 transition count 3102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 51 transition count 3110
Applied a total of 84 rules in 631 ms. Remains 51 /94 variables (removed 43) and now considering 3110/3910 (removed 800) transitions.
// Phase 1: matrix 3110 rows 51 cols
[2024-06-07 08:56:24] [INFO ] Computed 0 invariants in 44 ms
[2024-06-07 08:56:24] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-06-07 08:56:24] [INFO ] Invariant cache hit.
[2024-06-07 08:56:27] [INFO ] Implicit Places using invariants and state equation in 2284 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 08:56:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3158/3161 variables, and 49 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30111 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3158 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3158/3161 variables, and 57 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30094 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 115623ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 115676ms
Starting structural reductions in LI_LTL mode, iteration 1 : 51/94 places, 3110/3910 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 119226 ms. Remains : 51/94 places, 3110/3910 transitions.
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1893 ms.
Product exploration explored 100000 steps with 0 reset in 1746 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 2346 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 319393 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :1 out of 2
Probabilistic random walk after 319393 steps, saw 48559 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :1
[2024-06-07 08:58:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/3149 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/3161 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3161/3161 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1671 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/3149 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/3161 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3161/3161 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1562 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3273ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 134 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 3110/3110 transitions.
Applied a total of 0 rules in 28 ms. Remains 51 /51 variables (removed 0) and now considering 3110/3110 (removed 0) transitions.
[2024-06-07 08:58:34] [INFO ] Invariant cache hit.
[2024-06-07 08:58:35] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-07 08:58:35] [INFO ] Invariant cache hit.
[2024-06-07 08:58:36] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2293 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 08:58:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3158/3161 variables, and 49 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30068 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3158 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
(s8 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 4)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3158/3161 variables, and 57 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30098 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 114491ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 114526ms
Finished structural reductions in LTL mode , in 1 iterations and 116852 ms. Remains : 51/51 places, 3110/3110 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 2345 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 461 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 392 ms. (101 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 323753 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :1 out of 2
Probabilistic random walk after 323753 steps, saw 49239 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :1
[2024-06-07 09:00:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/3149 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/3161 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3161/3161 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1518 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/3149 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/3161 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3161/3161 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1142 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2696ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 145 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 153 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 2054 ms.
Product exploration explored 100000 steps with 0 reset in 1756 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 3110/3110 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 51 transition count 3109
Applied a total of 1 rules in 418 ms. Remains 51 /51 variables (removed 0) and now considering 3109/3110 (removed 1) transitions.
[2024-06-07 09:00:54] [INFO ] Redundant transitions in 10985 ms returned []
Running 3091 sub problems to find dead transitions.
// Phase 1: matrix 3109 rows 51 cols
[2024-06-07 09:00:54] [INFO ] Computed 0 invariants in 28 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
At refinement iteration 1 (OVERLAPS) 3108/3157 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3157/3160 variables, and 49 constraints, problems are : Problem set: 0 solved, 3091 unsolved in 30081 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3091/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3091 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
At refinement iteration 1 (OVERLAPS) 3108/3157 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3157 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
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 Int declared 3157/3160 variables, and 57 constraints, problems are : Problem set: 0 solved, 3091 unsolved in 30060 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3091/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 113808ms problems are : Problem set: 0 solved, 3091 unsolved
Search for dead transitions found 0 dead transitions in 113841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/51 places, 3109/3110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125267 ms. Remains : 51/51 places, 3109/3110 transitions.
Built C files in :
/tmp/ltsmin1218613671101176683
[2024-06-07 09:02:48] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1218613671101176683
Running compilation step : cd /tmp/ltsmin1218613671101176683;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1218613671101176683;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1218613671101176683;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 3110/3110 transitions.
Applied a total of 0 rules in 28 ms. Remains 51 /51 variables (removed 0) and now considering 3110/3110 (removed 0) transitions.
// Phase 1: matrix 3110 rows 51 cols
[2024-06-07 09:02:51] [INFO ] Computed 0 invariants in 45 ms
[2024-06-07 09:02:51] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-06-07 09:02:52] [INFO ] Invariant cache hit.
[2024-06-07 09:02:53] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 09:02:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3158/3161 variables, and 49 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30060 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3158 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3158/3161 variables, and 57 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30059 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 115352ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 115385ms
Finished structural reductions in LTL mode , in 1 iterations and 117596 ms. Remains : 51/51 places, 3110/3110 transitions.
Built C files in :
/tmp/ltsmin17628411123546028656
[2024-06-07 09:04:49] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17628411123546028656
Running compilation step : cd /tmp/ltsmin17628411123546028656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17628411123546028656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17628411123546028656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-06-07 09:04:52] [INFO ] Flatten gal took : 450 ms
[2024-06-07 09:04:53] [INFO ] Flatten gal took : 451 ms
[2024-06-07 09:04:53] [INFO ] Time to serialize gal into /tmp/LTL5218540409398146137.gal : 57 ms
[2024-06-07 09:04:53] [INFO ] Time to serialize properties into /tmp/LTL10353344097238695213.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5218540409398146137.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8678939184152554487.hoa' '-atoms' '/tmp/LTL10353344097238695213.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10353344097238695213.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8678939184152554487.hoa
Detected timeout of ITS tools.
[2024-06-07 09:05:09] [INFO ] Flatten gal took : 462 ms
[2024-06-07 09:05:09] [INFO ] Flatten gal took : 657 ms
[2024-06-07 09:05:09] [INFO ] Time to serialize gal into /tmp/LTL10113824297895981882.gal : 58 ms
[2024-06-07 09:05:09] [INFO ] Time to serialize properties into /tmp/LTL6442334348821938647.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10113824297895981882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6442334348821938647.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((p36!=1)||(p63!=1))||((p95!=1)||(p123!=1)))||(((p151!=1)||(p179!=1))||((p207!=1)||(p235!=1))))")||(("(p263!=1)")||(X(G("((...272
Formula 0 simplified : XF(!"((((p36!=1)||(p63!=1))||((p95!=1)||(p123!=1)))||(((p151!=1)||(p179!=1))||((p207!=1)||(p235!=1))))" & !"(p263!=1)" & XF!"(((((p3...260
Detected timeout of ITS tools.
[2024-06-07 09:05:25] [INFO ] Flatten gal took : 539 ms
[2024-06-07 09:05:25] [INFO ] Applying decomposition
[2024-06-07 09:05:26] [INFO ] Flatten gal took : 586 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1914018403280655902.txt' '-o' '/tmp/graph1914018403280655902.bin' '-w' '/tmp/graph1914018403280655902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1914018403280655902.bin' '-l' '-1' '-v' '-w' '/tmp/graph1914018403280655902.weights' '-q' '0' '-e' '0.001'
[2024-06-07 09:05:27] [INFO ] Decomposing Gal with order
[2024-06-07 09:05:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 09:05:28] [INFO ] Removed a total of 27486 redundant transitions.
[2024-06-07 09:05:28] [INFO ] Flatten gal took : 731 ms
[2024-06-07 09:05:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 53 ms.
[2024-06-07 09:05:28] [INFO ] Time to serialize gal into /tmp/LTL6246199076332720917.gal : 29 ms
[2024-06-07 09:05:28] [INFO ] Time to serialize properties into /tmp/LTL14294147645106668275.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6246199076332720917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14294147645106668275.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((i1.u1.p36!=1)||(u5.p63!=1))||((u3.p95!=1)||(u4.p123!=1)))||(((u5.p151!=1)||(i1.u6.p179!=1))||((u7.p207!=1)||(u8.p235!=1))...338
Formula 0 simplified : XF(!"((((i1.u1.p36!=1)||(u5.p63!=1))||((u3.p95!=1)||(u4.p123!=1)))||(((u5.p151!=1)||(i1.u6.p179!=1))||((u7.p207!=1)||(u8.p235!=1))))...326
Reverse transition relation is NOT exact ! Due to transitions t25_t27_t3906, t19_t21_t3902, t13_t15_t3907, t7_t9_t3901, t6_t12_t18_t24_t30_t36_t42_t48_t49_...1435
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
352 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.09616,88612,1,0,59162,1737,62324,48056,452,8142,735420
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-03 finished in 549428 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-07 09:05:33] [INFO ] Flatten gal took : 532 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 2665883 ms.

BK_STOP 1717751133415

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ResIsolation-PT-N08P1, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r628-smll-171774445800004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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