Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679211969100

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 07:46:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 07:46:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 07:46:11] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-19 07:46:11] [INFO ] Transformed 6803 places.
[2023-03-19 07:46:12] [INFO ] Transformed 6303 transitions.
[2023-03-19 07:46:12] [INFO ] Found NUPN structural information;
[2023-03-19 07:46:12] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 730 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-100B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-100B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 698 places :
Symmetric choice reduction at 0 with 698 rule applications. Total rules 698 place count 6105 transition count 5605
Iterating global reduction 0 with 698 rules applied. Total rules applied 1396 place count 6105 transition count 5605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1397 place count 6104 transition count 5604
Iterating global reduction 0 with 1 rules applied. Total rules applied 1398 place count 6104 transition count 5604
Applied a total of 1398 rules in 2617 ms. Remains 6104 /6803 variables (removed 699) and now considering 5604/6303 (removed 699) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2023-03-19 07:46:15] [INFO ] Computed 1101 place invariants in 84 ms
[2023-03-19 07:46:18] [INFO ] Implicit Places using invariants in 3883 ms returned []
[2023-03-19 07:46:18] [INFO ] Invariant cache hit.
[2023-03-19 07:46:22] [INFO ] Implicit Places using invariants and state equation in 3287 ms returned []
Implicit Place search using SMT with State Equation took 7210 ms to find 0 implicit places.
[2023-03-19 07:46:22] [INFO ] Invariant cache hit.
[2023-03-19 07:46:22] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6803 places, 5604/6303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10677 ms. Remains : 6104/6803 places, 5604/6303 transitions.
Support contains 36 out of 6104 places after structural reductions.
[2023-03-19 07:46:23] [INFO ] Flatten gal took : 299 ms
[2023-03-19 07:46:23] [INFO ] Flatten gal took : 196 ms
[2023-03-19 07:46:24] [INFO ] Input system was already deterministic with 5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-19 07:46:24] [INFO ] Invariant cache hit.
[2023-03-19 07:46:28] [INFO ] After 3149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-19 07:46:31] [INFO ] [Nat]Absence check using 1101 positive place invariants in 767 ms returned sat
[2023-03-19 07:46:44] [INFO ] After 9700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-19 07:46:47] [INFO ] Deduced a trap composed of 18 places in 2820 ms of which 11 ms to minimize.
[2023-03-19 07:46:50] [INFO ] Deduced a trap composed of 36 places in 2778 ms of which 17 ms to minimize.
[2023-03-19 07:46:53] [INFO ] Deduced a trap composed of 25 places in 2649 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:46:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:46:53] [INFO ] After 25449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 1 properties in 5661 ms.
Support contains 31 out of 6104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Drop transitions removed 691 transitions
Trivial Post-agglo rules discarded 691 transitions
Performed 691 trivial Post agglomeration. Transition count delta: 691
Iterating post reduction 0 with 691 rules applied. Total rules applied 691 place count 6104 transition count 4913
Reduce places removed 691 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 693 rules applied. Total rules applied 1384 place count 5413 transition count 4911
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1386 place count 5411 transition count 4911
Performed 503 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 503 Pre rules applied. Total rules applied 1386 place count 5411 transition count 4408
Deduced a syphon composed of 503 places in 24 ms
Reduce places removed 503 places and 0 transitions.
Iterating global reduction 3 with 1006 rules applied. Total rules applied 2392 place count 4908 transition count 4408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2393 place count 4907 transition count 4407
Iterating global reduction 3 with 1 rules applied. Total rules applied 2394 place count 4907 transition count 4407
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2394 place count 4907 transition count 4406
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2396 place count 4906 transition count 4406
Performed 1780 Post agglomeration using F-continuation condition.Transition count delta: 1780
Deduced a syphon composed of 1780 places in 9 ms
Reduce places removed 1780 places and 0 transitions.
Iterating global reduction 3 with 3560 rules applied. Total rules applied 5956 place count 3126 transition count 2626
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 880 times.
Drop transitions removed 880 transitions
Iterating global reduction 3 with 880 rules applied. Total rules applied 6836 place count 3126 transition count 2626
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6837 place count 3125 transition count 2625
Applied a total of 6837 rules in 2151 ms. Remains 3125 /6104 variables (removed 2979) and now considering 2625/5604 (removed 2979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2152 ms. Remains : 3125/6104 places, 2625/5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 19) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2625 rows 3125 cols
[2023-03-19 07:47:04] [INFO ] Computed 1101 place invariants in 107 ms
[2023-03-19 07:47:05] [INFO ] [Real]Absence check using 1056 positive place invariants in 272 ms returned sat
[2023-03-19 07:47:05] [INFO ] [Real]Absence check using 1056 positive and 45 generalized place invariants in 42 ms returned sat
[2023-03-19 07:47:05] [INFO ] After 1526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 07:47:07] [INFO ] [Nat]Absence check using 1056 positive place invariants in 267 ms returned sat
[2023-03-19 07:47:07] [INFO ] [Nat]Absence check using 1056 positive and 45 generalized place invariants in 11 ms returned sat
[2023-03-19 07:47:11] [INFO ] After 3554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-19 07:47:12] [INFO ] Deduced a trap composed of 7 places in 867 ms of which 2 ms to minimize.
[2023-03-19 07:47:13] [INFO ] Deduced a trap composed of 5 places in 558 ms of which 2 ms to minimize.
[2023-03-19 07:47:14] [INFO ] Deduced a trap composed of 5 places in 776 ms of which 16 ms to minimize.
[2023-03-19 07:47:15] [INFO ] Deduced a trap composed of 5 places in 516 ms of which 1 ms to minimize.
[2023-03-19 07:47:15] [INFO ] Deduced a trap composed of 5 places in 652 ms of which 1 ms to minimize.
[2023-03-19 07:47:16] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 1 ms to minimize.
[2023-03-19 07:47:17] [INFO ] Deduced a trap composed of 5 places in 597 ms of which 1 ms to minimize.
[2023-03-19 07:47:17] [INFO ] Deduced a trap composed of 6 places in 564 ms of which 1 ms to minimize.
[2023-03-19 07:47:18] [INFO ] Deduced a trap composed of 7 places in 526 ms of which 1 ms to minimize.
[2023-03-19 07:47:19] [INFO ] Deduced a trap composed of 7 places in 473 ms of which 1 ms to minimize.
[2023-03-19 07:47:19] [INFO ] Deduced a trap composed of 5 places in 490 ms of which 1 ms to minimize.
[2023-03-19 07:47:20] [INFO ] Deduced a trap composed of 7 places in 523 ms of which 1 ms to minimize.
[2023-03-19 07:47:21] [INFO ] Deduced a trap composed of 7 places in 617 ms of which 1 ms to minimize.
[2023-03-19 07:47:21] [INFO ] Deduced a trap composed of 6 places in 530 ms of which 2 ms to minimize.
[2023-03-19 07:47:22] [INFO ] Deduced a trap composed of 5 places in 523 ms of which 1 ms to minimize.
[2023-03-19 07:47:23] [INFO ] Deduced a trap composed of 5 places in 580 ms of which 1 ms to minimize.
[2023-03-19 07:47:24] [INFO ] Deduced a trap composed of 5 places in 655 ms of which 1 ms to minimize.
[2023-03-19 07:47:24] [INFO ] Deduced a trap composed of 5 places in 514 ms of which 13 ms to minimize.
[2023-03-19 07:47:25] [INFO ] Deduced a trap composed of 7 places in 458 ms of which 2 ms to minimize.
[2023-03-19 07:47:25] [INFO ] Deduced a trap composed of 5 places in 434 ms of which 1 ms to minimize.
[2023-03-19 07:47:26] [INFO ] Deduced a trap composed of 7 places in 465 ms of which 1 ms to minimize.
[2023-03-19 07:47:27] [INFO ] Deduced a trap composed of 33 places in 535 ms of which 2 ms to minimize.
[2023-03-19 07:47:27] [INFO ] Deduced a trap composed of 20 places in 516 ms of which 1 ms to minimize.
[2023-03-19 07:47:28] [INFO ] Deduced a trap composed of 10 places in 533 ms of which 1 ms to minimize.
[2023-03-19 07:47:28] [INFO ] Deduced a trap composed of 6 places in 451 ms of which 1 ms to minimize.
[2023-03-19 07:47:29] [INFO ] Deduced a trap composed of 7 places in 433 ms of which 1 ms to minimize.
[2023-03-19 07:47:29] [INFO ] Deduced a trap composed of 7 places in 371 ms of which 1 ms to minimize.
[2023-03-19 07:47:30] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 1 ms to minimize.
[2023-03-19 07:47:30] [INFO ] Deduced a trap composed of 7 places in 471 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:47:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:47:30] [INFO ] After 25185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 2345 ms.
Support contains 21 out of 3125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3125/3125 places, 2625/2625 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3125 transition count 2623
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3123 transition count 2623
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 3123 transition count 2621
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 3121 transition count 2621
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 17 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 3115 transition count 2615
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 3115 transition count 2615
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 3114 transition count 2614
Applied a total of 25 rules in 802 ms. Remains 3114 /3125 variables (removed 11) and now considering 2614/2625 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 802 ms. Remains : 3114/3125 places, 2614/2625 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 102855 steps, run timeout after 6003 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 102855 steps, saw 96201 distinct states, run finished after 6007 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2614 rows 3114 cols
[2023-03-19 07:47:42] [INFO ] Computed 1101 place invariants in 22 ms
[2023-03-19 07:47:43] [INFO ] [Real]Absence check using 1037 positive place invariants in 266 ms returned sat
[2023-03-19 07:47:43] [INFO ] [Real]Absence check using 1037 positive and 64 generalized place invariants in 16 ms returned sat
[2023-03-19 07:47:44] [INFO ] After 1641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 07:47:45] [INFO ] [Nat]Absence check using 1037 positive place invariants in 285 ms returned sat
[2023-03-19 07:47:45] [INFO ] [Nat]Absence check using 1037 positive and 64 generalized place invariants in 31 ms returned sat
[2023-03-19 07:47:50] [INFO ] After 3536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-19 07:47:51] [INFO ] Deduced a trap composed of 4 places in 715 ms of which 7 ms to minimize.
[2023-03-19 07:47:51] [INFO ] Deduced a trap composed of 6 places in 667 ms of which 2 ms to minimize.
[2023-03-19 07:47:52] [INFO ] Deduced a trap composed of 4 places in 463 ms of which 1 ms to minimize.
[2023-03-19 07:47:53] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2023-03-19 07:47:53] [INFO ] Deduced a trap composed of 8 places in 415 ms of which 1 ms to minimize.
[2023-03-19 07:47:54] [INFO ] Deduced a trap composed of 5 places in 1117 ms of which 1 ms to minimize.
[2023-03-19 07:47:55] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 1 ms to minimize.
[2023-03-19 07:47:55] [INFO ] Deduced a trap composed of 6 places in 410 ms of which 1 ms to minimize.
[2023-03-19 07:47:56] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 0 ms to minimize.
[2023-03-19 07:47:57] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 2 ms to minimize.
[2023-03-19 07:47:57] [INFO ] Deduced a trap composed of 3 places in 385 ms of which 1 ms to minimize.
[2023-03-19 07:47:58] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 1 ms to minimize.
[2023-03-19 07:47:58] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2023-03-19 07:47:58] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 1 ms to minimize.
[2023-03-19 07:47:59] [INFO ] Deduced a trap composed of 8 places in 475 ms of which 1 ms to minimize.
[2023-03-19 07:48:00] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 3 ms to minimize.
[2023-03-19 07:48:00] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 1 ms to minimize.
[2023-03-19 07:48:01] [INFO ] Deduced a trap composed of 5 places in 525 ms of which 3 ms to minimize.
[2023-03-19 07:48:01] [INFO ] Deduced a trap composed of 9 places in 374 ms of which 2 ms to minimize.
[2023-03-19 07:48:02] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2023-03-19 07:48:02] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 1 ms to minimize.
[2023-03-19 07:48:03] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 1 ms to minimize.
[2023-03-19 07:48:03] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 1 ms to minimize.
[2023-03-19 07:48:04] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2023-03-19 07:48:04] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 1 ms to minimize.
[2023-03-19 07:48:04] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 1 ms to minimize.
[2023-03-19 07:48:05] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
[2023-03-19 07:48:05] [INFO ] Deduced a trap composed of 8 places in 323 ms of which 1 ms to minimize.
[2023-03-19 07:48:06] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 0 ms to minimize.
[2023-03-19 07:48:06] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2023-03-19 07:48:07] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-19 07:48:07] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 0 ms to minimize.
[2023-03-19 07:48:07] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 4 ms to minimize.
[2023-03-19 07:48:08] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 0 ms to minimize.
[2023-03-19 07:48:08] [INFO ] Deduced a trap composed of 8 places in 323 ms of which 9 ms to minimize.
[2023-03-19 07:48:09] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:48:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:48:09] [INFO ] After 25187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 2122 ms.
Support contains 21 out of 3114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3114/3114 places, 2614/2614 transitions.
Applied a total of 0 rules in 164 ms. Remains 3114 /3114 variables (removed 0) and now considering 2614/2614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 3114/3114 places, 2614/2614 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3114/3114 places, 2614/2614 transitions.
Applied a total of 0 rules in 250 ms. Remains 3114 /3114 variables (removed 0) and now considering 2614/2614 (removed 0) transitions.
[2023-03-19 07:48:11] [INFO ] Invariant cache hit.
[2023-03-19 07:48:14] [INFO ] Implicit Places using invariants in 2961 ms returned []
[2023-03-19 07:48:14] [INFO ] Invariant cache hit.
[2023-03-19 07:48:20] [INFO ] Implicit Places using invariants and state equation in 5985 ms returned []
Implicit Place search using SMT with State Equation took 8952 ms to find 0 implicit places.
[2023-03-19 07:48:20] [INFO ] Redundant transitions in 194 ms returned []
[2023-03-19 07:48:20] [INFO ] Invariant cache hit.
[2023-03-19 07:48:23] [INFO ] Dead Transitions using invariants and state equation in 2697 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12116 ms. Remains : 3114/3114 places, 2614/2614 transitions.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&p0))))'
Support contains 6 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1615 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 07:48:25] [INFO ] Computed 1101 place invariants in 48 ms
[2023-03-19 07:48:28] [INFO ] Implicit Places using invariants in 2879 ms returned []
[2023-03-19 07:48:28] [INFO ] Invariant cache hit.
[2023-03-19 07:48:29] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 3678 ms to find 0 implicit places.
[2023-03-19 07:48:29] [INFO ] Invariant cache hit.
[2023-03-19 07:48:34] [INFO ] Dead Transitions using invariants and state equation in 5262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10557 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 581 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (EQ s2399 1) (EQ s2431 1)), p0:(AND (OR (EQ s3786 0) (EQ s3821 0)) (OR (EQ s2817 0) (EQ s2841 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-01 finished in 11315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&X(F(p0))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1707 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-19 07:48:37] [INFO ] Invariant cache hit.
[2023-03-19 07:48:37] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-19 07:48:37] [INFO ] Invariant cache hit.
[2023-03-19 07:48:40] [INFO ] Implicit Places using invariants and state equation in 2727 ms returned []
Implicit Place search using SMT with State Equation took 3424 ms to find 0 implicit places.
[2023-03-19 07:48:40] [INFO ] Invariant cache hit.
[2023-03-19 07:48:46] [INFO ] Dead Transitions using invariants and state equation in 5639 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10774 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s2039 0) (EQ s2072 0)), p1:(OR (EQ s2637 0) (EQ s2661 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 1836 ms.
Product exploration explored 100000 steps with 19 reset in 2036 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 520 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 125491 steps, run timeout after 3002 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125491 steps, saw 123542 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 07:48:54] [INFO ] Invariant cache hit.
[2023-03-19 07:48:55] [INFO ] After 1076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:48:57] [INFO ] [Nat]Absence check using 1101 positive place invariants in 693 ms returned sat
[2023-03-19 07:49:03] [INFO ] After 5381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:49:06] [INFO ] Deduced a trap composed of 18 places in 2848 ms of which 4 ms to minimize.
[2023-03-19 07:49:09] [INFO ] Deduced a trap composed of 25 places in 2961 ms of which 9 ms to minimize.
[2023-03-19 07:49:12] [INFO ] Deduced a trap composed of 22 places in 2929 ms of which 5 ms to minimize.
[2023-03-19 07:49:16] [INFO ] Deduced a trap composed of 22 places in 3178 ms of which 4 ms to minimize.
[2023-03-19 07:49:19] [INFO ] Deduced a trap composed of 16 places in 3174 ms of which 5 ms to minimize.
[2023-03-19 07:49:23] [INFO ] Deduced a trap composed of 23 places in 3083 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:49:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:49:23] [INFO ] After 27135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 697 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4402
Deduced a syphon composed of 500 places in 26 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6891 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Applied a total of 6892 rules in 1395 ms. Remains 3104 /6102 variables (removed 2998) and now considering 2604/5602 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1395 ms. Remains : 3104/6102 places, 2604/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59996 steps, run timeout after 3008 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59996 steps, saw 55973 distinct states, run finished after 3008 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 07:49:28] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-19 07:49:29] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:49:30] [INFO ] [Nat]Absence check using 1048 positive place invariants in 255 ms returned sat
[2023-03-19 07:49:30] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 12 ms returned sat
[2023-03-19 07:49:32] [INFO ] After 2168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:49:33] [INFO ] Deduced a trap composed of 6 places in 401 ms of which 1 ms to minimize.
[2023-03-19 07:49:33] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 1 ms to minimize.
[2023-03-19 07:49:34] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2023-03-19 07:49:34] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2023-03-19 07:49:34] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2023-03-19 07:49:35] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2023-03-19 07:49:35] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 0 ms to minimize.
[2023-03-19 07:49:36] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 0 ms to minimize.
[2023-03-19 07:49:36] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2023-03-19 07:49:37] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
[2023-03-19 07:49:37] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2023-03-19 07:49:37] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 1 ms to minimize.
[2023-03-19 07:49:38] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 1 ms to minimize.
[2023-03-19 07:49:38] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-19 07:49:39] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2023-03-19 07:49:39] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 0 ms to minimize.
[2023-03-19 07:49:39] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 0 ms to minimize.
[2023-03-19 07:49:40] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-19 07:49:40] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2023-03-19 07:49:41] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2023-03-19 07:49:41] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2023-03-19 07:49:41] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
[2023-03-19 07:49:42] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2023-03-19 07:49:42] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-19 07:49:42] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2023-03-19 07:49:43] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2023-03-19 07:49:43] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2023-03-19 07:49:44] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 0 ms to minimize.
[2023-03-19 07:49:44] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 0 ms to minimize.
[2023-03-19 07:49:44] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 0 ms to minimize.
[2023-03-19 07:49:45] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2023-03-19 07:49:45] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-19 07:49:45] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2023-03-19 07:49:46] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2023-03-19 07:49:46] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-19 07:49:46] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-19 07:49:47] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-19 07:49:47] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2023-03-19 07:49:47] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-19 07:49:48] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2023-03-19 07:49:48] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2023-03-19 07:49:48] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-19 07:49:49] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-19 07:49:49] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-19 07:49:49] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-19 07:49:50] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2023-03-19 07:49:50] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2023-03-19 07:49:50] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-19 07:49:51] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-19 07:49:51] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2023-03-19 07:49:52] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-19 07:49:52] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2023-03-19 07:49:52] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 0 ms to minimize.
[2023-03-19 07:49:53] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2023-03-19 07:49:53] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-19 07:49:53] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 0 ms to minimize.
[2023-03-19 07:49:54] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-19 07:49:54] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:49:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:49:54] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 815 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 143 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 142 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-19 07:49:55] [INFO ] Invariant cache hit.
[2023-03-19 07:49:59] [INFO ] Implicit Places using invariants in 3329 ms returned []
[2023-03-19 07:49:59] [INFO ] Invariant cache hit.
[2023-03-19 07:50:05] [INFO ] Implicit Places using invariants and state equation in 6640 ms returned []
Implicit Place search using SMT with State Equation took 9978 ms to find 0 implicit places.
[2023-03-19 07:50:05] [INFO ] Redundant transitions in 140 ms returned []
[2023-03-19 07:50:05] [INFO ] Invariant cache hit.
[2023-03-19 07:50:08] [INFO ] Dead Transitions using invariants and state equation in 2449 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12733 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 159 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 07:50:08] [INFO ] Invariant cache hit.
[2023-03-19 07:50:09] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:50:09] [INFO ] [Nat]Absence check using 1048 positive place invariants in 245 ms returned sat
[2023-03-19 07:50:09] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 13 ms returned sat
[2023-03-19 07:50:12] [INFO ] After 2202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:50:12] [INFO ] Deduced a trap composed of 4 places in 655 ms of which 2 ms to minimize.
[2023-03-19 07:50:13] [INFO ] Deduced a trap composed of 5 places in 715 ms of which 2 ms to minimize.
[2023-03-19 07:50:14] [INFO ] Deduced a trap composed of 4 places in 782 ms of which 2 ms to minimize.
[2023-03-19 07:50:15] [INFO ] Deduced a trap composed of 6 places in 782 ms of which 1 ms to minimize.
[2023-03-19 07:50:16] [INFO ] Deduced a trap composed of 5 places in 646 ms of which 1 ms to minimize.
[2023-03-19 07:50:17] [INFO ] Deduced a trap composed of 6 places in 616 ms of which 1 ms to minimize.
[2023-03-19 07:50:17] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 3 ms to minimize.
[2023-03-19 07:50:18] [INFO ] Deduced a trap composed of 4 places in 779 ms of which 2 ms to minimize.
[2023-03-19 07:50:19] [INFO ] Deduced a trap composed of 5 places in 597 ms of which 2 ms to minimize.
[2023-03-19 07:50:20] [INFO ] Deduced a trap composed of 6 places in 670 ms of which 2 ms to minimize.
[2023-03-19 07:50:21] [INFO ] Deduced a trap composed of 6 places in 790 ms of which 2 ms to minimize.
[2023-03-19 07:50:22] [INFO ] Deduced a trap composed of 6 places in 572 ms of which 2 ms to minimize.
[2023-03-19 07:50:22] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 1 ms to minimize.
[2023-03-19 07:50:23] [INFO ] Deduced a trap composed of 4 places in 724 ms of which 2 ms to minimize.
[2023-03-19 07:50:24] [INFO ] Deduced a trap composed of 6 places in 627 ms of which 1 ms to minimize.
[2023-03-19 07:50:25] [INFO ] Deduced a trap composed of 8 places in 485 ms of which 1 ms to minimize.
[2023-03-19 07:50:25] [INFO ] Deduced a trap composed of 5 places in 507 ms of which 1 ms to minimize.
[2023-03-19 07:50:26] [INFO ] Deduced a trap composed of 6 places in 507 ms of which 1 ms to minimize.
[2023-03-19 07:50:27] [INFO ] Deduced a trap composed of 9 places in 486 ms of which 1 ms to minimize.
[2023-03-19 07:50:27] [INFO ] Deduced a trap composed of 6 places in 588 ms of which 2 ms to minimize.
[2023-03-19 07:50:28] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 1 ms to minimize.
[2023-03-19 07:50:29] [INFO ] Deduced a trap composed of 9 places in 459 ms of which 1 ms to minimize.
[2023-03-19 07:50:29] [INFO ] Deduced a trap composed of 4 places in 500 ms of which 2 ms to minimize.
[2023-03-19 07:50:30] [INFO ] Deduced a trap composed of 6 places in 506 ms of which 1 ms to minimize.
[2023-03-19 07:50:31] [INFO ] Deduced a trap composed of 9 places in 484 ms of which 1 ms to minimize.
[2023-03-19 07:50:31] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2023-03-19 07:50:32] [INFO ] Deduced a trap composed of 6 places in 509 ms of which 1 ms to minimize.
[2023-03-19 07:50:32] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 1 ms to minimize.
[2023-03-19 07:50:33] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 1 ms to minimize.
[2023-03-19 07:50:34] [INFO ] Deduced a trap composed of 8 places in 577 ms of which 1 ms to minimize.
[2023-03-19 07:50:34] [INFO ] Deduced a trap composed of 6 places in 463 ms of which 1 ms to minimize.
[2023-03-19 07:50:35] [INFO ] Deduced a trap composed of 6 places in 443 ms of which 1 ms to minimize.
[2023-03-19 07:50:35] [INFO ] Deduced a trap composed of 6 places in 546 ms of which 1 ms to minimize.
[2023-03-19 07:50:36] [INFO ] Deduced a trap composed of 6 places in 465 ms of which 2 ms to minimize.
[2023-03-19 07:50:37] [INFO ] Deduced a trap composed of 12 places in 428 ms of which 2 ms to minimize.
[2023-03-19 07:50:37] [INFO ] Deduced a trap composed of 6 places in 379 ms of which 1 ms to minimize.
[2023-03-19 07:50:38] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 1 ms to minimize.
[2023-03-19 07:50:38] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 1 ms to minimize.
[2023-03-19 07:50:39] [INFO ] Deduced a trap composed of 6 places in 428 ms of which 0 ms to minimize.
[2023-03-19 07:50:39] [INFO ] Deduced a trap composed of 8 places in 368 ms of which 1 ms to minimize.
[2023-03-19 07:50:40] [INFO ] Deduced a trap composed of 17 places in 447 ms of which 1 ms to minimize.
[2023-03-19 07:50:40] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 1 ms to minimize.
[2023-03-19 07:50:41] [INFO ] Deduced a trap composed of 6 places in 454 ms of which 1 ms to minimize.
[2023-03-19 07:50:41] [INFO ] Deduced a trap composed of 23 places in 493 ms of which 1 ms to minimize.
[2023-03-19 07:50:42] [INFO ] Deduced a trap composed of 28 places in 523 ms of which 2 ms to minimize.
[2023-03-19 07:50:43] [INFO ] Deduced a trap composed of 5 places in 413 ms of which 1 ms to minimize.
[2023-03-19 07:50:43] [INFO ] Deduced a trap composed of 17 places in 497 ms of which 1 ms to minimize.
[2023-03-19 07:50:44] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 1 ms to minimize.
[2023-03-19 07:50:44] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 0 ms to minimize.
[2023-03-19 07:50:45] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 1 ms to minimize.
[2023-03-19 07:50:45] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 1 ms to minimize.
[2023-03-19 07:50:46] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 1 ms to minimize.
[2023-03-19 07:50:46] [INFO ] Deduced a trap composed of 34 places in 324 ms of which 1 ms to minimize.
[2023-03-19 07:50:46] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 34716 ms
[2023-03-19 07:50:47] [INFO ] After 37739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 556 ms.
[2023-03-19 07:50:48] [INFO ] After 39255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 437 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 606 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 07:50:49] [INFO ] Computed 1101 place invariants in 44 ms
[2023-03-19 07:50:50] [INFO ] Implicit Places using invariants in 735 ms returned []
[2023-03-19 07:50:50] [INFO ] Invariant cache hit.
[2023-03-19 07:50:51] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
[2023-03-19 07:50:51] [INFO ] Invariant cache hit.
[2023-03-19 07:50:56] [INFO ] Dead Transitions using invariants and state equation in 4687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6753 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 482 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 128845 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128845 steps, saw 126859 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 07:51:00] [INFO ] Invariant cache hit.
[2023-03-19 07:51:01] [INFO ] After 1007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:51:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 752 ms returned sat
[2023-03-19 07:51:10] [INFO ] After 6072ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:51:13] [INFO ] Deduced a trap composed of 18 places in 3029 ms of which 5 ms to minimize.
[2023-03-19 07:51:16] [INFO ] Deduced a trap composed of 25 places in 3126 ms of which 4 ms to minimize.
[2023-03-19 07:51:21] [INFO ] Deduced a trap composed of 22 places in 4271 ms of which 5 ms to minimize.
[2023-03-19 07:51:24] [INFO ] Deduced a trap composed of 22 places in 3042 ms of which 4 ms to minimize.
[2023-03-19 07:51:27] [INFO ] Deduced a trap composed of 16 places in 3039 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:51:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:51:27] [INFO ] After 26159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 612 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4402
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6891 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Applied a total of 6892 rules in 1196 ms. Remains 3104 /6102 variables (removed 2998) and now considering 2604/5602 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1196 ms. Remains : 3104/6102 places, 2604/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 61538 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61538 steps, saw 57465 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 07:51:33] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-19 07:51:33] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:51:34] [INFO ] [Nat]Absence check using 1048 positive place invariants in 233 ms returned sat
[2023-03-19 07:51:34] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 15 ms returned sat
[2023-03-19 07:51:37] [INFO ] After 2305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:51:37] [INFO ] Deduced a trap composed of 6 places in 410 ms of which 1 ms to minimize.
[2023-03-19 07:51:38] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2023-03-19 07:51:38] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 0 ms to minimize.
[2023-03-19 07:51:38] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2023-03-19 07:51:39] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2023-03-19 07:51:39] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2023-03-19 07:51:40] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 1 ms to minimize.
[2023-03-19 07:51:40] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 0 ms to minimize.
[2023-03-19 07:51:41] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2023-03-19 07:51:41] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-19 07:51:41] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 0 ms to minimize.
[2023-03-19 07:51:42] [INFO ] Deduced a trap composed of 6 places in 457 ms of which 1 ms to minimize.
[2023-03-19 07:51:42] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 1 ms to minimize.
[2023-03-19 07:51:43] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2023-03-19 07:51:43] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-19 07:51:44] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-19 07:51:44] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-19 07:51:45] [INFO ] Deduced a trap composed of 6 places in 395 ms of which 1 ms to minimize.
[2023-03-19 07:51:45] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-19 07:51:45] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2023-03-19 07:51:46] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2023-03-19 07:51:46] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-19 07:51:46] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-19 07:51:47] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2023-03-19 07:51:47] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2023-03-19 07:51:47] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2023-03-19 07:51:48] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2023-03-19 07:51:48] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-19 07:51:48] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-19 07:51:49] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 2 ms to minimize.
[2023-03-19 07:51:49] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-19 07:51:49] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-19 07:51:50] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 0 ms to minimize.
[2023-03-19 07:51:50] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2023-03-19 07:51:51] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-19 07:51:51] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2023-03-19 07:51:51] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 0 ms to minimize.
[2023-03-19 07:51:52] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2023-03-19 07:51:52] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2023-03-19 07:51:52] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-19 07:51:53] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2023-03-19 07:51:53] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 1 ms to minimize.
[2023-03-19 07:51:53] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 0 ms to minimize.
[2023-03-19 07:51:54] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-19 07:51:54] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 0 ms to minimize.
[2023-03-19 07:51:55] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2023-03-19 07:51:55] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-19 07:51:55] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2023-03-19 07:51:56] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-19 07:51:56] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 0 ms to minimize.
[2023-03-19 07:51:56] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-19 07:51:57] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 0 ms to minimize.
[2023-03-19 07:51:57] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 0 ms to minimize.
[2023-03-19 07:51:58] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2023-03-19 07:51:58] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 1 ms to minimize.
[2023-03-19 07:51:59] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:51:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:51:59] [INFO ] After 25228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 834 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 141 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 145 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-19 07:52:00] [INFO ] Invariant cache hit.
[2023-03-19 07:52:03] [INFO ] Implicit Places using invariants in 3003 ms returned []
[2023-03-19 07:52:03] [INFO ] Invariant cache hit.
[2023-03-19 07:52:09] [INFO ] Implicit Places using invariants and state equation in 6283 ms returned []
Implicit Place search using SMT with State Equation took 9290 ms to find 0 implicit places.
[2023-03-19 07:52:09] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-19 07:52:09] [INFO ] Invariant cache hit.
[2023-03-19 07:52:10] [INFO ] Dead Transitions using invariants and state equation in 1390 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10927 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 136 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 07:52:11] [INFO ] Invariant cache hit.
[2023-03-19 07:52:11] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:52:12] [INFO ] [Nat]Absence check using 1048 positive place invariants in 264 ms returned sat
[2023-03-19 07:52:12] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 11 ms returned sat
[2023-03-19 07:52:15] [INFO ] After 2414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:52:15] [INFO ] Deduced a trap composed of 4 places in 723 ms of which 1 ms to minimize.
[2023-03-19 07:52:16] [INFO ] Deduced a trap composed of 5 places in 766 ms of which 2 ms to minimize.
[2023-03-19 07:52:17] [INFO ] Deduced a trap composed of 4 places in 685 ms of which 14 ms to minimize.
[2023-03-19 07:52:18] [INFO ] Deduced a trap composed of 6 places in 639 ms of which 2 ms to minimize.
[2023-03-19 07:52:19] [INFO ] Deduced a trap composed of 5 places in 648 ms of which 2 ms to minimize.
[2023-03-19 07:52:19] [INFO ] Deduced a trap composed of 6 places in 623 ms of which 1 ms to minimize.
[2023-03-19 07:52:20] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 2 ms to minimize.
[2023-03-19 07:52:21] [INFO ] Deduced a trap composed of 4 places in 652 ms of which 3 ms to minimize.
[2023-03-19 07:52:22] [INFO ] Deduced a trap composed of 5 places in 673 ms of which 3 ms to minimize.
[2023-03-19 07:52:22] [INFO ] Deduced a trap composed of 6 places in 624 ms of which 1 ms to minimize.
[2023-03-19 07:52:23] [INFO ] Deduced a trap composed of 6 places in 644 ms of which 2 ms to minimize.
[2023-03-19 07:52:24] [INFO ] Deduced a trap composed of 6 places in 611 ms of which 1 ms to minimize.
[2023-03-19 07:52:25] [INFO ] Deduced a trap composed of 4 places in 669 ms of which 1 ms to minimize.
[2023-03-19 07:52:25] [INFO ] Deduced a trap composed of 4 places in 563 ms of which 2 ms to minimize.
[2023-03-19 07:52:26] [INFO ] Deduced a trap composed of 6 places in 624 ms of which 1 ms to minimize.
[2023-03-19 07:52:27] [INFO ] Deduced a trap composed of 8 places in 519 ms of which 1 ms to minimize.
[2023-03-19 07:52:27] [INFO ] Deduced a trap composed of 5 places in 547 ms of which 2 ms to minimize.
[2023-03-19 07:52:28] [INFO ] Deduced a trap composed of 6 places in 476 ms of which 1 ms to minimize.
[2023-03-19 07:52:29] [INFO ] Deduced a trap composed of 9 places in 491 ms of which 1 ms to minimize.
[2023-03-19 07:52:29] [INFO ] Deduced a trap composed of 6 places in 477 ms of which 0 ms to minimize.
[2023-03-19 07:52:30] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 1 ms to minimize.
[2023-03-19 07:52:30] [INFO ] Deduced a trap composed of 9 places in 464 ms of which 1 ms to minimize.
[2023-03-19 07:52:31] [INFO ] Deduced a trap composed of 4 places in 593 ms of which 1 ms to minimize.
[2023-03-19 07:52:32] [INFO ] Deduced a trap composed of 6 places in 475 ms of which 2 ms to minimize.
[2023-03-19 07:52:32] [INFO ] Deduced a trap composed of 9 places in 475 ms of which 1 ms to minimize.
[2023-03-19 07:52:33] [INFO ] Deduced a trap composed of 6 places in 511 ms of which 1 ms to minimize.
[2023-03-19 07:52:33] [INFO ] Deduced a trap composed of 6 places in 508 ms of which 2 ms to minimize.
[2023-03-19 07:52:34] [INFO ] Deduced a trap composed of 6 places in 532 ms of which 1 ms to minimize.
[2023-03-19 07:52:35] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 1 ms to minimize.
[2023-03-19 07:52:35] [INFO ] Deduced a trap composed of 8 places in 523 ms of which 1 ms to minimize.
[2023-03-19 07:52:36] [INFO ] Deduced a trap composed of 6 places in 458 ms of which 1 ms to minimize.
[2023-03-19 07:52:37] [INFO ] Deduced a trap composed of 6 places in 500 ms of which 2 ms to minimize.
[2023-03-19 07:52:37] [INFO ] Deduced a trap composed of 6 places in 583 ms of which 1 ms to minimize.
[2023-03-19 07:52:38] [INFO ] Deduced a trap composed of 6 places in 554 ms of which 1 ms to minimize.
[2023-03-19 07:52:38] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 1 ms to minimize.
[2023-03-19 07:52:39] [INFO ] Deduced a trap composed of 6 places in 536 ms of which 1 ms to minimize.
[2023-03-19 07:52:39] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 1 ms to minimize.
[2023-03-19 07:52:40] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2023-03-19 07:52:40] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 1 ms to minimize.
[2023-03-19 07:52:41] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 1 ms to minimize.
[2023-03-19 07:52:41] [INFO ] Deduced a trap composed of 17 places in 416 ms of which 1 ms to minimize.
[2023-03-19 07:52:42] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 1 ms to minimize.
[2023-03-19 07:52:42] [INFO ] Deduced a trap composed of 6 places in 354 ms of which 1 ms to minimize.
[2023-03-19 07:52:43] [INFO ] Deduced a trap composed of 23 places in 341 ms of which 1 ms to minimize.
[2023-03-19 07:52:43] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 1 ms to minimize.
[2023-03-19 07:52:44] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 1 ms to minimize.
[2023-03-19 07:52:44] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 1 ms to minimize.
[2023-03-19 07:52:45] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 2 ms to minimize.
[2023-03-19 07:52:45] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 1 ms to minimize.
[2023-03-19 07:52:46] [INFO ] Deduced a trap composed of 17 places in 347 ms of which 2 ms to minimize.
[2023-03-19 07:52:46] [INFO ] Deduced a trap composed of 17 places in 353 ms of which 1 ms to minimize.
[2023-03-19 07:52:47] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 1 ms to minimize.
[2023-03-19 07:52:47] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 1 ms to minimize.
[2023-03-19 07:52:47] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 32670 ms
[2023-03-19 07:52:48] [INFO ] After 35814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 566 ms.
[2023-03-19 07:52:48] [INFO ] After 37351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 497 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25 reset in 1508 ms.
Product exploration explored 100000 steps with 15 reset in 1973 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6102 transition count 5602
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 203 Pre rules applied. Total rules applied 699 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 30 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2095 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2997 places in 10 ms
Iterating global reduction 1 with 2095 rules applied. Total rules applied 2997 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 698 places :
Symmetric choice reduction at 1 with 698 rule applications. Total rules 3695 place count 5404 transition count 4905
Deduced a syphon composed of 2299 places in 10 ms
Iterating global reduction 1 with 698 rules applied. Total rules applied 4393 place count 5404 transition count 4905
Deduced a syphon composed of 2299 places in 9 ms
Applied a total of 4393 rules in 5501 ms. Remains 5404 /6102 variables (removed 698) and now considering 4905/5602 (removed 697) transitions.
[2023-03-19 07:52:59] [INFO ] Redundant transitions in 232 ms returned []
// Phase 1: matrix 4905 rows 5404 cols
[2023-03-19 07:53:00] [INFO ] Computed 1101 place invariants in 156 ms
[2023-03-19 07:53:04] [INFO ] Dead Transitions using invariants and state equation in 4657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5404/6102 places, 4905/5602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10409 ms. Remains : 5404/6102 places, 4905/5602 transitions.
Built C files in :
/tmp/ltsmin339220554917537075
[2023-03-19 07:53:04] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin339220554917537075
Running compilation step : cd /tmp/ltsmin339220554917537075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin339220554917537075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin339220554917537075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 633 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 07:53:08] [INFO ] Computed 1101 place invariants in 32 ms
[2023-03-19 07:53:11] [INFO ] Implicit Places using invariants in 2946 ms returned []
[2023-03-19 07:53:11] [INFO ] Invariant cache hit.
[2023-03-19 07:53:13] [INFO ] Implicit Places using invariants and state equation in 2586 ms returned []
Implicit Place search using SMT with State Equation took 5550 ms to find 0 implicit places.
[2023-03-19 07:53:13] [INFO ] Invariant cache hit.
[2023-03-19 07:53:18] [INFO ] Dead Transitions using invariants and state equation in 5106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11306 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Built C files in :
/tmp/ltsmin5610625749731511513
[2023-03-19 07:53:19] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5610625749731511513
Running compilation step : cd /tmp/ltsmin5610625749731511513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5610625749731511513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5610625749731511513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 07:53:22] [INFO ] Flatten gal took : 156 ms
[2023-03-19 07:53:22] [INFO ] Flatten gal took : 188 ms
[2023-03-19 07:53:22] [INFO ] Time to serialize gal into /tmp/LTL1887658840908834308.gal : 39 ms
[2023-03-19 07:53:22] [INFO ] Time to serialize properties into /tmp/LTL13716865273601754716.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1887658840908834308.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10875991742438184833.hoa' '-atoms' '/tmp/LTL13716865273601754716.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13716865273601754716.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10875991742438184833.hoa
Detected timeout of ITS tools.
[2023-03-19 07:53:38] [INFO ] Flatten gal took : 149 ms
[2023-03-19 07:53:38] [INFO ] Flatten gal took : 145 ms
[2023-03-19 07:53:38] [INFO ] Time to serialize gal into /tmp/LTL10968334044179533599.gal : 27 ms
[2023-03-19 07:53:38] [INFO ] Time to serialize properties into /tmp/LTL16780044422416242364.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10968334044179533599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16780044422416242364.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((p2931==0)||(p2956==0))"))&&(X(F("((p2263==0)||(p2300==0))"))))&&("((p2263==0)||(p2300==0))")))))
Formula 0 simplified : XG(!"((p2263==0)||(p2300==0))" | F!"((p2931==0)||(p2956==0))" | XG!"((p2263==0)||(p2300==0))")
Detected timeout of ITS tools.
[2023-03-19 07:53:53] [INFO ] Flatten gal took : 127 ms
[2023-03-19 07:53:53] [INFO ] Applying decomposition
[2023-03-19 07:53:53] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3272092078271685217.txt' '-o' '/tmp/graph3272092078271685217.bin' '-w' '/tmp/graph3272092078271685217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3272092078271685217.bin' '-l' '-1' '-v' '-w' '/tmp/graph3272092078271685217.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:53:54] [INFO ] Decomposing Gal with order
[2023-03-19 07:53:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:53:56] [INFO ] Removed a total of 900 redundant transitions.
[2023-03-19 07:53:56] [INFO ] Flatten gal took : 414 ms
[2023-03-19 07:53:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2023-03-19 07:53:56] [INFO ] Time to serialize gal into /tmp/LTL17302995787520707882.gal : 54 ms
[2023-03-19 07:53:56] [INFO ] Time to serialize properties into /tmp/LTL13114297828861286440.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17302995787520707882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13114297828861286440.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((i30.i1.i1.i0.u1041.p2931==0)||(i30.i1.i1.i1.u1050.p2956==0))"))&&(X(F("((i23.u805.p2263==0)||(i23.u818.p2300==0))"))))&&...205
Formula 0 simplified : XG(!"((i23.u805.p2263==0)||(i23.u818.p2300==0))" | F!"((i30.i1.i1.i0.u1041.p2931==0)||(i30.i1.i1.i1.u1050.p2956==0))" | XG!"((i23.u8...191
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4935229654945848803
[2023-03-19 07:54:11] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4935229654945848803
Running compilation step : cd /tmp/ltsmin4935229654945848803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4935229654945848803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4935229654945848803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100B-LTLFireability-03 finished in 339397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6103 transition count 4901
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4401
Deduced a syphon composed of 500 places in 22 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2406 place count 4899 transition count 4399
Iterating global reduction 2 with 2 rules applied. Total rules applied 2408 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2408 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2410 place count 4898 transition count 4398
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 8 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 6000 place count 3103 transition count 2603
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6002 place count 3101 transition count 2601
Applied a total of 6002 rules in 1902 ms. Remains 3101 /6104 variables (removed 3003) and now considering 2601/5604 (removed 3003) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-19 07:54:16] [INFO ] Computed 1101 place invariants in 13 ms
[2023-03-19 07:54:18] [INFO ] Implicit Places using invariants in 1483 ms returned []
[2023-03-19 07:54:18] [INFO ] Invariant cache hit.
[2023-03-19 07:54:23] [INFO ] Implicit Places using invariants and state equation in 4930 ms returned []
Implicit Place search using SMT with State Equation took 6416 ms to find 0 implicit places.
[2023-03-19 07:54:23] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-19 07:54:23] [INFO ] Invariant cache hit.
[2023-03-19 07:54:25] [INFO ] Dead Transitions using invariants and state equation in 2433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/6104 places, 2601/5604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10844 ms. Remains : 3101/6104 places, 2601/5604 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s387 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6622 steps with 0 reset in 143 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-04 finished in 11126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6103 transition count 5603
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6103 transition count 5603
Applied a total of 2 rules in 1430 ms. Remains 6103 /6104 variables (removed 1) and now considering 5603/5604 (removed 1) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-19 07:54:27] [INFO ] Computed 1101 place invariants in 54 ms
[2023-03-19 07:54:30] [INFO ] Implicit Places using invariants in 2924 ms returned []
[2023-03-19 07:54:30] [INFO ] Invariant cache hit.
[2023-03-19 07:54:33] [INFO ] Implicit Places using invariants and state equation in 2772 ms returned []
Implicit Place search using SMT with State Equation took 5704 ms to find 0 implicit places.
[2023-03-19 07:54:33] [INFO ] Invariant cache hit.
[2023-03-19 07:54:38] [INFO ] Dead Transitions using invariants and state equation in 5247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6104 places, 5603/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12384 ms. Remains : 6103/6104 places, 5603/5604 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s3627 1), p1:(NEQ s1831 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1585 ms.
Product exploration explored 100000 steps with 50000 reset in 1623 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Detected a total of 1199/6103 stabilizing places and 1199/5603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 8 factoid took 294 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLFireability-05 finished in 16229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p2))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1285 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 07:54:43] [INFO ] Computed 1101 place invariants in 18 ms
[2023-03-19 07:54:46] [INFO ] Implicit Places using invariants in 2808 ms returned []
[2023-03-19 07:54:46] [INFO ] Invariant cache hit.
[2023-03-19 07:54:48] [INFO ] Implicit Places using invariants and state equation in 2621 ms returned []
Implicit Place search using SMT with State Equation took 5468 ms to find 0 implicit places.
[2023-03-19 07:54:48] [INFO ] Invariant cache hit.
[2023-03-19 07:54:53] [INFO ] Dead Transitions using invariants and state equation in 4723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11494 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2526 0) (EQ s2560 0)), p1:(OR (EQ s4242 0) (EQ s1886 0)), p2:(EQ s4242 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8 reset in 1571 ms.
Product exploration explored 100000 steps with 9 reset in 2014 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1112 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 07:54:59] [INFO ] Invariant cache hit.
[2023-03-19 07:55:01] [INFO ] After 1487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 07:55:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 694 ms returned sat
[2023-03-19 07:55:09] [INFO ] After 5957ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 07:55:13] [INFO ] Deduced a trap composed of 20 places in 3053 ms of which 4 ms to minimize.
[2023-03-19 07:55:17] [INFO ] Deduced a trap composed of 24 places in 3571 ms of which 4 ms to minimize.
[2023-03-19 07:55:20] [INFO ] Deduced a trap composed of 22 places in 2910 ms of which 4 ms to minimize.
[2023-03-19 07:55:23] [INFO ] Deduced a trap composed of 23 places in 3107 ms of which 4 ms to minimize.
[2023-03-19 07:55:27] [INFO ] Deduced a trap composed of 14 places in 3235 ms of which 9 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:55:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:55:27] [INFO ] After 26020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 947 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 23 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 9 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5992 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6888 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6889 place count 3105 transition count 2605
Applied a total of 6889 rules in 1378 ms. Remains 3105 /6102 variables (removed 2997) and now considering 2605/5602 (removed 2997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1378 ms. Remains : 3105/6102 places, 2605/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 61047 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61047 steps, saw 56154 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-19 07:55:33] [INFO ] Computed 1101 place invariants in 36 ms
[2023-03-19 07:55:33] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:55:34] [INFO ] [Nat]Absence check using 1055 positive place invariants in 328 ms returned sat
[2023-03-19 07:55:34] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 24 ms returned sat
[2023-03-19 07:55:37] [INFO ] After 2802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:55:38] [INFO ] Deduced a trap composed of 6 places in 473 ms of which 2 ms to minimize.
[2023-03-19 07:55:38] [INFO ] Deduced a trap composed of 6 places in 444 ms of which 1 ms to minimize.
[2023-03-19 07:55:39] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2023-03-19 07:55:39] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2023-03-19 07:55:40] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 2 ms to minimize.
[2023-03-19 07:55:41] [INFO ] Deduced a trap composed of 6 places in 816 ms of which 1 ms to minimize.
[2023-03-19 07:55:42] [INFO ] Deduced a trap composed of 6 places in 420 ms of which 0 ms to minimize.
[2023-03-19 07:55:42] [INFO ] Deduced a trap composed of 6 places in 474 ms of which 1 ms to minimize.
[2023-03-19 07:55:43] [INFO ] Deduced a trap composed of 6 places in 623 ms of which 2 ms to minimize.
[2023-03-19 07:55:44] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 1 ms to minimize.
[2023-03-19 07:55:44] [INFO ] Deduced a trap composed of 5 places in 428 ms of which 1 ms to minimize.
[2023-03-19 07:55:45] [INFO ] Deduced a trap composed of 6 places in 527 ms of which 3 ms to minimize.
[2023-03-19 07:55:45] [INFO ] Deduced a trap composed of 5 places in 438 ms of which 1 ms to minimize.
[2023-03-19 07:55:46] [INFO ] Deduced a trap composed of 5 places in 370 ms of which 1 ms to minimize.
[2023-03-19 07:55:46] [INFO ] Deduced a trap composed of 9 places in 471 ms of which 1 ms to minimize.
[2023-03-19 07:55:47] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 2 ms to minimize.
[2023-03-19 07:55:48] [INFO ] Deduced a trap composed of 5 places in 471 ms of which 1 ms to minimize.
[2023-03-19 07:55:48] [INFO ] Deduced a trap composed of 8 places in 381 ms of which 1 ms to minimize.
[2023-03-19 07:55:48] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2023-03-19 07:55:49] [INFO ] Deduced a trap composed of 6 places in 354 ms of which 1 ms to minimize.
[2023-03-19 07:55:49] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 1 ms to minimize.
[2023-03-19 07:55:50] [INFO ] Deduced a trap composed of 11 places in 363 ms of which 1 ms to minimize.
[2023-03-19 07:55:50] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 1 ms to minimize.
[2023-03-19 07:55:51] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 1 ms to minimize.
[2023-03-19 07:55:51] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 1 ms to minimize.
[2023-03-19 07:55:52] [INFO ] Deduced a trap composed of 8 places in 386 ms of which 1 ms to minimize.
[2023-03-19 07:55:52] [INFO ] Deduced a trap composed of 6 places in 396 ms of which 1 ms to minimize.
[2023-03-19 07:55:53] [INFO ] Deduced a trap composed of 8 places in 449 ms of which 1 ms to minimize.
[2023-03-19 07:55:53] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
[2023-03-19 07:55:54] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2023-03-19 07:55:54] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 1 ms to minimize.
[2023-03-19 07:55:55] [INFO ] Deduced a trap composed of 6 places in 465 ms of which 1 ms to minimize.
[2023-03-19 07:55:55] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 1 ms to minimize.
[2023-03-19 07:55:55] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 1 ms to minimize.
[2023-03-19 07:55:56] [INFO ] Deduced a trap composed of 6 places in 366 ms of which 0 ms to minimize.
[2023-03-19 07:55:56] [INFO ] Deduced a trap composed of 9 places in 389 ms of which 1 ms to minimize.
[2023-03-19 07:55:57] [INFO ] Deduced a trap composed of 14 places in 325 ms of which 1 ms to minimize.
[2023-03-19 07:55:57] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 2 ms to minimize.
[2023-03-19 07:55:58] [INFO ] Deduced a trap composed of 9 places in 410 ms of which 1 ms to minimize.
[2023-03-19 07:55:58] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2023-03-19 07:55:59] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:55:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:55:59] [INFO ] After 25244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 333 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 150 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 149 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-19 07:55:59] [INFO ] Invariant cache hit.
[2023-03-19 07:56:02] [INFO ] Implicit Places using invariants in 2796 ms returned []
[2023-03-19 07:56:02] [INFO ] Invariant cache hit.
[2023-03-19 07:56:04] [INFO ] Implicit Places using invariants and state equation in 2074 ms returned []
Implicit Place search using SMT with State Equation took 4874 ms to find 0 implicit places.
[2023-03-19 07:56:04] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-19 07:56:04] [INFO ] Invariant cache hit.
[2023-03-19 07:56:07] [INFO ] Dead Transitions using invariants and state equation in 2438 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7570 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 179 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 07:56:07] [INFO ] Invariant cache hit.
[2023-03-19 07:56:07] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:56:08] [INFO ] [Nat]Absence check using 1055 positive place invariants in 280 ms returned sat
[2023-03-19 07:56:08] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-19 07:56:11] [INFO ] After 2663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:56:12] [INFO ] Deduced a trap composed of 5 places in 555 ms of which 1 ms to minimize.
[2023-03-19 07:56:13] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 1 ms to minimize.
[2023-03-19 07:56:13] [INFO ] Deduced a trap composed of 6 places in 471 ms of which 1 ms to minimize.
[2023-03-19 07:56:14] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2023-03-19 07:56:15] [INFO ] Deduced a trap composed of 5 places in 503 ms of which 1 ms to minimize.
[2023-03-19 07:56:15] [INFO ] Deduced a trap composed of 6 places in 513 ms of which 1 ms to minimize.
[2023-03-19 07:56:16] [INFO ] Deduced a trap composed of 6 places in 480 ms of which 2 ms to minimize.
[2023-03-19 07:56:16] [INFO ] Deduced a trap composed of 6 places in 450 ms of which 1 ms to minimize.
[2023-03-19 07:56:17] [INFO ] Deduced a trap composed of 4 places in 613 ms of which 2 ms to minimize.
[2023-03-19 07:56:18] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 1 ms to minimize.
[2023-03-19 07:56:18] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2023-03-19 07:56:19] [INFO ] Deduced a trap composed of 4 places in 577 ms of which 1 ms to minimize.
[2023-03-19 07:56:19] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 0 ms to minimize.
[2023-03-19 07:56:20] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2023-03-19 07:56:20] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-19 07:56:21] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 1 ms to minimize.
[2023-03-19 07:56:21] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2023-03-19 07:56:22] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2023-03-19 07:56:22] [INFO ] Deduced a trap composed of 6 places in 479 ms of which 1 ms to minimize.
[2023-03-19 07:56:23] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 1 ms to minimize.
[2023-03-19 07:56:23] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-19 07:56:23] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-19 07:56:24] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 0 ms to minimize.
[2023-03-19 07:56:24] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2023-03-19 07:56:25] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2023-03-19 07:56:25] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 1 ms to minimize.
[2023-03-19 07:56:25] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2023-03-19 07:56:26] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2023-03-19 07:56:26] [INFO ] Deduced a trap composed of 8 places in 361 ms of which 1 ms to minimize.
[2023-03-19 07:56:27] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 1 ms to minimize.
[2023-03-19 07:56:27] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2023-03-19 07:56:27] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2023-03-19 07:56:28] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 1 ms to minimize.
[2023-03-19 07:56:28] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 1 ms to minimize.
[2023-03-19 07:56:28] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 0 ms to minimize.
[2023-03-19 07:56:29] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2023-03-19 07:56:29] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-19 07:56:30] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 0 ms to minimize.
[2023-03-19 07:56:30] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 26 ms to minimize.
[2023-03-19 07:56:30] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 0 ms to minimize.
[2023-03-19 07:56:31] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-19 07:56:31] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2023-03-19 07:56:31] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-19 07:56:32] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-19 07:56:32] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-19 07:56:32] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-19 07:56:33] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21246 ms
[2023-03-19 07:56:33] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2023-03-19 07:56:33] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 0 ms to minimize.
[2023-03-19 07:56:34] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 0 ms to minimize.
[2023-03-19 07:56:34] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 0 ms to minimize.
[2023-03-19 07:56:34] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2023-03-19 07:56:35] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 0 ms to minimize.
[2023-03-19 07:56:35] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-19 07:56:36] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 1 ms to minimize.
[2023-03-19 07:56:36] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2023-03-19 07:56:36] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2023-03-19 07:56:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3665 ms
[2023-03-19 07:56:37] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2023-03-19 07:56:37] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2023-03-19 07:56:38] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 0 ms to minimize.
[2023-03-19 07:56:38] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 0 ms to minimize.
[2023-03-19 07:56:39] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2023-03-19 07:56:39] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-19 07:56:39] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-19 07:56:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2834 ms
[2023-03-19 07:56:40] [INFO ] After 31049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 588 ms.
[2023-03-19 07:56:40] [INFO ] After 32814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 17 factoid took 1093 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 647 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 07:56:42] [INFO ] Computed 1101 place invariants in 24 ms
[2023-03-19 07:56:45] [INFO ] Implicit Places using invariants in 2720 ms returned []
[2023-03-19 07:56:45] [INFO ] Invariant cache hit.
[2023-03-19 07:56:48] [INFO ] Implicit Places using invariants and state equation in 2639 ms returned []
Implicit Place search using SMT with State Equation took 5384 ms to find 0 implicit places.
[2023-03-19 07:56:48] [INFO ] Invariant cache hit.
[2023-03-19 07:56:53] [INFO ] Dead Transitions using invariants and state equation in 5157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11210 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 917 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 07:56:55] [INFO ] Invariant cache hit.
[2023-03-19 07:56:56] [INFO ] After 1395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 07:56:58] [INFO ] [Nat]Absence check using 1101 positive place invariants in 762 ms returned sat
[2023-03-19 07:57:06] [INFO ] After 6881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 07:57:09] [INFO ] Deduced a trap composed of 20 places in 2806 ms of which 4 ms to minimize.
[2023-03-19 07:57:12] [INFO ] Deduced a trap composed of 24 places in 2918 ms of which 4 ms to minimize.
[2023-03-19 07:57:15] [INFO ] Deduced a trap composed of 22 places in 2841 ms of which 4 ms to minimize.
[2023-03-19 07:57:19] [INFO ] Deduced a trap composed of 23 places in 2935 ms of which 4 ms to minimize.
[2023-03-19 07:57:22] [INFO ] Deduced a trap composed of 14 places in 2932 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:57:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:57:22] [INFO ] After 25482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 1083 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 21 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 7 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5992 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6888 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6889 place count 3105 transition count 2605
Applied a total of 6889 rules in 1433 ms. Remains 3105 /6102 variables (removed 2997) and now considering 2605/5602 (removed 2997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1433 ms. Remains : 3105/6102 places, 2605/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69685 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69685 steps, saw 64361 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-19 07:57:28] [INFO ] Computed 1101 place invariants in 54 ms
[2023-03-19 07:57:29] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:57:29] [INFO ] [Nat]Absence check using 1055 positive place invariants in 264 ms returned sat
[2023-03-19 07:57:29] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-19 07:57:32] [INFO ] After 2498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:57:33] [INFO ] Deduced a trap composed of 6 places in 618 ms of which 1 ms to minimize.
[2023-03-19 07:57:34] [INFO ] Deduced a trap composed of 6 places in 548 ms of which 1 ms to minimize.
[2023-03-19 07:57:34] [INFO ] Deduced a trap composed of 5 places in 524 ms of which 1 ms to minimize.
[2023-03-19 07:57:35] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 1 ms to minimize.
[2023-03-19 07:57:36] [INFO ] Deduced a trap composed of 5 places in 604 ms of which 1 ms to minimize.
[2023-03-19 07:57:36] [INFO ] Deduced a trap composed of 6 places in 487 ms of which 1 ms to minimize.
[2023-03-19 07:57:37] [INFO ] Deduced a trap composed of 6 places in 497 ms of which 1 ms to minimize.
[2023-03-19 07:57:38] [INFO ] Deduced a trap composed of 6 places in 569 ms of which 2 ms to minimize.
[2023-03-19 07:57:38] [INFO ] Deduced a trap composed of 6 places in 494 ms of which 2 ms to minimize.
[2023-03-19 07:57:39] [INFO ] Deduced a trap composed of 5 places in 493 ms of which 1 ms to minimize.
[2023-03-19 07:57:40] [INFO ] Deduced a trap composed of 5 places in 527 ms of which 1 ms to minimize.
[2023-03-19 07:57:40] [INFO ] Deduced a trap composed of 6 places in 462 ms of which 1 ms to minimize.
[2023-03-19 07:57:41] [INFO ] Deduced a trap composed of 5 places in 422 ms of which 1 ms to minimize.
[2023-03-19 07:57:41] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 2 ms to minimize.
[2023-03-19 07:57:43] [INFO ] Deduced a trap composed of 9 places in 1355 ms of which 2 ms to minimize.
[2023-03-19 07:57:43] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 1 ms to minimize.
[2023-03-19 07:57:44] [INFO ] Deduced a trap composed of 5 places in 471 ms of which 2 ms to minimize.
[2023-03-19 07:57:45] [INFO ] Deduced a trap composed of 8 places in 475 ms of which 1 ms to minimize.
[2023-03-19 07:57:45] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2023-03-19 07:57:46] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 1 ms to minimize.
[2023-03-19 07:57:46] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 0 ms to minimize.
[2023-03-19 07:57:47] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 0 ms to minimize.
[2023-03-19 07:57:47] [INFO ] Deduced a trap composed of 5 places in 493 ms of which 0 ms to minimize.
[2023-03-19 07:57:48] [INFO ] Deduced a trap composed of 6 places in 409 ms of which 1 ms to minimize.
[2023-03-19 07:57:48] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 1 ms to minimize.
[2023-03-19 07:57:49] [INFO ] Deduced a trap composed of 8 places in 454 ms of which 1 ms to minimize.
[2023-03-19 07:57:49] [INFO ] Deduced a trap composed of 6 places in 369 ms of which 1 ms to minimize.
[2023-03-19 07:57:50] [INFO ] Deduced a trap composed of 8 places in 465 ms of which 0 ms to minimize.
[2023-03-19 07:57:50] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2023-03-19 07:57:51] [INFO ] Deduced a trap composed of 6 places in 420 ms of which 1 ms to minimize.
[2023-03-19 07:57:52] [INFO ] Deduced a trap composed of 9 places in 406 ms of which 1 ms to minimize.
[2023-03-19 07:57:52] [INFO ] Deduced a trap composed of 6 places in 364 ms of which 1 ms to minimize.
[2023-03-19 07:57:53] [INFO ] Deduced a trap composed of 8 places in 371 ms of which 1 ms to minimize.
[2023-03-19 07:57:53] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 1 ms to minimize.
[2023-03-19 07:57:53] [INFO ] Deduced a trap composed of 6 places in 371 ms of which 1 ms to minimize.
[2023-03-19 07:57:54] [INFO ] Deduced a trap composed of 9 places in 388 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:57:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:57:54] [INFO ] After 25264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 301 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 150 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 147 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-19 07:57:55] [INFO ] Invariant cache hit.
[2023-03-19 07:57:57] [INFO ] Implicit Places using invariants in 2937 ms returned []
[2023-03-19 07:57:57] [INFO ] Invariant cache hit.
[2023-03-19 07:58:04] [INFO ] Implicit Places using invariants and state equation in 6923 ms returned []
Implicit Place search using SMT with State Equation took 9865 ms to find 0 implicit places.
[2023-03-19 07:58:04] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-19 07:58:04] [INFO ] Invariant cache hit.
[2023-03-19 07:58:07] [INFO ] Dead Transitions using invariants and state equation in 2625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12746 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 150 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 07:58:07] [INFO ] Invariant cache hit.
[2023-03-19 07:58:08] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:58:09] [INFO ] [Nat]Absence check using 1055 positive place invariants in 316 ms returned sat
[2023-03-19 07:58:09] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 165 ms returned sat
[2023-03-19 07:58:12] [INFO ] After 2432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:58:12] [INFO ] Deduced a trap composed of 5 places in 634 ms of which 1 ms to minimize.
[2023-03-19 07:58:13] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 1 ms to minimize.
[2023-03-19 07:58:14] [INFO ] Deduced a trap composed of 6 places in 533 ms of which 1 ms to minimize.
[2023-03-19 07:58:14] [INFO ] Deduced a trap composed of 6 places in 491 ms of which 1 ms to minimize.
[2023-03-19 07:58:15] [INFO ] Deduced a trap composed of 5 places in 587 ms of which 2 ms to minimize.
[2023-03-19 07:58:16] [INFO ] Deduced a trap composed of 6 places in 459 ms of which 1 ms to minimize.
[2023-03-19 07:58:16] [INFO ] Deduced a trap composed of 6 places in 539 ms of which 0 ms to minimize.
[2023-03-19 07:58:17] [INFO ] Deduced a trap composed of 6 places in 596 ms of which 2 ms to minimize.
[2023-03-19 07:58:17] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 1 ms to minimize.
[2023-03-19 07:58:18] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 1 ms to minimize.
[2023-03-19 07:58:19] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 1 ms to minimize.
[2023-03-19 07:58:19] [INFO ] Deduced a trap composed of 4 places in 532 ms of which 1 ms to minimize.
[2023-03-19 07:58:20] [INFO ] Deduced a trap composed of 4 places in 673 ms of which 1 ms to minimize.
[2023-03-19 07:58:21] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2023-03-19 07:58:21] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 1 ms to minimize.
[2023-03-19 07:58:22] [INFO ] Deduced a trap composed of 6 places in 369 ms of which 1 ms to minimize.
[2023-03-19 07:58:22] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 1 ms to minimize.
[2023-03-19 07:58:23] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2023-03-19 07:58:23] [INFO ] Deduced a trap composed of 6 places in 442 ms of which 1 ms to minimize.
[2023-03-19 07:58:24] [INFO ] Deduced a trap composed of 6 places in 395 ms of which 0 ms to minimize.
[2023-03-19 07:58:24] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 1 ms to minimize.
[2023-03-19 07:58:24] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2023-03-19 07:58:25] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2023-03-19 07:58:25] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-19 07:58:26] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2023-03-19 07:58:26] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 2 ms to minimize.
[2023-03-19 07:58:27] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-19 07:58:27] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 1 ms to minimize.
[2023-03-19 07:58:27] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-19 07:58:28] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-19 07:58:28] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2023-03-19 07:58:28] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2023-03-19 07:58:29] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 1 ms to minimize.
[2023-03-19 07:58:29] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2023-03-19 07:58:30] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-19 07:58:30] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-19 07:58:30] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-19 07:58:31] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-19 07:58:31] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 0 ms to minimize.
[2023-03-19 07:58:31] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2023-03-19 07:58:32] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-19 07:58:32] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-19 07:58:32] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-19 07:58:33] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2023-03-19 07:58:33] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2023-03-19 07:58:35] [INFO ] Deduced a trap composed of 6 places in 2079 ms of which 1 ms to minimize.
[2023-03-19 07:58:35] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 23726 ms
[2023-03-19 07:58:36] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 1 ms to minimize.
[2023-03-19 07:58:36] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 1 ms to minimize.
[2023-03-19 07:58:37] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2023-03-19 07:58:37] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 0 ms to minimize.
[2023-03-19 07:58:37] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2023-03-19 07:58:38] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 1 ms to minimize.
[2023-03-19 07:58:38] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 0 ms to minimize.
[2023-03-19 07:58:39] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 1 ms to minimize.
[2023-03-19 07:58:39] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 13 ms to minimize.
[2023-03-19 07:58:39] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 0 ms to minimize.
[2023-03-19 07:58:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3896 ms
[2023-03-19 07:58:40] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 0 ms to minimize.
[2023-03-19 07:58:41] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 0 ms to minimize.
[2023-03-19 07:58:41] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 0 ms to minimize.
[2023-03-19 07:58:41] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2023-03-19 07:58:42] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2023-03-19 07:58:42] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-19 07:58:42] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-19 07:58:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2474 ms
[2023-03-19 07:58:42] [INFO ] After 33161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 587 ms.
[2023-03-19 07:58:43] [INFO ] After 35135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 17 factoid took 982 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 1834 ms.
Product exploration explored 100000 steps with 8 reset in 2017 ms.
Built C files in :
/tmp/ltsmin3424988316167004881
[2023-03-19 07:58:49] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3424988316167004881
Running compilation step : cd /tmp/ltsmin3424988316167004881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3424988316167004881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3424988316167004881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 634 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 07:58:52] [INFO ] Computed 1101 place invariants in 43 ms
[2023-03-19 07:58:55] [INFO ] Implicit Places using invariants in 2573 ms returned []
[2023-03-19 07:58:55] [INFO ] Invariant cache hit.
[2023-03-19 07:58:57] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 5105 ms to find 0 implicit places.
[2023-03-19 07:58:57] [INFO ] Invariant cache hit.
[2023-03-19 07:59:03] [INFO ] Dead Transitions using invariants and state equation in 5198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10941 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Built C files in :
/tmp/ltsmin2128120338452745962
[2023-03-19 07:59:03] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2128120338452745962
Running compilation step : cd /tmp/ltsmin2128120338452745962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2128120338452745962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2128120338452745962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 07:59:06] [INFO ] Flatten gal took : 150 ms
[2023-03-19 07:59:06] [INFO ] Flatten gal took : 164 ms
[2023-03-19 07:59:06] [INFO ] Time to serialize gal into /tmp/LTL17569596759108809906.gal : 28 ms
[2023-03-19 07:59:06] [INFO ] Time to serialize properties into /tmp/LTL4638551926055377424.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17569596759108809906.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16689341856196982124.hoa' '-atoms' '/tmp/LTL4638551926055377424.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4638551926055377424.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16689341856196982124.hoa
Detected timeout of ITS tools.
[2023-03-19 07:59:22] [INFO ] Flatten gal took : 142 ms
[2023-03-19 07:59:22] [INFO ] Flatten gal took : 145 ms
[2023-03-19 07:59:22] [INFO ] Time to serialize gal into /tmp/LTL17654842223123495794.gal : 19 ms
[2023-03-19 07:59:22] [INFO ] Time to serialize properties into /tmp/LTL13106039012728762318.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17654842223123495794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13106039012728762318.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p2806==0)||(p2846==0))"))||((X("(p4724==0)"))&&("((p4724==0)||(p2092==0))"))))))
Formula 0 simplified : G(F!"((p2806==0)||(p2846==0))" & FG(!"((p4724==0)||(p2092==0))" | X!"(p4724==0)"))
Detected timeout of ITS tools.
[2023-03-19 07:59:37] [INFO ] Flatten gal took : 127 ms
[2023-03-19 07:59:37] [INFO ] Applying decomposition
[2023-03-19 07:59:37] [INFO ] Flatten gal took : 132 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3917372025282422353.txt' '-o' '/tmp/graph3917372025282422353.bin' '-w' '/tmp/graph3917372025282422353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3917372025282422353.bin' '-l' '-1' '-v' '-w' '/tmp/graph3917372025282422353.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:59:38] [INFO ] Decomposing Gal with order
[2023-03-19 07:59:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:59:39] [INFO ] Removed a total of 900 redundant transitions.
[2023-03-19 07:59:39] [INFO ] Flatten gal took : 236 ms
[2023-03-19 07:59:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2023-03-19 07:59:40] [INFO ] Time to serialize gal into /tmp/LTL7040697976275157131.gal : 61 ms
[2023-03-19 07:59:40] [INFO ] Time to serialize properties into /tmp/LTL13311369427858058957.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7040697976275157131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13311369427858058957.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i26.i1.i2.i0.u1003.p2806==0)||(i26.i1.i2.i1.u1015.p2846==0))"))||((X("(i47.u1678.p4724==0)"))&&("((i47.u1678.p4724==0)||(...181
Formula 0 simplified : G(F!"((i26.i1.i2.i0.u1003.p2806==0)||(i26.i1.i2.i1.u1015.p2846==0))" & FG(!"((i47.u1678.p4724==0)||(i18.u750.p2092==0))" | X!"(i47.u...172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9872130678217309452
[2023-03-19 07:59:55] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9872130678217309452
Running compilation step : cd /tmp/ltsmin9872130678217309452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9872130678217309452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9872130678217309452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100B-LTLFireability-06 finished in 316111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(p1)||X(G(p2)))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1282 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-19 07:59:59] [INFO ] Invariant cache hit.
[2023-03-19 08:00:02] [INFO ] Implicit Places using invariants in 2492 ms returned []
[2023-03-19 08:00:02] [INFO ] Invariant cache hit.
[2023-03-19 08:00:04] [INFO ] Implicit Places using invariants and state equation in 2634 ms returned []
Implicit Place search using SMT with State Equation took 5141 ms to find 0 implicit places.
[2023-03-19 08:00:04] [INFO ] Invariant cache hit.
[2023-03-19 08:00:09] [INFO ] Dead Transitions using invariants and state equation in 5269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11695 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s4375 0), p2:(EQ s2719 1), p0:(EQ s4375 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-07 finished in 12134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(((p1&&F(!p1)) U (!p1&&F(p2)))))))'
Support contains 3 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6103 transition count 5603
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6103 transition count 5603
Applied a total of 2 rules in 1222 ms. Remains 6103 /6104 variables (removed 1) and now considering 5603/5604 (removed 1) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-19 08:00:11] [INFO ] Computed 1101 place invariants in 38 ms
[2023-03-19 08:00:14] [INFO ] Implicit Places using invariants in 3004 ms returned []
[2023-03-19 08:00:14] [INFO ] Invariant cache hit.
[2023-03-19 08:00:17] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 5694 ms to find 0 implicit places.
[2023-03-19 08:00:17] [INFO ] Invariant cache hit.
[2023-03-19 08:00:23] [INFO ] Dead Transitions using invariants and state equation in 6055 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6104 places, 5603/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12983 ms. Remains : 6103/6104 places, 5603/5604 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s6023 1), p1:(NEQ s3669 1), p2:(EQ s4570 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22510 steps with 1 reset in 441 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-08 finished in 13811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6103 transition count 4903
Reduce places removed 700 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 701 rules applied. Total rules applied 1401 place count 5403 transition count 4902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1402 place count 5402 transition count 4902
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1402 place count 5402 transition count 4401
Deduced a syphon composed of 501 places in 23 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2406 place count 4899 transition count 4399
Iterating global reduction 3 with 2 rules applied. Total rules applied 2408 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2408 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2410 place count 4898 transition count 4398
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 6 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 3 with 3586 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5997 place count 3104 transition count 2604
Applied a total of 5997 rules in 1659 ms. Remains 3104 /6104 variables (removed 3000) and now considering 2604/5604 (removed 3000) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 08:00:25] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-19 08:00:28] [INFO ] Implicit Places using invariants in 2315 ms returned []
[2023-03-19 08:00:28] [INFO ] Invariant cache hit.
[2023-03-19 08:00:32] [INFO ] Implicit Places using invariants and state equation in 4735 ms returned []
Implicit Place search using SMT with State Equation took 7053 ms to find 0 implicit places.
[2023-03-19 08:00:32] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-19 08:00:32] [INFO ] Invariant cache hit.
[2023-03-19 08:00:35] [INFO ] Dead Transitions using invariants and state equation in 2152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3104/6104 places, 2604/5604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10930 ms. Remains : 3104/6104 places, 2604/5604 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2465 1) (EQ s2508 1) (EQ s3043 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 96 reset in 1597 ms.
Product exploration explored 100000 steps with 96 reset in 2046 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1204 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2023-03-19 08:00:39] [INFO ] Invariant cache hit.
[2023-03-19 08:00:44] [INFO ] [Real]Absence check using 1101 positive place invariants in 1540 ms returned sat
[2023-03-19 08:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:00:54] [INFO ] [Real]Absence check using state equation in 10107 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 140 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-19 08:00:54] [INFO ] Invariant cache hit.
[2023-03-19 08:00:57] [INFO ] Implicit Places using invariants in 2508 ms returned []
[2023-03-19 08:00:57] [INFO ] Invariant cache hit.
[2023-03-19 08:01:02] [INFO ] Implicit Places using invariants and state equation in 4875 ms returned []
Implicit Place search using SMT with State Equation took 7406 ms to find 0 implicit places.
[2023-03-19 08:01:02] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-19 08:01:02] [INFO ] Invariant cache hit.
[2023-03-19 08:01:04] [INFO ] Dead Transitions using invariants and state equation in 2520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10155 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 937 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=39 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
[2023-03-19 08:01:05] [INFO ] Invariant cache hit.
[2023-03-19 08:01:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 1747 ms returned sat
[2023-03-19 08:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:01:20] [INFO ] [Real]Absence check using state equation in 9789 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 96 reset in 1552 ms.
Product exploration explored 100000 steps with 96 reset in 2005 ms.
Built C files in :
/tmp/ltsmin5373730236723927712
[2023-03-19 08:01:24] [INFO ] Too many transitions (2604) to apply POR reductions. Disabling POR matrices.
[2023-03-19 08:01:24] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5373730236723927712
Running compilation step : cd /tmp/ltsmin5373730236723927712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5373730236723927712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5373730236723927712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 254 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-19 08:01:27] [INFO ] Invariant cache hit.
[2023-03-19 08:01:30] [INFO ] Implicit Places using invariants in 2508 ms returned []
[2023-03-19 08:01:30] [INFO ] Invariant cache hit.
[2023-03-19 08:01:35] [INFO ] Implicit Places using invariants and state equation in 5293 ms returned []
Implicit Place search using SMT with State Equation took 7833 ms to find 0 implicit places.
[2023-03-19 08:01:35] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-19 08:01:35] [INFO ] Invariant cache hit.
[2023-03-19 08:01:38] [INFO ] Dead Transitions using invariants and state equation in 2357 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10559 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin13731342254636028764
[2023-03-19 08:01:38] [INFO ] Too many transitions (2604) to apply POR reductions. Disabling POR matrices.
[2023-03-19 08:01:38] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13731342254636028764
Running compilation step : cd /tmp/ltsmin13731342254636028764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13731342254636028764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13731342254636028764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 08:01:41] [INFO ] Flatten gal took : 138 ms
[2023-03-19 08:01:41] [INFO ] Flatten gal took : 140 ms
[2023-03-19 08:01:41] [INFO ] Time to serialize gal into /tmp/LTL2109118944888941348.gal : 14 ms
[2023-03-19 08:01:41] [INFO ] Time to serialize properties into /tmp/LTL10185406861532438882.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2109118944888941348.gal' '-t' 'CGAL' '-hoa' '/tmp/aut857228802359509996.hoa' '-atoms' '/tmp/LTL10185406861532438882.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10185406861532438882.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut857228802359509996.hoa
Detected timeout of ITS tools.
[2023-03-19 08:01:56] [INFO ] Flatten gal took : 133 ms
[2023-03-19 08:01:57] [INFO ] Flatten gal took : 148 ms
[2023-03-19 08:01:57] [INFO ] Time to serialize gal into /tmp/LTL6530084496806343834.gal : 57 ms
[2023-03-19 08:01:57] [INFO ] Time to serialize properties into /tmp/LTL15297834400517713289.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6530084496806343834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15297834400517713289.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p5421==1)&&(p5511==1))&&(p6669==0))"))))
Formula 0 simplified : FG!"(((p5421==1)&&(p5511==1))&&(p6669==0))"
Detected timeout of ITS tools.
[2023-03-19 08:02:12] [INFO ] Flatten gal took : 187 ms
[2023-03-19 08:02:12] [INFO ] Applying decomposition
[2023-03-19 08:02:12] [INFO ] Flatten gal took : 125 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3439397305672875122.txt' '-o' '/tmp/graph3439397305672875122.bin' '-w' '/tmp/graph3439397305672875122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3439397305672875122.bin' '-l' '-1' '-v' '-w' '/tmp/graph3439397305672875122.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:02:12] [INFO ] Decomposing Gal with order
[2023-03-19 08:02:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:02:13] [INFO ] Removed a total of 600 redundant transitions.
[2023-03-19 08:02:13] [INFO ] Flatten gal took : 192 ms
[2023-03-19 08:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 140 ms.
[2023-03-19 08:02:13] [INFO ] Time to serialize gal into /tmp/LTL4141254976053177778.gal : 42 ms
[2023-03-19 08:02:13] [INFO ] Time to serialize properties into /tmp/LTL17478042091966053880.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4141254976053177778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17478042091966053880.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i42.u875.p5421==1)&&(i43.i0.i2.u890.p5511==1))&&(i53.i0.i0.u1087.p6669==0))"))))
Formula 0 simplified : FG!"(((i42.u875.p5421==1)&&(i43.i0.i2.u890.p5511==1))&&(i53.i0.i0.u1087.p6669==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17672381038400279197
[2023-03-19 08:02:28] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17672381038400279197
Running compilation step : cd /tmp/ltsmin17672381038400279197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17672381038400279197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17672381038400279197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100B-LTLFireability-10 finished in 127545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(X(X(X(X(X(X(F(p1))))))))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1368 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 08:02:33] [INFO ] Computed 1101 place invariants in 46 ms
[2023-03-19 08:02:35] [INFO ] Implicit Places using invariants in 2676 ms returned []
[2023-03-19 08:02:35] [INFO ] Invariant cache hit.
[2023-03-19 08:02:38] [INFO ] Implicit Places using invariants and state equation in 2714 ms returned []
Implicit Place search using SMT with State Equation took 5392 ms to find 0 implicit places.
[2023-03-19 08:02:38] [INFO ] Invariant cache hit.
[2023-03-19 08:02:43] [INFO ] Dead Transitions using invariants and state equation in 5195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11958 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 704 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 11}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 11}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 11}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 11}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 11}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 11}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 11}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 11}], [{ cond=p0, acceptance={} source=8 dest: 7}, { cond=(NOT p0), acceptance={} source=8 dest: 11}], [{ cond=p0, acceptance={} source=9 dest: 8}, { cond=(NOT p0), acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={} source=10 dest: 9}], [{ cond=true, acceptance={0} source=11 dest: 11}]], initial=10, aps=[p0:(AND (EQ s668 1) (EQ s748 1)), p1:(OR (EQ s1318 0) (EQ s1320 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-11 finished in 12746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(G((F(p2)&&p1)))))))'
Support contains 5 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1333 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:48] [INFO ] Implicit Places using invariants in 2673 ms returned []
[2023-03-19 08:02:48] [INFO ] Invariant cache hit.
[2023-03-19 08:02:51] [INFO ] Implicit Places using invariants and state equation in 2720 ms returned []
Implicit Place search using SMT with State Equation took 5410 ms to find 0 implicit places.
[2023-03-19 08:02:51] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] Dead Transitions using invariants and state equation in 5152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11909 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s77 0), p1:(AND (EQ s791 1) (EQ s819 1)), p2:(AND (EQ s1508 1) (EQ s1588 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 43799 steps with 10 reset in 693 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-13 finished in 13029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U p1)))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1301 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-19 08:02:58] [INFO ] Invariant cache hit.
[2023-03-19 08:03:01] [INFO ] Implicit Places using invariants in 2794 ms returned []
[2023-03-19 08:03:01] [INFO ] Invariant cache hit.
[2023-03-19 08:03:04] [INFO ] Implicit Places using invariants and state equation in 3229 ms returned []
Implicit Place search using SMT with State Equation took 6055 ms to find 0 implicit places.
[2023-03-19 08:03:04] [INFO ] Invariant cache hit.
[2023-03-19 08:03:09] [INFO ] Dead Transitions using invariants and state equation in 4892 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12263 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (NEQ s712 1) (EQ s1891 1)), p0:(NEQ s1891 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1047 ms.
Product exploration explored 100000 steps with 25000 reset in 930 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 157435 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157435 steps, saw 155090 distinct states, run finished after 3004 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 08:03:15] [INFO ] Invariant cache hit.
[2023-03-19 08:03:17] [INFO ] [Real]Absence check using 1101 positive place invariants in 732 ms returned sat
[2023-03-19 08:03:17] [INFO ] After 1662ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 08:03:19] [INFO ] [Nat]Absence check using 1101 positive place invariants in 713 ms returned sat
[2023-03-19 08:03:24] [INFO ] After 5077ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 08:03:27] [INFO ] Deduced a trap composed of 22 places in 3236 ms of which 4 ms to minimize.
[2023-03-19 08:03:31] [INFO ] Deduced a trap composed of 20 places in 3202 ms of which 6 ms to minimize.
[2023-03-19 08:03:34] [INFO ] Deduced a trap composed of 30 places in 2961 ms of which 4 ms to minimize.
[2023-03-19 08:03:37] [INFO ] Deduced a trap composed of 35 places in 2614 ms of which 3 ms to minimize.
[2023-03-19 08:03:40] [INFO ] Deduced a trap composed of 16 places in 3026 ms of which 4 ms to minimize.
[2023-03-19 08:03:43] [INFO ] Deduced a trap composed of 25 places in 3075 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 08:03:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 08:03:43] [INFO ] After 26152ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6102 transition count 4900
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5400 transition count 4900
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5400 transition count 4400
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 8 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6000 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6896 place count 3102 transition count 2602
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6897 place count 3101 transition count 2601
Applied a total of 6897 rules in 1462 ms. Remains 3101 /6102 variables (removed 3001) and now considering 2601/5602 (removed 3001) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1462 ms. Remains : 3101/6102 places, 2601/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 105355 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105355 steps, saw 99027 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-19 08:03:48] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-19 08:03:49] [INFO ] [Real]Absence check using 1052 positive place invariants in 335 ms returned sat
[2023-03-19 08:03:49] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 34 ms returned sat
[2023-03-19 08:03:49] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:03:50] [INFO ] [Nat]Absence check using 1052 positive place invariants in 338 ms returned sat
[2023-03-19 08:03:50] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 13 ms returned sat
[2023-03-19 08:03:52] [INFO ] After 2089ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:03:53] [INFO ] Deduced a trap composed of 6 places in 382 ms of which 1 ms to minimize.
[2023-03-19 08:03:53] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2023-03-19 08:03:54] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 1 ms to minimize.
[2023-03-19 08:03:54] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2023-03-19 08:03:55] [INFO ] Deduced a trap composed of 14 places in 352 ms of which 1 ms to minimize.
[2023-03-19 08:03:55] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2023-03-19 08:03:55] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2023-03-19 08:03:56] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 0 ms to minimize.
[2023-03-19 08:03:57] [INFO ] Deduced a trap composed of 4 places in 566 ms of which 1 ms to minimize.
[2023-03-19 08:03:57] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2023-03-19 08:03:58] [INFO ] Deduced a trap composed of 5 places in 530 ms of which 0 ms to minimize.
[2023-03-19 08:03:58] [INFO ] Deduced a trap composed of 6 places in 417 ms of which 1 ms to minimize.
[2023-03-19 08:03:59] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-19 08:03:59] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
[2023-03-19 08:04:00] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2023-03-19 08:04:00] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2023-03-19 08:04:01] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 0 ms to minimize.
[2023-03-19 08:04:01] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-19 08:04:01] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 0 ms to minimize.
[2023-03-19 08:04:02] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2023-03-19 08:04:02] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2023-03-19 08:04:02] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-19 08:04:03] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 0 ms to minimize.
[2023-03-19 08:04:03] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2023-03-19 08:04:03] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2023-03-19 08:04:04] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2023-03-19 08:04:04] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2023-03-19 08:04:04] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-19 08:04:05] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2023-03-19 08:04:05] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-19 08:04:05] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2023-03-19 08:04:05] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-19 08:04:06] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2023-03-19 08:04:06] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2023-03-19 08:04:06] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2023-03-19 08:04:06] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-19 08:04:07] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-19 08:04:07] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2023-03-19 08:04:07] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 15079 ms
[2023-03-19 08:04:07] [INFO ] After 17291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-19 08:04:07] [INFO ] After 18271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 198 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 141 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 141 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-19 08:04:08] [INFO ] Invariant cache hit.
[2023-03-19 08:04:10] [INFO ] Implicit Places using invariants in 2156 ms returned []
[2023-03-19 08:04:10] [INFO ] Invariant cache hit.
[2023-03-19 08:04:13] [INFO ] Implicit Places using invariants and state equation in 2740 ms returned []
Implicit Place search using SMT with State Equation took 4908 ms to find 0 implicit places.
[2023-03-19 08:04:13] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-19 08:04:13] [INFO ] Invariant cache hit.
[2023-03-19 08:04:15] [INFO ] Dead Transitions using invariants and state equation in 2200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7322 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 141 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 08:04:15] [INFO ] Invariant cache hit.
[2023-03-19 08:04:16] [INFO ] [Real]Absence check using 1052 positive place invariants in 318 ms returned sat
[2023-03-19 08:04:16] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 14 ms returned sat
[2023-03-19 08:04:16] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:04:16] [INFO ] [Nat]Absence check using 1052 positive place invariants in 289 ms returned sat
[2023-03-19 08:04:17] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 36 ms returned sat
[2023-03-19 08:04:18] [INFO ] After 1853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:04:19] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 1 ms to minimize.
[2023-03-19 08:04:19] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2023-03-19 08:04:20] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-19 08:04:20] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 0 ms to minimize.
[2023-03-19 08:04:20] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-19 08:04:21] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-19 08:04:21] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-19 08:04:21] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 0 ms to minimize.
[2023-03-19 08:04:22] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 0 ms to minimize.
[2023-03-19 08:04:22] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 1 ms to minimize.
[2023-03-19 08:04:22] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2023-03-19 08:04:23] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2023-03-19 08:04:23] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-19 08:04:23] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2023-03-19 08:04:23] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2023-03-19 08:04:24] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-19 08:04:24] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2023-03-19 08:04:24] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2023-03-19 08:04:24] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6010 ms
[2023-03-19 08:04:25] [INFO ] After 7956ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-19 08:04:25] [INFO ] After 8797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 671 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 08:04:26] [INFO ] Computed 1101 place invariants in 43 ms
[2023-03-19 08:04:29] [INFO ] Implicit Places using invariants in 2759 ms returned []
[2023-03-19 08:04:29] [INFO ] Invariant cache hit.
[2023-03-19 08:04:31] [INFO ] Implicit Places using invariants and state equation in 2472 ms returned []
Implicit Place search using SMT with State Equation took 5233 ms to find 0 implicit places.
[2023-03-19 08:04:31] [INFO ] Invariant cache hit.
[2023-03-19 08:04:36] [INFO ] Dead Transitions using invariants and state equation in 4350 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10268 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 216948 steps, run timeout after 3087 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 216948 steps, saw 211714 distinct states, run finished after 3087 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 08:04:39] [INFO ] Invariant cache hit.
[2023-03-19 08:04:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 913 ms returned sat
[2023-03-19 08:04:46] [INFO ] After 6531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:04:47] [INFO ] [Nat]Absence check using 1101 positive place invariants in 856 ms returned sat
[2023-03-19 08:04:52] [INFO ] After 4883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:04:55] [INFO ] Deduced a trap composed of 27 places in 2883 ms of which 4 ms to minimize.
[2023-03-19 08:04:59] [INFO ] Deduced a trap composed of 20 places in 3285 ms of which 4 ms to minimize.
[2023-03-19 08:05:02] [INFO ] Deduced a trap composed of 25 places in 2932 ms of which 3 ms to minimize.
[2023-03-19 08:05:05] [INFO ] Deduced a trap composed of 21 places in 3195 ms of which 3 ms to minimize.
[2023-03-19 08:05:09] [INFO ] Deduced a trap composed of 14 places in 2883 ms of which 3 ms to minimize.
[2023-03-19 08:05:12] [INFO ] Deduced a trap composed of 24 places in 2770 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 08:05:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 08:05:12] [INFO ] After 25679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 112 ms.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6102 transition count 4900
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5400 transition count 4900
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5400 transition count 4400
Deduced a syphon composed of 500 places in 26 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 8 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6000 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6896 place count 3102 transition count 2602
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6897 place count 3101 transition count 2601
Applied a total of 6897 rules in 1459 ms. Remains 3101 /6102 variables (removed 3001) and now considering 2601/5602 (removed 3001) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1459 ms. Remains : 3101/6102 places, 2601/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102461 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102461 steps, saw 96248 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-19 08:05:17] [INFO ] Computed 1101 place invariants in 54 ms
[2023-03-19 08:05:17] [INFO ] [Real]Absence check using 1052 positive place invariants in 232 ms returned sat
[2023-03-19 08:05:17] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 29 ms returned sat
[2023-03-19 08:05:17] [INFO ] After 830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:05:18] [INFO ] [Nat]Absence check using 1052 positive place invariants in 242 ms returned sat
[2023-03-19 08:05:18] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 44 ms returned sat
[2023-03-19 08:05:20] [INFO ] After 2229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:05:21] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 2 ms to minimize.
[2023-03-19 08:05:21] [INFO ] Deduced a trap composed of 6 places in 385 ms of which 1 ms to minimize.
[2023-03-19 08:05:22] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 1 ms to minimize.
[2023-03-19 08:05:22] [INFO ] Deduced a trap composed of 6 places in 389 ms of which 1 ms to minimize.
[2023-03-19 08:05:23] [INFO ] Deduced a trap composed of 6 places in 805 ms of which 2 ms to minimize.
[2023-03-19 08:05:24] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 1 ms to minimize.
[2023-03-19 08:05:24] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 0 ms to minimize.
[2023-03-19 08:05:25] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 0 ms to minimize.
[2023-03-19 08:05:25] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 1 ms to minimize.
[2023-03-19 08:05:26] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 1 ms to minimize.
[2023-03-19 08:05:26] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-19 08:05:26] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2023-03-19 08:05:27] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 0 ms to minimize.
[2023-03-19 08:05:27] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 1 ms to minimize.
[2023-03-19 08:05:27] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 1 ms to minimize.
[2023-03-19 08:05:28] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-19 08:05:28] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2023-03-19 08:05:29] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 0 ms to minimize.
[2023-03-19 08:05:29] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2023-03-19 08:05:30] [INFO ] Deduced a trap composed of 5 places in 423 ms of which 1 ms to minimize.
[2023-03-19 08:05:30] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-19 08:05:30] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-19 08:05:31] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 0 ms to minimize.
[2023-03-19 08:05:31] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-19 08:05:31] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2023-03-19 08:05:32] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-19 08:05:32] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-19 08:05:32] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 0 ms to minimize.
[2023-03-19 08:05:32] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2023-03-19 08:05:33] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 1 ms to minimize.
[2023-03-19 08:05:33] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-19 08:05:33] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-19 08:05:34] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-19 08:05:34] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2023-03-19 08:05:34] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-19 08:05:34] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2023-03-19 08:05:35] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-19 08:05:35] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-19 08:05:35] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 1 ms to minimize.
[2023-03-19 08:05:36] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2023-03-19 08:05:36] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2023-03-19 08:05:36] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2023-03-19 08:05:36] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-19 08:05:37] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-19 08:05:37] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-03-19 08:05:37] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 16799 ms
[2023-03-19 08:05:37] [INFO ] After 19092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-19 08:05:37] [INFO ] After 19897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 329 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 157 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 171 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-19 08:05:38] [INFO ] Invariant cache hit.
[2023-03-19 08:05:41] [INFO ] Implicit Places using invariants in 2803 ms returned []
[2023-03-19 08:05:41] [INFO ] Invariant cache hit.
[2023-03-19 08:05:47] [INFO ] Implicit Places using invariants and state equation in 6454 ms returned []
Implicit Place search using SMT with State Equation took 9281 ms to find 0 implicit places.
[2023-03-19 08:05:47] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-19 08:05:47] [INFO ] Invariant cache hit.
[2023-03-19 08:05:49] [INFO ] Dead Transitions using invariants and state equation in 2157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11729 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 144 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 08:05:50] [INFO ] Invariant cache hit.
[2023-03-19 08:05:50] [INFO ] [Real]Absence check using 1052 positive place invariants in 277 ms returned sat
[2023-03-19 08:05:50] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 13 ms returned sat
[2023-03-19 08:05:52] [INFO ] After 2576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:05:53] [INFO ] [Nat]Absence check using 1052 positive place invariants in 285 ms returned sat
[2023-03-19 08:05:53] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 13 ms returned sat
[2023-03-19 08:05:55] [INFO ] After 2010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:05:55] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-19 08:05:56] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2023-03-19 08:05:56] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2023-03-19 08:05:56] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2023-03-19 08:05:57] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-19 08:05:57] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2023-03-19 08:05:57] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-19 08:05:57] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-19 08:05:58] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2023-03-19 08:05:58] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 0 ms to minimize.
[2023-03-19 08:05:58] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-19 08:05:58] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2023-03-19 08:05:59] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2023-03-19 08:05:59] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2023-03-19 08:05:59] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2023-03-19 08:06:00] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-19 08:06:00] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-19 08:06:00] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-19 08:06:00] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2023-03-19 08:06:01] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2023-03-19 08:06:01] [INFO ] Deduced a trap composed of 6 places in 367 ms of which 0 ms to minimize.
[2023-03-19 08:06:02] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-19 08:06:02] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6723 ms
[2023-03-19 08:06:02] [INFO ] After 8801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-19 08:06:02] [INFO ] After 9749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1020 ms.
Product exploration explored 100000 steps with 25000 reset in 1030 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 5602
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 701 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 24 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2098 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3000 places in 10 ms
Iterating global reduction 1 with 2098 rules applied. Total rules applied 3000 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 3702 place count 5400 transition count 4901
Deduced a syphon composed of 2298 places in 10 ms
Iterating global reduction 1 with 702 rules applied. Total rules applied 4404 place count 5400 transition count 4901
Deduced a syphon composed of 2298 places in 13 ms
Applied a total of 4404 rules in 5563 ms. Remains 5400 /6102 variables (removed 702) and now considering 4901/5602 (removed 701) transitions.
[2023-03-19 08:06:11] [INFO ] Redundant transitions in 246 ms returned []
// Phase 1: matrix 4901 rows 5400 cols
[2023-03-19 08:06:11] [INFO ] Computed 1101 place invariants in 156 ms
[2023-03-19 08:06:18] [INFO ] Dead Transitions using invariants and state equation in 7486 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5400/6102 places, 4901/5602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13324 ms. Remains : 5400/6102 places, 4901/5602 transitions.
Built C files in :
/tmp/ltsmin4180375829699414020
[2023-03-19 08:06:18] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4180375829699414020
Running compilation step : cd /tmp/ltsmin4180375829699414020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4180375829699414020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4180375829699414020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 830 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 08:06:22] [INFO ] Computed 1101 place invariants in 42 ms
[2023-03-19 08:06:26] [INFO ] Implicit Places using invariants in 3257 ms returned []
[2023-03-19 08:06:26] [INFO ] Invariant cache hit.
[2023-03-19 08:06:28] [INFO ] Implicit Places using invariants and state equation in 2857 ms returned []
Implicit Place search using SMT with State Equation took 6123 ms to find 0 implicit places.
[2023-03-19 08:06:28] [INFO ] Invariant cache hit.
[2023-03-19 08:06:33] [INFO ] Dead Transitions using invariants and state equation in 4964 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11931 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Built C files in :
/tmp/ltsmin3023446985952414496
[2023-03-19 08:06:33] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3023446985952414496
Running compilation step : cd /tmp/ltsmin3023446985952414496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3023446985952414496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3023446985952414496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 08:06:37] [INFO ] Flatten gal took : 154 ms
[2023-03-19 08:06:37] [INFO ] Flatten gal took : 125 ms
[2023-03-19 08:06:37] [INFO ] Time to serialize gal into /tmp/LTL4464350706753002284.gal : 17 ms
[2023-03-19 08:06:37] [INFO ] Time to serialize properties into /tmp/LTL905239250599406003.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4464350706753002284.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4233480958541205777.hoa' '-atoms' '/tmp/LTL905239250599406003.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL905239250599406003.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4233480958541205777.hoa
Detected timeout of ITS tools.
[2023-03-19 08:06:52] [INFO ] Flatten gal took : 148 ms
[2023-03-19 08:06:52] [INFO ] Flatten gal took : 130 ms
[2023-03-19 08:06:52] [INFO ] Time to serialize gal into /tmp/LTL996733509418613189.gal : 18 ms
[2023-03-19 08:06:52] [INFO ] Time to serialize properties into /tmp/LTL2651061458707110860.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL996733509418613189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2651061458707110860.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(p2098!=1)")U("((p782!=1)||(p2098==1))"))))))
Formula 0 simplified : XXX(!"(p2098!=1)" R !"((p782!=1)||(p2098==1))")
Detected timeout of ITS tools.
[2023-03-19 08:07:08] [INFO ] Flatten gal took : 172 ms
[2023-03-19 08:07:08] [INFO ] Applying decomposition
[2023-03-19 08:07:08] [INFO ] Flatten gal took : 126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15433801547291048036.txt' '-o' '/tmp/graph15433801547291048036.bin' '-w' '/tmp/graph15433801547291048036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15433801547291048036.bin' '-l' '-1' '-v' '-w' '/tmp/graph15433801547291048036.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:07:08] [INFO ] Decomposing Gal with order
[2023-03-19 08:07:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:07:10] [INFO ] Removed a total of 900 redundant transitions.
[2023-03-19 08:07:10] [INFO ] Flatten gal took : 248 ms
[2023-03-19 08:07:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2023-03-19 08:07:10] [INFO ] Time to serialize gal into /tmp/LTL1191114979070924995.gal : 84 ms
[2023-03-19 08:07:10] [INFO ] Time to serialize properties into /tmp/LTL17857772215238105305.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1191114979070924995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17857772215238105305.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(i17.i1.i3.i1.u746.p2098!=1)")U("((i5.u284.p782!=1)||(i17.i1.i3.i1.u746.p2098==1))"))))))
Formula 0 simplified : XXX(!"(i17.i1.i3.i1.u746.p2098!=1)" R !"((i5.u284.p782!=1)||(i17.i1.i3.i1.u746.p2098==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6450560138828601157
[2023-03-19 08:07:25] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6450560138828601157
Running compilation step : cd /tmp/ltsmin6450560138828601157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6450560138828601157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6450560138828601157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100B-LTLFireability-15 finished in 271323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&X(F(p0))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-03
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6103 transition count 4903
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5403 transition count 4903
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5403 transition count 4403
Deduced a syphon composed of 500 places in 29 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4903 transition count 4403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2402 place count 4901 transition count 4401
Iterating global reduction 2 with 2 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2404 place count 4901 transition count 4400
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 4900 transition count 4400
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 8 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5994 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5996 place count 3104 transition count 2604
Applied a total of 5996 rules in 1887 ms. Remains 3104 /6104 variables (removed 3000) and now considering 2604/5604 (removed 3000) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 08:07:31] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-19 08:07:33] [INFO ] Implicit Places using invariants in 2522 ms returned []
[2023-03-19 08:07:33] [INFO ] Invariant cache hit.
[2023-03-19 08:07:39] [INFO ] Implicit Places using invariants and state equation in 5687 ms returned []
Implicit Place search using SMT with State Equation took 8228 ms to find 0 implicit places.
[2023-03-19 08:07:39] [INFO ] Invariant cache hit.
[2023-03-19 08:07:41] [INFO ] Dead Transitions using invariants and state equation in 2187 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3104/6104 places, 2604/5604 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12303 ms. Remains : 3104/6104 places, 2604/5604 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1000 0) (EQ s1022 0)), p1:(OR (EQ s1310 0) (EQ s1328 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 52 reset in 1885 ms.
Product exploration explored 100000 steps with 46 reset in 2138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 625 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 61564 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61564 steps, saw 55679 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 08:07:50] [INFO ] Invariant cache hit.
[2023-03-19 08:07:50] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:07:51] [INFO ] [Nat]Absence check using 1101 positive place invariants in 299 ms returned sat
[2023-03-19 08:07:53] [INFO ] After 2023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:07:54] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2023-03-19 08:07:54] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 1 ms to minimize.
[2023-03-19 08:07:54] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2023-03-19 08:07:54] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2023-03-19 08:07:55] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 0 ms to minimize.
[2023-03-19 08:07:55] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2023-03-19 08:07:55] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-03-19 08:07:55] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-19 08:07:56] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2023-03-19 08:07:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2415 ms
[2023-03-19 08:07:57] [INFO ] After 5318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 533 ms.
[2023-03-19 08:07:57] [INFO ] After 6925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 281 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3104 transition count 2604
Applied a total of 598 rules in 301 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 74134 steps, run timeout after 3006 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74134 steps, saw 73119 distinct states, run finished after 3006 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 08:08:02] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-19 08:08:02] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:08:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 254 ms returned sat
[2023-03-19 08:08:06] [INFO ] After 2049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:08:06] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-19 08:08:06] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2023-03-19 08:08:06] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2023-03-19 08:08:07] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2023-03-19 08:08:07] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2023-03-19 08:08:07] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-19 08:08:07] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-03-19 08:08:07] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-19 08:08:08] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-19 08:08:08] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-19 08:08:08] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2023-03-19 08:08:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2563 ms
[2023-03-19 08:08:09] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-19 08:08:09] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2023-03-19 08:08:09] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2023-03-19 08:08:09] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2023-03-19 08:08:10] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 0 ms to minimize.
[2023-03-19 08:08:10] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2023-03-19 08:08:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1611 ms
[2023-03-19 08:08:10] [INFO ] After 6908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 588 ms.
[2023-03-19 08:08:11] [INFO ] After 8616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 293 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 158 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 206 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-19 08:08:12] [INFO ] Invariant cache hit.
[2023-03-19 08:08:15] [INFO ] Implicit Places using invariants in 2903 ms returned []
[2023-03-19 08:08:15] [INFO ] Invariant cache hit.
[2023-03-19 08:08:21] [INFO ] Implicit Places using invariants and state equation in 6632 ms returned []
Implicit Place search using SMT with State Equation took 9540 ms to find 0 implicit places.
[2023-03-19 08:08:21] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-19 08:08:21] [INFO ] Invariant cache hit.
[2023-03-19 08:08:24] [INFO ] Dead Transitions using invariants and state equation in 2272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12155 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 154 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 08:08:24] [INFO ] Invariant cache hit.
[2023-03-19 08:08:24] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:08:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 426 ms returned sat
[2023-03-19 08:08:28] [INFO ] After 2575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:08:29] [INFO ] Deduced a trap composed of 17 places in 455 ms of which 1 ms to minimize.
[2023-03-19 08:08:29] [INFO ] Deduced a trap composed of 19 places in 549 ms of which 1 ms to minimize.
[2023-03-19 08:08:30] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2023-03-19 08:08:30] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-19 08:08:30] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 1 ms to minimize.
[2023-03-19 08:08:31] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 0 ms to minimize.
[2023-03-19 08:08:31] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2023-03-19 08:08:31] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-19 08:08:31] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2023-03-19 08:08:32] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 0 ms to minimize.
[2023-03-19 08:08:32] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 0 ms to minimize.
[2023-03-19 08:08:32] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 0 ms to minimize.
[2023-03-19 08:08:33] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 0 ms to minimize.
[2023-03-19 08:08:33] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 0 ms to minimize.
[2023-03-19 08:08:33] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 0 ms to minimize.
[2023-03-19 08:08:33] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2023-03-19 08:08:34] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2023-03-19 08:08:34] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 1 ms to minimize.
[2023-03-19 08:08:34] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5961 ms
[2023-03-19 08:08:35] [INFO ] After 9175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 546 ms.
[2023-03-19 08:08:35] [INFO ] After 10955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 340 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 245 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 08:08:36] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-19 08:08:39] [INFO ] Implicit Places using invariants in 2397 ms returned []
[2023-03-19 08:08:39] [INFO ] Invariant cache hit.
[2023-03-19 08:08:44] [INFO ] Implicit Places using invariants and state equation in 5315 ms returned []
Implicit Place search using SMT with State Equation took 7734 ms to find 0 implicit places.
[2023-03-19 08:08:44] [INFO ] Invariant cache hit.
[2023-03-19 08:08:50] [INFO ] Dead Transitions using invariants and state equation in 5817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13811 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 470 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 55805 steps, run timeout after 3002 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55805 steps, saw 50423 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 08:08:55] [INFO ] Invariant cache hit.
[2023-03-19 08:08:55] [INFO ] After 624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:08:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 257 ms returned sat
[2023-03-19 08:08:58] [INFO ] After 2019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:08:59] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2023-03-19 08:08:59] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 1 ms to minimize.
[2023-03-19 08:08:59] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-19 08:09:00] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2023-03-19 08:09:00] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2023-03-19 08:09:00] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2023-03-19 08:09:00] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-19 08:09:01] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2023-03-19 08:09:01] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-19 08:09:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2620 ms
[2023-03-19 08:09:02] [INFO ] After 5557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 556 ms.
[2023-03-19 08:09:02] [INFO ] After 7166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 237 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3104 transition count 2604
Applied a total of 598 rules in 333 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 73280 steps, run timeout after 3003 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73280 steps, saw 72270 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 08:09:07] [INFO ] Computed 1101 place invariants in 41 ms
[2023-03-19 08:09:07] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:09:08] [INFO ] [Nat]Absence check using 1101 positive place invariants in 296 ms returned sat
[2023-03-19 08:09:11] [INFO ] After 2086ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:09:11] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2023-03-19 08:09:11] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 0 ms to minimize.
[2023-03-19 08:09:12] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 0 ms to minimize.
[2023-03-19 08:09:12] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2023-03-19 08:09:12] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 1 ms to minimize.
[2023-03-19 08:09:13] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
[2023-03-19 08:09:13] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2023-03-19 08:09:13] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-19 08:09:13] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-19 08:09:14] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2023-03-19 08:09:14] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2023-03-19 08:09:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3138 ms
[2023-03-19 08:09:15] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2023-03-19 08:09:15] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2023-03-19 08:09:15] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 0 ms to minimize.
[2023-03-19 08:09:15] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2023-03-19 08:09:15] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2023-03-19 08:09:16] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 0 ms to minimize.
[2023-03-19 08:09:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1635 ms
[2023-03-19 08:09:16] [INFO ] After 7475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 511 ms.
[2023-03-19 08:09:17] [INFO ] After 9190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 363 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 132 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 129 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-19 08:09:17] [INFO ] Invariant cache hit.
[2023-03-19 08:09:20] [INFO ] Implicit Places using invariants in 2939 ms returned []
[2023-03-19 08:09:20] [INFO ] Invariant cache hit.
[2023-03-19 08:09:26] [INFO ] Implicit Places using invariants and state equation in 5439 ms returned []
Implicit Place search using SMT with State Equation took 8388 ms to find 0 implicit places.
[2023-03-19 08:09:26] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-19 08:09:26] [INFO ] Invariant cache hit.
[2023-03-19 08:09:28] [INFO ] Dead Transitions using invariants and state equation in 2068 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10670 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 154 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 08:09:28] [INFO ] Invariant cache hit.
[2023-03-19 08:09:29] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:09:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 297 ms returned sat
[2023-03-19 08:09:32] [INFO ] After 2033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:09:32] [INFO ] Deduced a trap composed of 17 places in 322 ms of which 0 ms to minimize.
[2023-03-19 08:09:32] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2023-03-19 08:09:33] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-19 08:09:33] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2023-03-19 08:09:33] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 1 ms to minimize.
[2023-03-19 08:09:34] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2023-03-19 08:09:34] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 0 ms to minimize.
[2023-03-19 08:09:34] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 1 ms to minimize.
[2023-03-19 08:09:34] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2023-03-19 08:09:35] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2023-03-19 08:09:35] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 0 ms to minimize.
[2023-03-19 08:09:35] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 0 ms to minimize.
[2023-03-19 08:09:36] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 0 ms to minimize.
[2023-03-19 08:09:36] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2023-03-19 08:09:36] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-19 08:09:36] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 0 ms to minimize.
[2023-03-19 08:09:37] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-19 08:09:37] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2023-03-19 08:09:37] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5415 ms
[2023-03-19 08:09:38] [INFO ] After 8191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 560 ms.
[2023-03-19 08:09:38] [INFO ] After 9752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 478 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 48 reset in 1937 ms.
Product exploration explored 100000 steps with 50 reset in 2416 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 183 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-19 08:09:45] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 08:09:45] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-19 08:09:47] [INFO ] Dead Transitions using invariants and state equation in 2131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2413 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin14839798616251308598
[2023-03-19 08:09:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14839798616251308598
Running compilation step : cd /tmp/ltsmin14839798616251308598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14839798616251308598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14839798616251308598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 196 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-19 08:09:50] [INFO ] Invariant cache hit.
[2023-03-19 08:09:52] [INFO ] Implicit Places using invariants in 2150 ms returned []
[2023-03-19 08:09:52] [INFO ] Invariant cache hit.
[2023-03-19 08:09:57] [INFO ] Implicit Places using invariants and state equation in 4890 ms returned []
Implicit Place search using SMT with State Equation took 7043 ms to find 0 implicit places.
[2023-03-19 08:09:57] [INFO ] Invariant cache hit.
[2023-03-19 08:09:59] [INFO ] Dead Transitions using invariants and state equation in 2109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9364 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin16175108424743806104
[2023-03-19 08:09:59] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16175108424743806104
Running compilation step : cd /tmp/ltsmin16175108424743806104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16175108424743806104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16175108424743806104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 08:10:03] [INFO ] Flatten gal took : 70 ms
[2023-03-19 08:10:03] [INFO ] Flatten gal took : 72 ms
[2023-03-19 08:10:03] [INFO ] Time to serialize gal into /tmp/LTL12322678259503365562.gal : 10 ms
[2023-03-19 08:10:03] [INFO ] Time to serialize properties into /tmp/LTL1253500226454170158.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12322678259503365562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7961347721471162854.hoa' '-atoms' '/tmp/LTL1253500226454170158.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1253500226454170158.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7961347721471162854.hoa
Detected timeout of ITS tools.
[2023-03-19 08:10:18] [INFO ] Flatten gal took : 80 ms
[2023-03-19 08:10:18] [INFO ] Flatten gal took : 74 ms
[2023-03-19 08:10:18] [INFO ] Time to serialize gal into /tmp/LTL2806979914933439487.gal : 10 ms
[2023-03-19 08:10:18] [INFO ] Time to serialize properties into /tmp/LTL9021361505289949630.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2806979914933439487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9021361505289949630.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((p2931==0)||(p2956==0))"))&&(X(F("((p2263==0)||(p2300==0))"))))&&("((p2263==0)||(p2300==0))")))))
Formula 0 simplified : XG(!"((p2263==0)||(p2300==0))" | F!"((p2931==0)||(p2956==0))" | XG!"((p2263==0)||(p2300==0))")
Detected timeout of ITS tools.
[2023-03-19 08:10:33] [INFO ] Flatten gal took : 91 ms
[2023-03-19 08:10:33] [INFO ] Applying decomposition
[2023-03-19 08:10:33] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2791756390039350149.txt' '-o' '/tmp/graph2791756390039350149.bin' '-w' '/tmp/graph2791756390039350149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2791756390039350149.bin' '-l' '-1' '-v' '-w' '/tmp/graph2791756390039350149.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:10:33] [INFO ] Decomposing Gal with order
[2023-03-19 08:10:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:10:34] [INFO ] Removed a total of 605 redundant transitions.
[2023-03-19 08:10:34] [INFO ] Flatten gal took : 120 ms
[2023-03-19 08:10:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1194 labels/synchronizations in 29 ms.
[2023-03-19 08:10:34] [INFO ] Time to serialize gal into /tmp/LTL11347370283333184190.gal : 22 ms
[2023-03-19 08:10:34] [INFO ] Time to serialize properties into /tmp/LTL16391471723716752966.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11347370283333184190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16391471723716752966.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((i24.u467.p2931==0)||(i24.u472.p2956==0))"))&&(X(F("((i19.i0.i1.u356.p2263==0)||(i19.i0.i4.u364.p2300==0))"))))&&("((i19....209
Formula 0 simplified : XG(!"((i19.i0.i1.u356.p2263==0)||(i19.i0.i4.u364.p2300==0))" | F!"((i24.u467.p2931==0)||(i24.u472.p2956==0))" | XG!"((i19.i0.i1.u356...195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3722415682711751559
[2023-03-19 08:10:49] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3722415682711751559
Running compilation step : cd /tmp/ltsmin3722415682711751559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3722415682711751559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3722415682711751559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100B-LTLFireability-03 finished in 203768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p2))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-06
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5402 transition count 4902
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5402 transition count 4403
Deduced a syphon composed of 499 places in 24 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4903 transition count 4403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2402 place count 4901 transition count 4401
Iterating global reduction 2 with 2 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2404 place count 4901 transition count 4400
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 4900 transition count 4400
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 7 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5992 place count 3107 transition count 2607
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Applied a total of 5994 rules in 1723 ms. Remains 3105 /6104 variables (removed 2999) and now considering 2605/5604 (removed 2999) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-19 08:10:54] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-19 08:10:56] [INFO ] Implicit Places using invariants in 1813 ms returned []
[2023-03-19 08:10:56] [INFO ] Invariant cache hit.
[2023-03-19 08:11:01] [INFO ] Implicit Places using invariants and state equation in 5299 ms returned []
Implicit Place search using SMT with State Equation took 7138 ms to find 0 implicit places.
[2023-03-19 08:11:01] [INFO ] Invariant cache hit.
[2023-03-19 08:11:03] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3105/6104 places, 2605/5604 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10787 ms. Remains : 3105/6104 places, 2605/5604 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1255 0) (EQ s1275 0)), p1:(OR (EQ s2145 0) (EQ s925 0)), p2:(EQ s2145 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1839 ms.
Product exploration explored 100000 steps with 18 reset in 2265 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 821 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 08:11:09] [INFO ] Invariant cache hit.
[2023-03-19 08:11:10] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:11:11] [INFO ] [Nat]Absence check using 1101 positive place invariants in 427 ms returned sat
[2023-03-19 08:11:13] [INFO ] After 1866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:11:13] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2023-03-19 08:11:14] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 0 ms to minimize.
[2023-03-19 08:11:14] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-19 08:11:14] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 0 ms to minimize.
[2023-03-19 08:11:14] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-03-19 08:11:15] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-03-19 08:11:15] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2023-03-19 08:11:15] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2023-03-19 08:11:15] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2023-03-19 08:11:16] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2023-03-19 08:11:16] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-19 08:11:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3142 ms
[2023-03-19 08:11:17] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2023-03-19 08:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2023-03-19 08:11:17] [INFO ] After 6051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 538 ms.
[2023-03-19 08:11:18] [INFO ] After 7910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 312 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3105 transition count 2605
Applied a total of 600 rules in 280 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 79717 steps, run timeout after 3009 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79717 steps, saw 78393 distinct states, run finished after 3010 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-19 08:11:22] [INFO ] Computed 1101 place invariants in 25 ms
[2023-03-19 08:11:23] [INFO ] After 424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:11:24] [INFO ] [Nat]Absence check using 1101 positive place invariants in 534 ms returned sat
[2023-03-19 08:11:26] [INFO ] After 2078ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:11:26] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 1 ms to minimize.
[2023-03-19 08:11:27] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 0 ms to minimize.
[2023-03-19 08:11:27] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 0 ms to minimize.
[2023-03-19 08:11:27] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2023-03-19 08:11:28] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 0 ms to minimize.
[2023-03-19 08:11:28] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2023-03-19 08:11:28] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2023-03-19 08:11:29] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 0 ms to minimize.
[2023-03-19 08:11:29] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2023-03-19 08:11:29] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-19 08:11:29] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 0 ms to minimize.
[2023-03-19 08:11:30] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-03-19 08:11:30] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 0 ms to minimize.
[2023-03-19 08:11:30] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-19 08:11:30] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4413 ms
[2023-03-19 08:11:31] [INFO ] After 7438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 626 ms.
[2023-03-19 08:11:32] [INFO ] After 9379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 251 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 195 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 147 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-19 08:11:33] [INFO ] Invariant cache hit.
[2023-03-19 08:11:36] [INFO ] Implicit Places using invariants in 3060 ms returned []
[2023-03-19 08:11:36] [INFO ] Invariant cache hit.
[2023-03-19 08:11:41] [INFO ] Implicit Places using invariants and state equation in 5801 ms returned []
Implicit Place search using SMT with State Equation took 8866 ms to find 0 implicit places.
[2023-03-19 08:11:41] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-19 08:11:41] [INFO ] Invariant cache hit.
[2023-03-19 08:11:44] [INFO ] Dead Transitions using invariants and state equation in 2221 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11314 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 149 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 08:11:44] [INFO ] Invariant cache hit.
[2023-03-19 08:11:45] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:11:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 253 ms returned sat
[2023-03-19 08:11:48] [INFO ] After 1946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:11:48] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 1 ms to minimize.
[2023-03-19 08:11:48] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-19 08:11:49] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 1 ms to minimize.
[2023-03-19 08:11:49] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2023-03-19 08:11:49] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 0 ms to minimize.
[2023-03-19 08:11:50] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 1 ms to minimize.
[2023-03-19 08:11:50] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 1 ms to minimize.
[2023-03-19 08:11:50] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2023-03-19 08:11:51] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 1 ms to minimize.
[2023-03-19 08:11:51] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 0 ms to minimize.
[2023-03-19 08:11:52] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2023-03-19 08:11:52] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 0 ms to minimize.
[2023-03-19 08:11:52] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2023-03-19 08:11:53] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-19 08:11:53] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2023-03-19 08:11:53] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 0 ms to minimize.
[2023-03-19 08:11:54] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2023-03-19 08:11:54] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 0 ms to minimize.
[2023-03-19 08:11:55] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2023-03-19 08:11:55] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 7071 ms
[2023-03-19 08:11:55] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-19 08:11:56] [INFO ] Deduced a trap composed of 17 places in 420 ms of which 0 ms to minimize.
[2023-03-19 08:11:56] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2023-03-19 08:11:56] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-19 08:11:56] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-19 08:11:57] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-19 08:11:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1912 ms
[2023-03-19 08:11:57] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 1 ms to minimize.
[2023-03-19 08:11:58] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 3 ms to minimize.
[2023-03-19 08:11:58] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2023-03-19 08:11:58] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-19 08:11:58] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-19 08:11:59] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-19 08:11:59] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-19 08:11:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2034 ms
[2023-03-19 08:11:59] [INFO ] After 13584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 579 ms.
[2023-03-19 08:12:00] [INFO ] After 15225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 1216 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 176 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-19 08:12:02] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-19 08:12:04] [INFO ] Implicit Places using invariants in 2497 ms returned []
[2023-03-19 08:12:04] [INFO ] Invariant cache hit.
[2023-03-19 08:12:09] [INFO ] Implicit Places using invariants and state equation in 4768 ms returned []
Implicit Place search using SMT with State Equation took 7270 ms to find 0 implicit places.
[2023-03-19 08:12:09] [INFO ] Invariant cache hit.
[2023-03-19 08:12:11] [INFO ] Dead Transitions using invariants and state equation in 2134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9582 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 903 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 08:12:13] [INFO ] Invariant cache hit.
[2023-03-19 08:12:14] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:12:15] [INFO ] [Nat]Absence check using 1101 positive place invariants in 277 ms returned sat
[2023-03-19 08:12:17] [INFO ] After 1918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:12:17] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2023-03-19 08:12:18] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 0 ms to minimize.
[2023-03-19 08:12:18] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-19 08:12:18] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2023-03-19 08:12:18] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2023-03-19 08:12:19] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-19 08:12:19] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2023-03-19 08:12:19] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-19 08:12:19] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2023-03-19 08:12:19] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2023-03-19 08:12:20] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-19 08:12:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2712 ms
[2023-03-19 08:12:20] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2023-03-19 08:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2023-03-19 08:12:21] [INFO ] After 5858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 639 ms.
[2023-03-19 08:12:22] [INFO ] After 7599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 321 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3105 transition count 2605
Applied a total of 600 rules in 333 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 72411 steps, run timeout after 3004 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72411 steps, saw 71130 distinct states, run finished after 3004 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-19 08:12:26] [INFO ] Computed 1101 place invariants in 55 ms
[2023-03-19 08:12:27] [INFO ] After 622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:12:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 293 ms returned sat
[2023-03-19 08:12:30] [INFO ] After 1952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:12:30] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
[2023-03-19 08:12:31] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2023-03-19 08:12:31] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 1 ms to minimize.
[2023-03-19 08:12:31] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-19 08:12:32] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 1 ms to minimize.
[2023-03-19 08:12:32] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 0 ms to minimize.
[2023-03-19 08:12:32] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 0 ms to minimize.
[2023-03-19 08:12:33] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 1 ms to minimize.
[2023-03-19 08:12:33] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-19 08:12:33] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-19 08:12:33] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 0 ms to minimize.
[2023-03-19 08:12:34] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2023-03-19 08:12:34] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 1 ms to minimize.
[2023-03-19 08:12:34] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2023-03-19 08:12:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4639 ms
[2023-03-19 08:12:35] [INFO ] After 7456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 581 ms.
[2023-03-19 08:12:36] [INFO ] After 9165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 297 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 131 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 131 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-19 08:12:37] [INFO ] Invariant cache hit.
[2023-03-19 08:12:39] [INFO ] Implicit Places using invariants in 2621 ms returned []
[2023-03-19 08:12:39] [INFO ] Invariant cache hit.
[2023-03-19 08:12:45] [INFO ] Implicit Places using invariants and state equation in 5819 ms returned []
Implicit Place search using SMT with State Equation took 8462 ms to find 0 implicit places.
[2023-03-19 08:12:45] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-19 08:12:45] [INFO ] Invariant cache hit.
[2023-03-19 08:12:47] [INFO ] Dead Transitions using invariants and state equation in 2117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10803 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 144 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 08:12:47] [INFO ] Invariant cache hit.
[2023-03-19 08:12:48] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 08:12:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 243 ms returned sat
[2023-03-19 08:12:51] [INFO ] After 1924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 08:12:51] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 1 ms to minimize.
[2023-03-19 08:12:52] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2023-03-19 08:12:52] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 0 ms to minimize.
[2023-03-19 08:12:52] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 0 ms to minimize.
[2023-03-19 08:12:53] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2023-03-19 08:12:53] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 1 ms to minimize.
[2023-03-19 08:12:53] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 0 ms to minimize.
[2023-03-19 08:12:54] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-19 08:12:54] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 0 ms to minimize.
[2023-03-19 08:12:54] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 0 ms to minimize.
[2023-03-19 08:12:55] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 0 ms to minimize.
[2023-03-19 08:12:55] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 0 ms to minimize.
[2023-03-19 08:12:55] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 0 ms to minimize.
[2023-03-19 08:12:55] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-19 08:12:56] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2023-03-19 08:12:56] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-19 08:12:56] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 1 ms to minimize.
[2023-03-19 08:12:57] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-19 08:12:57] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-19 08:12:57] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6287 ms
[2023-03-19 08:12:57] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-19 08:12:58] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 0 ms to minimize.
[2023-03-19 08:12:58] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2023-03-19 08:12:58] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2023-03-19 08:12:58] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2023-03-19 08:12:59] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-19 08:12:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1514 ms
[2023-03-19 08:12:59] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 0 ms to minimize.
[2023-03-19 08:12:59] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2023-03-19 08:13:00] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2023-03-19 08:13:00] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-19 08:13:00] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2023-03-19 08:13:01] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2023-03-19 08:13:01] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-03-19 08:13:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2128 ms
[2023-03-19 08:13:01] [INFO ] After 12531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 609 ms.
[2023-03-19 08:13:02] [INFO ] After 14099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 2350 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 19 reset in 1973 ms.
Product exploration explored 100000 steps with 22 reset in 2350 ms.
Built C files in :
/tmp/ltsmin10521285794658942486
[2023-03-19 08:13:09] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10521285794658942486
Running compilation step : cd /tmp/ltsmin10521285794658942486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10521285794658942486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10521285794658942486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 149 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-19 08:13:13] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-19 08:13:15] [INFO ] Implicit Places using invariants in 2567 ms returned []
[2023-03-19 08:13:15] [INFO ] Invariant cache hit.
[2023-03-19 08:13:20] [INFO ] Implicit Places using invariants and state equation in 4725 ms returned []
Implicit Place search using SMT with State Equation took 7297 ms to find 0 implicit places.
[2023-03-19 08:13:20] [INFO ] Invariant cache hit.
[2023-03-19 08:13:22] [INFO ] Dead Transitions using invariants and state equation in 1785 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9237 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Built C files in :
/tmp/ltsmin2516800239864730902
[2023-03-19 08:13:22] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2516800239864730902
Running compilation step : cd /tmp/ltsmin2516800239864730902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2516800239864730902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2516800239864730902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 08:13:25] [INFO ] Flatten gal took : 71 ms
[2023-03-19 08:13:25] [INFO ] Flatten gal took : 72 ms
[2023-03-19 08:13:25] [INFO ] Time to serialize gal into /tmp/LTL11766089126856785379.gal : 9 ms
[2023-03-19 08:13:25] [INFO ] Time to serialize properties into /tmp/LTL16712996730518324995.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11766089126856785379.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13430896658710773491.hoa' '-atoms' '/tmp/LTL16712996730518324995.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16712996730518324995.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13430896658710773491.hoa
Detected timeout of ITS tools.
[2023-03-19 08:13:40] [INFO ] Flatten gal took : 147 ms
[2023-03-19 08:13:40] [INFO ] Flatten gal took : 88 ms
[2023-03-19 08:13:40] [INFO ] Time to serialize gal into /tmp/LTL8879179615289644889.gal : 9 ms
[2023-03-19 08:13:40] [INFO ] Time to serialize properties into /tmp/LTL17987506260069096392.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8879179615289644889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17987506260069096392.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p2806==0)||(p2846==0))"))||((X("(p4724==0)"))&&("((p4724==0)||(p2092==0))"))))))
Formula 0 simplified : G(F!"((p2806==0)||(p2846==0))" & FG(!"((p4724==0)||(p2092==0))" | X!"(p4724==0)"))
Detected timeout of ITS tools.
[2023-03-19 08:13:56] [INFO ] Flatten gal took : 69 ms
[2023-03-19 08:13:56] [INFO ] Applying decomposition
[2023-03-19 08:13:56] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4158758303852803380.txt' '-o' '/tmp/graph4158758303852803380.bin' '-w' '/tmp/graph4158758303852803380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4158758303852803380.bin' '-l' '-1' '-v' '-w' '/tmp/graph4158758303852803380.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:13:56] [INFO ] Decomposing Gal with order
[2023-03-19 08:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:13:56] [INFO ] Removed a total of 603 redundant transitions.
[2023-03-19 08:13:56] [INFO ] Flatten gal took : 140 ms
[2023-03-19 08:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1192 labels/synchronizations in 22 ms.
[2023-03-19 08:13:56] [INFO ] Time to serialize gal into /tmp/LTL6026662101476816447.gal : 25 ms
[2023-03-19 08:13:56] [INFO ] Time to serialize properties into /tmp/LTL2948640518825529775.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6026662101476816447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2948640518825529775.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i22.u447.p2806==0)||(i22.u453.p2846==0))"))||((X("(i37.i0.i0.u762.p4724==0)"))&&("((i37.i0.i0.u762.p4724==0)||(i15.i1.i2....177
Formula 0 simplified : G(F!"((i22.u447.p2806==0)||(i22.u453.p2846==0))" & FG(!"((i37.i0.i0.u762.p4724==0)||(i15.i1.i2.u329.p2092==0))" | X!"(i37.i0.i0.u762...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11236493762583825054
[2023-03-19 08:14:12] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11236493762583825054
Running compilation step : cd /tmp/ltsmin11236493762583825054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11236493762583825054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11236493762583825054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100B-LTLFireability-06 finished in 202437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U p1)))))'
[2023-03-19 08:14:15] [INFO ] Flatten gal took : 136 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11255666232963150362
[2023-03-19 08:14:15] [INFO ] Too many transitions (5604) to apply POR reductions. Disabling POR matrices.
[2023-03-19 08:14:15] [INFO ] Applying decomposition
[2023-03-19 08:14:15] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11255666232963150362
Running compilation step : cd /tmp/ltsmin11255666232963150362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 08:14:15] [INFO ] Flatten gal took : 136 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13170674149719987889.txt' '-o' '/tmp/graph13170674149719987889.bin' '-w' '/tmp/graph13170674149719987889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13170674149719987889.bin' '-l' '-1' '-v' '-w' '/tmp/graph13170674149719987889.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:14:16] [INFO ] Decomposing Gal with order
[2023-03-19 08:14:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:14:17] [INFO ] Removed a total of 900 redundant transitions.
[2023-03-19 08:14:17] [INFO ] Flatten gal took : 298 ms
[2023-03-19 08:14:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-19 08:14:18] [INFO ] Time to serialize gal into /tmp/LTLFireability9805919607563982918.gal : 38 ms
[2023-03-19 08:14:18] [INFO ] Time to serialize properties into /tmp/LTLFireability1288240420474962246.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9805919607563982918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1288240420474962246.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((X(F((("((i24.u808.p2263==0)||(i24.u821.p2300==0))")&&(G("((i30.u1046.p2931==0)||(i30.u1056.p2956==0))")))&&(X(F("((i24.u808.p2263==...187
Formula 0 simplified : XG(!"((i24.u808.p2263==0)||(i24.u821.p2300==0))" | F!"((i30.u1046.p2931==0)||(i30.u1056.p2956==0))" | XG!"((i24.u808.p2263==0)||(i24...173
Compilation finished in 20807 ms.
Running link step : cd /tmp/ltsmin11255666232963150362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 132 ms.
Running LTSmin : cd /tmp/ltsmin11255666232963150362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true))&&X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11255666232963150362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true))&&X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11255666232963150362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 08:43:40] [INFO ] Applying decomposition
[2023-03-19 08:43:40] [INFO ] Flatten gal took : 328 ms
[2023-03-19 08:43:40] [INFO ] Decomposing Gal with order
[2023-03-19 08:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:43:46] [INFO ] Removed a total of 600 redundant transitions.
[2023-03-19 08:43:46] [INFO ] Flatten gal took : 398 ms
[2023-03-19 08:43:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 118 ms.
[2023-03-19 08:43:48] [INFO ] Time to serialize gal into /tmp/LTLFireability8234877210595751669.gal : 116 ms
[2023-03-19 08:43:48] [INFO ] Time to serialize properties into /tmp/LTLFireability14838603085877479968.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8234877210595751669.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14838603085877479968.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((X(F((("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1404
Formula 0 simplified : XG(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1390
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11255666232963150362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11255666232963150362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 12962468 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16028036 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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