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.r133-smll-167819411100476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DoubleExponent-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411100476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678486917674

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=DoubleExponent-PT-010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 22:22:01] [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-10 22:22:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:22:01] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-10 22:22:01] [INFO ] Transformed 534 places.
[2023-03-10 22:22:01] [INFO ] Transformed 498 transitions.
[2023-03-10 22:22:01] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-010-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 498
Applied a total of 4 rules in 93 ms. Remains 530 /534 variables (removed 4) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 530 cols
[2023-03-10 22:22:02] [INFO ] Computed 51 place invariants in 147 ms
[2023-03-10 22:22:03] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2023-03-10 22:22:03] [INFO ] Invariant cache hit.
[2023-03-10 22:22:06] [INFO ] Implicit Places using invariants and state equation in 3484 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4846 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 527 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 527 transition count 497
Applied a total of 2 rules in 143 ms. Remains 527 /528 variables (removed 1) and now considering 497/498 (removed 1) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-10 22:22:06] [INFO ] Computed 49 place invariants in 52 ms
[2023-03-10 22:22:07] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-10 22:22:07] [INFO ] Invariant cache hit.
[2023-03-10 22:22:10] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 3934 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 527/534 places, 497/498 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9018 ms. Remains : 527/534 places, 497/498 transitions.
Support contains 33 out of 527 places after structural reductions.
[2023-03-10 22:22:11] [INFO ] Flatten gal took : 136 ms
[2023-03-10 22:22:11] [INFO ] Flatten gal took : 71 ms
[2023-03-10 22:22:11] [INFO ] Input system was already deterministic with 497 transitions.
Incomplete random walk after 10000 steps, including 333 resets, run finished after 1153 ms. (steps per millisecond=8 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 114800 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{6=1, 11=1, 14=1, 17=1}
Probabilistic random walk after 114800 steps, saw 57413 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :4
Running SMT prover for 16 properties.
[2023-03-10 22:22:16] [INFO ] Invariant cache hit.
[2023-03-10 22:22:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:22:16] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 31 ms returned sat
[2023-03-10 22:22:17] [INFO ] After 975ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:14
[2023-03-10 22:22:17] [INFO ] After 1175ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-10 22:22:17] [INFO ] After 1673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-10 22:22:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:22:18] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 44 ms returned sat
[2023-03-10 22:22:19] [INFO ] After 1179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-10 22:22:20] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 8 ms to minimize.
[2023-03-10 22:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-10 22:22:21] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 1 ms to minimize.
[2023-03-10 22:22:21] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 1 ms to minimize.
[2023-03-10 22:22:21] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 3 ms to minimize.
[2023-03-10 22:22:22] [INFO ] Deduced a trap composed of 77 places in 588 ms of which 3 ms to minimize.
[2023-03-10 22:22:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1371 ms
[2023-03-10 22:22:22] [INFO ] Deduced a trap composed of 61 places in 235 ms of which 1 ms to minimize.
[2023-03-10 22:22:22] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 1 ms to minimize.
[2023-03-10 22:22:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 644 ms
[2023-03-10 22:22:24] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 2 ms to minimize.
[2023-03-10 22:22:24] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 0 ms to minimize.
[2023-03-10 22:22:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2023-03-10 22:22:24] [INFO ] After 5692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1434 ms.
[2023-03-10 22:22:25] [INFO ] After 7789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 10211 ms.
Support contains 25 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 525 transition count 403
Reduce places removed 92 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 103 rules applied. Total rules applied 197 place count 433 transition count 392
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 422 transition count 392
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 208 place count 422 transition count 366
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 260 place count 396 transition count 366
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 408 place count 322 transition count 292
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 440 place count 306 transition count 292
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 442 place count 306 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 444 place count 304 transition count 290
Free-agglomeration rule (complex) applied 49 times.
Iterating global reduction 4 with 49 rules applied. Total rules applied 493 place count 304 transition count 241
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 4 with 49 rules applied. Total rules applied 542 place count 255 transition count 241
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 579 place count 255 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 580 place count 254 transition count 240
Applied a total of 580 rules in 175 ms. Remains 254 /527 variables (removed 273) and now considering 240/497 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 254/527 places, 240/497 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 138967 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{0=1, 11=1}
Probabilistic random walk after 138967 steps, saw 69961 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :2
Running SMT prover for 14 properties.
// Phase 1: matrix 240 rows 254 cols
[2023-03-10 22:22:40] [INFO ] Computed 49 place invariants in 25 ms
[2023-03-10 22:22:40] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-10 22:22:40] [INFO ] [Real]Absence check using 6 positive and 43 generalized place invariants in 40 ms returned sat
[2023-03-10 22:22:40] [INFO ] After 308ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:13
[2023-03-10 22:22:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-10 22:22:40] [INFO ] After 234ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :1 real:13
[2023-03-10 22:22:40] [INFO ] After 261ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:13
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-10 22:22:40] [INFO ] After 824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-10 22:22:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-10 22:22:41] [INFO ] [Nat]Absence check using 6 positive and 43 generalized place invariants in 25 ms returned sat
[2023-03-10 22:22:41] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-10 22:22:42] [INFO ] After 496ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-10 22:22:42] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-10 22:22:42] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-10 22:22:42] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2023-03-10 22:22:42] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2023-03-10 22:22:42] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2023-03-10 22:22:42] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2023-03-10 22:22:43] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2023-03-10 22:22:43] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2023-03-10 22:22:43] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2023-03-10 22:22:43] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2023-03-10 22:22:43] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2023-03-10 22:22:43] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2023-03-10 22:22:43] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2023-03-10 22:22:43] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 0 ms to minimize.
[2023-03-10 22:22:44] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2023-03-10 22:22:44] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2023-03-10 22:22:44] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-10 22:22:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2040 ms
[2023-03-10 22:22:44] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-03-10 22:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-10 22:22:44] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2023-03-10 22:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-10 22:22:44] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-10 22:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-10 22:22:45] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2023-03-10 22:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-10 22:22:45] [INFO ] After 3759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 713 ms.
[2023-03-10 22:22:46] [INFO ] After 5229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 9749 ms.
Support contains 23 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 240/240 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 252 transition count 238
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 252 transition count 238
Applied a total of 5 rules in 50 ms. Remains 252 /254 variables (removed 2) and now considering 238/240 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 252/254 places, 238/240 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 889 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 437020 steps, run timeout after 9001 ms. (steps per millisecond=48 ) properties seen :{1=1, 2=1, 11=1}
Probabilistic random walk after 437020 steps, saw 219249 distinct states, run finished after 9001 ms. (steps per millisecond=48 ) properties seen :3
Running SMT prover for 11 properties.
// Phase 1: matrix 238 rows 252 cols
[2023-03-10 22:23:08] [INFO ] Computed 49 place invariants in 13 ms
[2023-03-10 22:23:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:23:08] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-10 22:23:08] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 22:23:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:23:08] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 29 ms returned sat
[2023-03-10 22:23:09] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-10 22:23:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-10 22:23:09] [INFO ] After 512ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-10 22:23:09] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2023-03-10 22:23:09] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-03-10 22:23:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2023-03-10 22:23:10] [INFO ] After 1549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 417 ms.
[2023-03-10 22:23:11] [INFO ] After 2654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 14446 ms.
Support contains 19 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 252 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 251 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 249 transition count 235
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 249 transition count 235
Applied a total of 7 rules in 37 ms. Remains 249 /252 variables (removed 3) and now considering 235/238 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 249/252 places, 235/238 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 308409 steps, run timeout after 6001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 308409 steps, saw 154942 distinct states, run finished after 6002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 235 rows 249 cols
[2023-03-10 22:23:34] [INFO ] Computed 49 place invariants in 18 ms
[2023-03-10 22:23:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:23:34] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-10 22:23:34] [INFO ] After 244ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-10 22:23:34] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-10 22:23:34] [INFO ] After 265ms SMT Verify possible using 28 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 22:23:34] [INFO ] After 685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 22:23:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:23:34] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 27 ms returned sat
[2023-03-10 22:23:35] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-10 22:23:35] [INFO ] After 494ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-10 22:23:36] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2023-03-10 22:23:36] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2023-03-10 22:23:36] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2023-03-10 22:23:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2023-03-10 22:23:36] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 1 ms to minimize.
[2023-03-10 22:23:36] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 1 ms to minimize.
[2023-03-10 22:23:37] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 0 ms to minimize.
[2023-03-10 22:23:37] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 0 ms to minimize.
[2023-03-10 22:23:37] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 0 ms to minimize.
[2023-03-10 22:23:37] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 1 ms to minimize.
[2023-03-10 22:23:37] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 0 ms to minimize.
[2023-03-10 22:23:37] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2023-03-10 22:23:38] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-10 22:23:38] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 1 ms to minimize.
[2023-03-10 22:23:38] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-10 22:23:38] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 1 ms to minimize.
[2023-03-10 22:23:38] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 1 ms to minimize.
[2023-03-10 22:23:38] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 1 ms to minimize.
[2023-03-10 22:23:39] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 1 ms to minimize.
[2023-03-10 22:23:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2452 ms
[2023-03-10 22:23:39] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 0 ms to minimize.
[2023-03-10 22:23:39] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 0 ms to minimize.
[2023-03-10 22:23:39] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 1 ms to minimize.
[2023-03-10 22:23:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2023-03-10 22:23:39] [INFO ] After 4225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 478 ms.
[2023-03-10 22:23:40] [INFO ] After 5301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 12386 ms.
Support contains 19 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 235/235 transitions.
Applied a total of 0 rules in 12 ms. Remains 249 /249 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 249/249 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 235/235 transitions.
Applied a total of 0 rules in 9 ms. Remains 249 /249 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2023-03-10 22:23:52] [INFO ] Invariant cache hit.
[2023-03-10 22:23:53] [INFO ] Implicit Places using invariants in 617 ms returned [21, 27, 49, 57, 80, 86, 107, 114, 136, 142, 143, 165, 171, 193, 199, 206, 240, 246]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 619 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/249 places, 235/235 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 231 transition count 229
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 229
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 225 transition count 229
Applied a total of 13 rules in 39 ms. Remains 225 /231 variables (removed 6) and now considering 229/235 (removed 6) transitions.
// Phase 1: matrix 229 rows 225 cols
[2023-03-10 22:23:53] [INFO ] Computed 31 place invariants in 27 ms
[2023-03-10 22:23:53] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-10 22:23:53] [INFO ] Invariant cache hit.
[2023-03-10 22:23:53] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-10 22:23:56] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 2824 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 225/249 places, 229/235 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3491 ms. Remains : 225/249 places, 229/235 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 245 place count 403 transition count 353
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 98 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-10 22:23:56] [INFO ] Computed 49 place invariants in 9 ms
[2023-03-10 22:23:56] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-10 22:23:56] [INFO ] Invariant cache hit.
[2023-03-10 22:23:56] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:23:58] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
[2023-03-10 22:23:58] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-10 22:23:58] [INFO ] Invariant cache hit.
[2023-03-10 22:23:58] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2591 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-00 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:(GEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-00 finished in 2981 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 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 245 place count 403 transition count 354
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 503 place count 274 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 273 transition count 260
Applied a total of 504 rules in 86 ms. Remains 273 /527 variables (removed 254) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 273 cols
[2023-03-10 22:23:59] [INFO ] Computed 49 place invariants in 14 ms
[2023-03-10 22:23:59] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-10 22:23:59] [INFO ] Invariant cache hit.
[2023-03-10 22:23:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:24:01] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2023-03-10 22:24:01] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 22:24:01] [INFO ] Invariant cache hit.
[2023-03-10 22:24:01] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2438 ms. Remains : 273/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9775 reset in 342 ms.
Product exploration explored 100000 steps with 9722 reset in 442 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-10 22:24:02] [INFO ] Invariant cache hit.
[2023-03-10 22:24:03] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-10 22:24:03] [INFO ] Invariant cache hit.
[2023-03-10 22:24:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:24:04] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
[2023-03-10 22:24:04] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 22:24:04] [INFO ] Invariant cache hit.
[2023-03-10 22:24:04] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1862 ms. Remains : 273/273 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9679 reset in 234 ms.
Product exploration explored 100000 steps with 9754 reset in 214 ms.
Built C files in :
/tmp/ltsmin9962143356306036668
[2023-03-10 22:24:05] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2023-03-10 22:24:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:24:05] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2023-03-10 22:24:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:24:05] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2023-03-10 22:24:05] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:24:05] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9962143356306036668
Running compilation step : cd /tmp/ltsmin9962143356306036668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1328 ms.
Running link step : cd /tmp/ltsmin9962143356306036668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9962143356306036668;'/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' '--hoa' '/tmp/stateBased10012193215057772552.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-10 22:24:20] [INFO ] Invariant cache hit.
[2023-03-10 22:24:21] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-10 22:24:21] [INFO ] Invariant cache hit.
[2023-03-10 22:24:21] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:24:22] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
[2023-03-10 22:24:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 22:24:22] [INFO ] Invariant cache hit.
[2023-03-10 22:24:23] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2261 ms. Remains : 273/273 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin10514091738596529767
[2023-03-10 22:24:23] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2023-03-10 22:24:23] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:24:23] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2023-03-10 22:24:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:24:23] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2023-03-10 22:24:23] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:24:23] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10514091738596529767
Running compilation step : cd /tmp/ltsmin10514091738596529767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 865 ms.
Running link step : cd /tmp/ltsmin10514091738596529767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10514091738596529767;'/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' '--hoa' '/tmp/stateBased9257823724659631952.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 22:24:38] [INFO ] Flatten gal took : 29 ms
[2023-03-10 22:24:38] [INFO ] Flatten gal took : 25 ms
[2023-03-10 22:24:38] [INFO ] Time to serialize gal into /tmp/LTL12132454606493443169.gal : 17 ms
[2023-03-10 22:24:38] [INFO ] Time to serialize properties into /tmp/LTL18008431870437829153.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/LTL12132454606493443169.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1358803323983543805.hoa' '-atoms' '/tmp/LTL18008431870437829153.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/LTL18008431870437829153.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1358803323983543805.hoa
Detected timeout of ITS tools.
[2023-03-10 22:24:53] [INFO ] Flatten gal took : 21 ms
[2023-03-10 22:24:53] [INFO ] Flatten gal took : 27 ms
[2023-03-10 22:24:53] [INFO ] Time to serialize gal into /tmp/LTL671796150733284530.gal : 4 ms
[2023-03-10 22:24:53] [INFO ] Time to serialize properties into /tmp/LTL3855381200067923690.ltl : 10 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/LTL671796150733284530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3855381200067923690.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 : !((F(G("(p27<1)"))))
Formula 0 simplified : GF!"(p27<1)"
Detected timeout of ITS tools.
[2023-03-10 22:25:08] [INFO ] Flatten gal took : 18 ms
[2023-03-10 22:25:08] [INFO ] Applying decomposition
[2023-03-10 22:25:08] [INFO ] Flatten gal took : 33 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/graph6611585840810761370.txt' '-o' '/tmp/graph6611585840810761370.bin' '-w' '/tmp/graph6611585840810761370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6611585840810761370.bin' '-l' '-1' '-v' '-w' '/tmp/graph6611585840810761370.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:25:08] [INFO ] Decomposing Gal with order
[2023-03-10 22:25:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:25:08] [INFO ] Removed a total of 193 redundant transitions.
[2023-03-10 22:25:09] [INFO ] Flatten gal took : 148 ms
[2023-03-10 22:25:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 48 ms.
[2023-03-10 22:25:09] [INFO ] Time to serialize gal into /tmp/LTL5451859811922664857.gal : 20 ms
[2023-03-10 22:25:09] [INFO ] Time to serialize properties into /tmp/LTL1509424039426229890.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/LTL5451859811922664857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1509424039426229890.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 : !((F(G("(i5.i3.u37.p27<1)"))))
Formula 0 simplified : GF!"(i5.i3.u37.p27<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5138393475078085415
[2023-03-10 22:25:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5138393475078085415
Running compilation step : cd /tmp/ltsmin5138393475078085415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 610 ms.
Running link step : cd /tmp/ltsmin5138393475078085415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5138393475078085415;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLFireability-01 finished in 100290 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(!p0) U (p1 U p2)))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 232 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 235 place count 408 transition count 356
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 495 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 277 transition count 264
Applied a total of 496 rules in 49 ms. Remains 277 /527 variables (removed 250) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 277 cols
[2023-03-10 22:25:39] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-10 22:25:39] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-10 22:25:39] [INFO ] Invariant cache hit.
[2023-03-10 22:25:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-10 22:25:41] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
[2023-03-10 22:25:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:25:41] [INFO ] Invariant cache hit.
[2023-03-10 22:25:41] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/527 places, 264/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1984 ms. Remains : 277/527 places, 264/497 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s41 1) (GEQ s48 1)), p0:(AND (GEQ s40 1) (GEQ s59 1)), p1:(GEQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 1 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-02 finished in 2170 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(G(p1)))))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-10 22:25:41] [INFO ] Computed 49 place invariants in 39 ms
[2023-03-10 22:25:42] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-10 22:25:42] [INFO ] Invariant cache hit.
[2023-03-10 22:25:44] [INFO ] Implicit Places using invariants and state equation in 2956 ms returned []
Implicit Place search using SMT with State Equation took 3325 ms to find 0 implicit places.
[2023-03-10 22:25:44] [INFO ] Invariant cache hit.
[2023-03-10 22:25:45] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4031 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-06 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=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s72 1) (GEQ s107 1)), p0:(AND (GEQ s426 1) (GEQ s445 1))], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-06 finished in 4373 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&&X(F(p0))))))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 33 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-10 22:25:46] [INFO ] Invariant cache hit.
[2023-03-10 22:25:46] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-10 22:25:46] [INFO ] Invariant cache hit.
[2023-03-10 22:25:49] [INFO ] Implicit Places using invariants and state equation in 2723 ms returned []
Implicit Place search using SMT with State Equation took 3284 ms to find 0 implicit places.
[2023-03-10 22:25:49] [INFO ] Invariant cache hit.
[2023-03-10 22:25:49] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3678 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s345 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 523 ms.
Product exploration explored 100000 steps with 33333 reset in 718 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-010-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLFireability-07 finished in 5217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 22 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-10 22:25:51] [INFO ] Invariant cache hit.
[2023-03-10 22:25:51] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-10 22:25:51] [INFO ] Invariant cache hit.
[2023-03-10 22:25:54] [INFO ] Implicit Places using invariants and state equation in 3066 ms returned []
Implicit Place search using SMT with State Equation took 3562 ms to find 0 implicit places.
[2023-03-10 22:25:54] [INFO ] Invariant cache hit.
[2023-03-10 22:25:55] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3964 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s480 1) (GEQ s520 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][false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-09 finished in 4063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((!p0 U (p1||G(!p0))))) U G(p2))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 15 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-10 22:25:55] [INFO ] Invariant cache hit.
[2023-03-10 22:25:55] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-10 22:25:55] [INFO ] Invariant cache hit.
[2023-03-10 22:25:58] [INFO ] Implicit Places using invariants and state equation in 3021 ms returned []
Implicit Place search using SMT with State Equation took 3336 ms to find 0 implicit places.
[2023-03-10 22:25:58] [INFO ] Invariant cache hit.
[2023-03-10 22:25:59] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4077 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 p2)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s108 1), p1:(AND (NOT (AND (GEQ s368 1) (GEQ s388 1))) (NOT (AND (GEQ s186 1) (GEQ s292 1)))), p0:(AND (GEQ s186 1) (GEQ s292 1))], 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 24974 reset in 595 ms.
Product exploration explored 100000 steps with 25019 reset in 448 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 380 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 341 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 159256 steps, run timeout after 3009 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 159256 steps, saw 79641 distinct states, run finished after 3009 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-10 22:26:05] [INFO ] Invariant cache hit.
[2023-03-10 22:26:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:26:05] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 33 ms returned sat
[2023-03-10 22:26:06] [INFO ] After 565ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2023-03-10 22:26:06] [INFO ] After 666ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-10 22:26:06] [INFO ] After 962ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:3
[2023-03-10 22:26:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:26:06] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 29 ms returned sat
[2023-03-10 22:26:07] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-10 22:26:07] [INFO ] Deduced a trap composed of 101 places in 228 ms of which 1 ms to minimize.
[2023-03-10 22:26:08] [INFO ] Deduced a trap composed of 89 places in 226 ms of which 1 ms to minimize.
[2023-03-10 22:26:08] [INFO ] Deduced a trap composed of 77 places in 227 ms of which 1 ms to minimize.
[2023-03-10 22:26:08] [INFO ] Deduced a trap composed of 79 places in 229 ms of which 1 ms to minimize.
[2023-03-10 22:26:09] [INFO ] Deduced a trap composed of 61 places in 253 ms of which 1 ms to minimize.
[2023-03-10 22:26:09] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 1 ms to minimize.
[2023-03-10 22:26:09] [INFO ] Deduced a trap composed of 90 places in 250 ms of which 1 ms to minimize.
[2023-03-10 22:26:09] [INFO ] Deduced a trap composed of 58 places in 258 ms of which 4 ms to minimize.
[2023-03-10 22:26:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2290 ms
[2023-03-10 22:26:10] [INFO ] Deduced a trap composed of 59 places in 257 ms of which 5 ms to minimize.
[2023-03-10 22:26:10] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 1 ms to minimize.
[2023-03-10 22:26:10] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 1 ms to minimize.
[2023-03-10 22:26:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 782 ms
[2023-03-10 22:26:11] [INFO ] Deduced a trap composed of 83 places in 209 ms of which 1 ms to minimize.
[2023-03-10 22:26:11] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 0 ms to minimize.
[2023-03-10 22:26:11] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 0 ms to minimize.
[2023-03-10 22:26:11] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 0 ms to minimize.
[2023-03-10 22:26:12] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 0 ms to minimize.
[2023-03-10 22:26:12] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 1 ms to minimize.
[2023-03-10 22:26:12] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 0 ms to minimize.
[2023-03-10 22:26:12] [INFO ] Deduced a trap composed of 127 places in 132 ms of which 1 ms to minimize.
[2023-03-10 22:26:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1681 ms
[2023-03-10 22:26:13] [INFO ] After 6516ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 596 ms.
[2023-03-10 22:26:13] [INFO ] After 7378ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1223 ms.
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 233 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 236 place count 408 transition count 356
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 280 place count 386 transition count 356
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 458 place count 297 transition count 267
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 492 place count 280 transition count 267
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 280 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 494 place count 279 transition count 266
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 536 place count 279 transition count 224
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 578 place count 237 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 618 place count 237 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 619 place count 236 transition count 223
Applied a total of 619 rules in 69 ms. Remains 236 /527 variables (removed 291) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 236/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 201830 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201830 steps, saw 100970 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 223 rows 236 cols
[2023-03-10 22:26:18] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-10 22:26:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:26:18] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 23 ms returned sat
[2023-03-10 22:26:18] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-10 22:26:18] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-10 22:26:18] [INFO ] After 129ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-10 22:26:18] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-10 22:26:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-10 22:26:18] [INFO ] After 288ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:26:18] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:26:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:26:19] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-10 22:26:19] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:26:19] [INFO ] After 147ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 22:26:19] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-10 22:26:19] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2023-03-10 22:26:19] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-10 22:26:19] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-10 22:26:19] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2023-03-10 22:26:19] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 968 ms
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2023-03-10 22:26:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2023-03-10 22:26:20] [INFO ] After 1644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-10 22:26:21] [INFO ] After 2091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2539 ms.
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-10 22:26:23] [INFO ] Invariant cache hit.
[2023-03-10 22:26:24] [INFO ] Implicit Places using invariants in 518 ms returned [20, 26, 46, 52, 74, 79, 99, 106, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 529 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 218 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 210 transition count 215
Applied a total of 16 rules in 12 ms. Remains 210 /218 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 210 cols
[2023-03-10 22:26:24] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 22:26:24] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-10 22:26:24] [INFO ] Invariant cache hit.
[2023-03-10 22:26:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-10 22:26:26] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2270 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/236 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2821 ms. Remains : 210/236 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1408 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 880 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 203558 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203558 steps, saw 101799 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 22:26:30] [INFO ] Invariant cache hit.
[2023-03-10 22:26:30] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-10 22:26:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 22:26:30] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-10 22:26:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-10 22:26:30] [INFO ] After 138ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-10 22:26:30] [INFO ] After 159ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 22:26:30] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-10 22:26:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 22:26:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 22:26:31] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:26:31] [INFO ] After 230ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 22:26:31] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-10 22:26:31] [INFO ] After 999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2573 ms.
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-10 22:26:34] [INFO ] Invariant cache hit.
[2023-03-10 22:26:34] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-10 22:26:34] [INFO ] Invariant cache hit.
[2023-03-10 22:26:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-10 22:26:36] [INFO ] Implicit Places using invariants and state equation in 2053 ms returned []
Implicit Place search using SMT with State Equation took 2348 ms to find 0 implicit places.
[2023-03-10 22:26:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:26:36] [INFO ] Invariant cache hit.
[2023-03-10 22:26:36] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2595 ms. Remains : 210/210 places, 215/215 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 210 transition count 199
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 194 transition count 199
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 187 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 187 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 186 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 186 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 50 place count 185 transition count 190
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 185 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 183 transition count 188
Applied a total of 54 rules in 28 ms. Remains 183 /210 variables (removed 27) and now considering 188/215 (removed 27) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 188 rows 183 cols
[2023-03-10 22:26:36] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-10 22:26:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 22:26:37] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-10 22:26:37] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-10 22:26:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 22:26:37] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-10 22:26:37] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-10 22:26:37] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-10 22:26:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 22:26:37] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-10 22:26:37] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:26:37] [INFO ] After 185ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 22:26:37] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-03-10 22:26:37] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-10 22:26:37] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 348 ms
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 1 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 1 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 0 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 0 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2023-03-10 22:26:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 686 ms
[2023-03-10 22:26:39] [INFO ] After 1525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-10 22:26:39] [INFO ] After 1970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 391 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
// Phase 1: matrix 497 rows 527 cols
[2023-03-10 22:26:39] [INFO ] Computed 49 place invariants in 24 ms
[2023-03-10 22:26:40] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 22:26:40] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 30 ms returned sat
[2023-03-10 22:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:26:43] [INFO ] [Real]Absence check using state equation in 3704 ms returned sat
[2023-03-10 22:26:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:26:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 22:26:44] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 39 ms returned sat
[2023-03-10 22:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:26:47] [INFO ] [Nat]Absence check using state equation in 2750 ms returned sat
[2023-03-10 22:26:47] [INFO ] Deduced a trap composed of 91 places in 223 ms of which 1 ms to minimize.
[2023-03-10 22:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-10 22:26:47] [INFO ] Computed and/alt/rep : 496/958/496 causal constraints (skipped 0 transitions) in 83 ms.
[2023-03-10 22:26:56] [INFO ] Added : 342 causal constraints over 69 iterations in 9057 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 117 rules applied. Total rules applied 232 place count 411 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 235 place count 408 transition count 357
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 277 place count 387 transition count 357
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 455 place count 298 transition count 268
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 489 place count 281 transition count 268
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 492 place count 281 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 280 transition count 267
Applied a total of 493 rules in 94 ms. Remains 280 /527 variables (removed 247) and now considering 267/497 (removed 230) transitions.
// Phase 1: matrix 267 rows 280 cols
[2023-03-10 22:26:56] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-10 22:26:57] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-10 22:26:57] [INFO ] Invariant cache hit.
[2023-03-10 22:26:57] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-10 22:26:58] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
[2023-03-10 22:26:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 22:26:58] [INFO ] Invariant cache hit.
[2023-03-10 22:26:59] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/527 places, 267/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2313 ms. Remains : 280/527 places, 267/497 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 845 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 1372 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 463982 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463982 steps, saw 232061 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:27:02] [INFO ] Invariant cache hit.
[2023-03-10 22:27:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:27:02] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 17 ms returned sat
[2023-03-10 22:27:02] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-10 22:27:02] [INFO ] After 35ms SMT Verify possible using 17 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 22:27:02] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 22:27:02] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 267/267 transitions.
Graph (complete) has 807 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 279 transition count 260
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 273 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 272 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 55 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 92 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 131 place count 234 transition count 222
Applied a total of 131 rules in 37 ms. Remains 234 /280 variables (removed 46) and now considering 222/267 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 234/280 places, 222/267 transitions.
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 538167 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538167 steps, saw 269239 distinct states, run finished after 3004 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-10 22:27:05] [INFO ] Computed 49 place invariants in 16 ms
[2023-03-10 22:27:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:27:05] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-10 22:27:06] [INFO ] After 205ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:27:06] [INFO ] After 101ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 22:27:06] [INFO ] After 130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-10 22:27:06] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-10 22:27:06] [INFO ] Invariant cache hit.
[2023-03-10 22:27:06] [INFO ] Implicit Places using invariants in 737 ms returned [20, 26, 46, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 741 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 10 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-10 22:27:06] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-10 22:27:07] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-10 22:27:07] [INFO ] Invariant cache hit.
[2023-03-10 22:27:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:27:09] [INFO ] Implicit Places using invariants and state equation in 2347 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3367 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 512501 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 512501 steps, saw 256296 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:27:12] [INFO ] Invariant cache hit.
[2023-03-10 22:27:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 22:27:12] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-10 22:27:12] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:27:12] [INFO ] After 114ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 22:27:12] [INFO ] After 140ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-10 22:27:12] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-10 22:27:12] [INFO ] Invariant cache hit.
[2023-03-10 22:27:13] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-10 22:27:13] [INFO ] Invariant cache hit.
[2023-03-10 22:27:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:27:15] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2155 ms to find 0 implicit places.
[2023-03-10 22:27:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 22:27:15] [INFO ] Invariant cache hit.
[2023-03-10 22:27:15] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2380 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 19 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-10 22:27:15] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-10 22:27:15] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 22:27:15] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-10 22:27:15] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:27:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 22:27:15] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-10 22:27:15] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:27:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:27:15] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:27:16] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 0 ms to minimize.
[2023-03-10 22:27:16] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 1 ms to minimize.
[2023-03-10 22:27:16] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 1 ms to minimize.
[2023-03-10 22:27:16] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2023-03-10 22:27:16] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 0 ms to minimize.
[2023-03-10 22:27:16] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 1 ms to minimize.
[2023-03-10 22:27:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1120 ms
[2023-03-10 22:27:17] [INFO ] After 1145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 22:27:17] [INFO ] After 1392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
// Phase 1: matrix 267 rows 280 cols
[2023-03-10 22:27:17] [INFO ] Computed 49 place invariants in 17 ms
[2023-03-10 22:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:27:17] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 36 ms returned sat
[2023-03-10 22:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:27:18] [INFO ] [Real]Absence check using state equation in 1111 ms returned sat
[2023-03-10 22:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:27:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:27:18] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 36 ms returned sat
[2023-03-10 22:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:27:19] [INFO ] [Nat]Absence check using state equation in 919 ms returned sat
[2023-03-10 22:27:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-10 22:27:20] [INFO ] [Nat]Added 17 Read/Feed constraints in 221 ms returned sat
[2023-03-10 22:27:20] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-10 22:27:20] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-10 22:27:20] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2023-03-10 22:27:20] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2023-03-10 22:27:20] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2023-03-10 22:27:21] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2023-03-10 22:27:21] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2023-03-10 22:27:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1128 ms
[2023-03-10 22:27:21] [INFO ] Computed and/alt/rep : 266/967/266 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-10 22:27:25] [INFO ] Added : 210 causal constraints over 43 iterations in 4378 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-10 finished in 90394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 525 transition count 382
Reduce places removed 113 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 117 rules applied. Total rules applied 231 place count 412 transition count 378
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 235 place count 408 transition count 378
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 235 place count 408 transition count 356
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 457 place count 297 transition count 267
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 491 place count 280 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 492 place count 279 transition count 266
Applied a total of 492 rules in 39 ms. Remains 279 /527 variables (removed 248) and now considering 266/497 (removed 231) transitions.
// Phase 1: matrix 266 rows 279 cols
[2023-03-10 22:27:25] [INFO ] Computed 49 place invariants in 14 ms
[2023-03-10 22:27:25] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-10 22:27:25] [INFO ] Invariant cache hit.
[2023-03-10 22:27:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-10 22:27:27] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2023-03-10 22:27:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:27:27] [INFO ] Invariant cache hit.
[2023-03-10 22:27:27] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/527 places, 266/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1873 ms. Remains : 279/527 places, 266/497 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s163 1) (GEQ s170 1)), p1:(AND (LT s16 1) (OR (LT s251 1) (LT s269 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-11 finished in 2046 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 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 243 place count 404 transition count 353
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 32 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-10 22:27:27] [INFO ] Computed 49 place invariants in 9 ms
[2023-03-10 22:27:28] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-10 22:27:28] [INFO ] Invariant cache hit.
[2023-03-10 22:27:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:27:30] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2389 ms to find 0 implicit places.
[2023-03-10 22:27:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:27:30] [INFO ] Invariant cache hit.
[2023-03-10 22:27:30] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2646 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s147 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13852 reset in 130 ms.
Product exploration explored 100000 steps with 13791 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1394 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 805 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 487416 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 487416 steps, saw 243784 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:27:33] [INFO ] Invariant cache hit.
[2023-03-10 22:27:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:27:34] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 24 ms returned sat
[2023-03-10 22:27:34] [INFO ] After 227ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:27:34] [INFO ] After 64ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 22:27:34] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-10 22:27:34] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 813 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 17 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 529461 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 529461 steps, saw 264887 distinct states, run finished after 3005 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-10 22:27:37] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-10 22:27:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 22:27:37] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 24 ms returned sat
[2023-03-10 22:27:37] [INFO ] After 182ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:27:37] [INFO ] After 128ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:27:37] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:27:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 22:27:37] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 22 ms returned sat
[2023-03-10 22:27:38] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:27:38] [INFO ] After 135ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:27:38] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 22:27:38] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-10 22:27:38] [INFO ] Invariant cache hit.
[2023-03-10 22:27:38] [INFO ] Implicit Places using invariants in 623 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 628 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 8 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-10 22:27:39] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-10 22:27:39] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-10 22:27:39] [INFO ] Invariant cache hit.
[2023-03-10 22:27:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:27:42] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3672 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 541337 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 541337 steps, saw 270727 distinct states, run finished after 3004 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:27:45] [INFO ] Invariant cache hit.
[2023-03-10 22:27:45] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-10 22:27:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 22:27:45] [INFO ] After 167ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:27:45] [INFO ] After 116ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:27:45] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:27:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 31 ms returned sat
[2023-03-10 22:27:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 22:27:45] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:27:45] [INFO ] After 155ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:27:45] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-10 22:27:46] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-10 22:27:46] [INFO ] Invariant cache hit.
[2023-03-10 22:27:46] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-10 22:27:46] [INFO ] Invariant cache hit.
[2023-03-10 22:27:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:27:48] [INFO ] Implicit Places using invariants and state equation in 2357 ms returned []
Implicit Place search using SMT with State Equation took 2705 ms to find 0 implicit places.
[2023-03-10 22:27:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:27:48] [INFO ] Invariant cache hit.
[2023-03-10 22:27:49] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3055 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 20 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-10 22:27:49] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-10 22:27:49] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-10 22:27:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 22:27:49] [INFO ] After 192ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:27:49] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:27:49] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:27:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-10 22:27:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:27:49] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:27:49] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:27:49] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 22:27:49] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-10 22:27:49] [INFO ] Computed 49 place invariants in 16 ms
[2023-03-10 22:27:50] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-10 22:27:50] [INFO ] Invariant cache hit.
[2023-03-10 22:27:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:27:52] [INFO ] Implicit Places using invariants and state equation in 2194 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
[2023-03-10 22:27:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:27:52] [INFO ] Invariant cache hit.
[2023-03-10 22:27:52] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3007 ms. Remains : 272/272 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1370 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 437122 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437122 steps, saw 218634 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:27:56] [INFO ] Invariant cache hit.
[2023-03-10 22:27:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:27:56] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-10 22:27:56] [INFO ] After 218ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:56] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:27:56] [INFO ] After 66ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-10 22:27:56] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-10 22:27:56] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 813 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 17 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1286 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 527475 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 527475 steps, saw 263886 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2023-03-10 22:27:59] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-10 22:27:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 22:27:59] [INFO ] [Real]Absence check using 3 positive and 46 generalized place invariants in 23 ms returned sat
[2023-03-10 22:27:59] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:27:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:28:00] [INFO ] After 129ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:28:00] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:28:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 22:28:00] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 22 ms returned sat
[2023-03-10 22:28:00] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:28:00] [INFO ] After 136ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:28:00] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 22:28:00] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-10 22:28:00] [INFO ] Invariant cache hit.
[2023-03-10 22:28:01] [INFO ] Implicit Places using invariants in 508 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 515 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 10 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-10 22:28:01] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-10 22:28:01] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-10 22:28:01] [INFO ] Invariant cache hit.
[2023-03-10 22:28:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:28:03] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2641 ms. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1467 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 564396 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 564396 steps, saw 282258 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:28:06] [INFO ] Invariant cache hit.
[2023-03-10 22:28:06] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-10 22:28:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:28:06] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:28:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:28:06] [INFO ] After 119ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:28:06] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:28:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-10 22:28:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:28:06] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:28:06] [INFO ] After 96ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:28:06] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-10 22:28:06] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-10 22:28:06] [INFO ] Invariant cache hit.
[2023-03-10 22:28:07] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-10 22:28:07] [INFO ] Invariant cache hit.
[2023-03-10 22:28:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:28:08] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
[2023-03-10 22:28:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:28:08] [INFO ] Invariant cache hit.
[2023-03-10 22:28:09] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2225 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 13 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-10 22:28:09] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 22:28:09] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-10 22:28:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:28:09] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:28:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:28:09] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:28:09] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:28:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-10 22:28:09] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:28:09] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:28:09] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:28:09] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 22:28:09] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13869 reset in 132 ms.
Product exploration explored 100000 steps with 13952 reset in 149 ms.
Built C files in :
/tmp/ltsmin16957512203989351530
[2023-03-10 22:28:10] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2023-03-10 22:28:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:28:10] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2023-03-10 22:28:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:28:10] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2023-03-10 22:28:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:28:10] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16957512203989351530
Running compilation step : cd /tmp/ltsmin16957512203989351530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 844 ms.
Running link step : cd /tmp/ltsmin16957512203989351530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16957512203989351530;'/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' '--hoa' '/tmp/stateBased11195663025708956163.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-10 22:28:25] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-10 22:28:25] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-10 22:28:25] [INFO ] Invariant cache hit.
[2023-03-10 22:28:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:28:27] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2023-03-10 22:28:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:28:27] [INFO ] Invariant cache hit.
[2023-03-10 22:28:27] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2227 ms. Remains : 272/272 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin7115205407676326145
[2023-03-10 22:28:27] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2023-03-10 22:28:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:28:27] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2023-03-10 22:28:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:28:27] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2023-03-10 22:28:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:28:27] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7115205407676326145
Running compilation step : cd /tmp/ltsmin7115205407676326145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 804 ms.
Running link step : cd /tmp/ltsmin7115205407676326145;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7115205407676326145;'/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' '--hoa' '/tmp/stateBased135288975808879291.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 22:28:42] [INFO ] Flatten gal took : 23 ms
[2023-03-10 22:28:42] [INFO ] Flatten gal took : 30 ms
[2023-03-10 22:28:42] [INFO ] Time to serialize gal into /tmp/LTL17074156888866997026.gal : 3 ms
[2023-03-10 22:28:42] [INFO ] Time to serialize properties into /tmp/LTL4464968966191146346.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/LTL17074156888866997026.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15816481970672021466.hoa' '-atoms' '/tmp/LTL4464968966191146346.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/LTL4464968966191146346.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15816481970672021466.hoa
Detected timeout of ITS tools.
[2023-03-10 22:28:57] [INFO ] Flatten gal took : 15 ms
[2023-03-10 22:28:57] [INFO ] Flatten gal took : 14 ms
[2023-03-10 22:28:57] [INFO ] Time to serialize gal into /tmp/LTL804162764652439908.gal : 2 ms
[2023-03-10 22:28:57] [INFO ] Time to serialize properties into /tmp/LTL5076918180539051055.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/LTL804162764652439908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5076918180539051055.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 : !((F(G("(p357<1)"))))
Formula 0 simplified : GF!"(p357<1)"
Detected timeout of ITS tools.
[2023-03-10 22:29:12] [INFO ] Flatten gal took : 14 ms
[2023-03-10 22:29:12] [INFO ] Applying decomposition
[2023-03-10 22:29:12] [INFO ] Flatten gal took : 12 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/graph15236022208662149005.txt' '-o' '/tmp/graph15236022208662149005.bin' '-w' '/tmp/graph15236022208662149005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15236022208662149005.bin' '-l' '-1' '-v' '-w' '/tmp/graph15236022208662149005.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:29:13] [INFO ] Decomposing Gal with order
[2023-03-10 22:29:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:29:13] [INFO ] Removed a total of 198 redundant transitions.
[2023-03-10 22:29:13] [INFO ] Flatten gal took : 36 ms
[2023-03-10 22:29:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 13 ms.
[2023-03-10 22:29:13] [INFO ] Time to serialize gal into /tmp/LTL2677360448089402510.gal : 7 ms
[2023-03-10 22:29:13] [INFO ] Time to serialize properties into /tmp/LTL4423637203260662551.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/LTL2677360448089402510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4423637203260662551.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 : !((F(G("(i2.i0.u60.p357<1)"))))
Formula 0 simplified : GF!"(i2.i0.u60.p357<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14717340931633886723
[2023-03-10 22:29:28] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14717340931633886723
Running compilation step : cd /tmp/ltsmin14717340931633886723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 673 ms.
Running link step : cd /tmp/ltsmin14717340931633886723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14717340931633886723;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLFireability-12 finished in 135594 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)) U (p1 U p2)) U p2))'
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 43 ms. Remains 274 /527 variables (removed 253) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2023-03-10 22:29:43] [INFO ] Computed 49 place invariants in 12 ms
[2023-03-10 22:29:43] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-10 22:29:43] [INFO ] Invariant cache hit.
[2023-03-10 22:29:43] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:29:45] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2023-03-10 22:29:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:29:45] [INFO ] Invariant cache hit.
[2023-03-10 22:29:45] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/527 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2151 ms. Remains : 274/527 places, 262/497 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s84 1), p0:(GEQ s17 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-13 finished in 2297 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 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 243 place count 404 transition count 353
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 383 transition count 353
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 33 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-10 22:29:45] [INFO ] Computed 49 place invariants in 9 ms
[2023-03-10 22:29:45] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-10 22:29:45] [INFO ] Invariant cache hit.
[2023-03-10 22:29:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-10 22:29:47] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2023-03-10 22:29:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:29:47] [INFO ] Invariant cache hit.
[2023-03-10 22:29:47] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1924 ms. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s51 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 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-14 finished in 1974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||G(p1)) U X(!p2)))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 11 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-10 22:29:47] [INFO ] Computed 49 place invariants in 25 ms
[2023-03-10 22:29:47] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-10 22:29:47] [INFO ] Invariant cache hit.
[2023-03-10 22:29:51] [INFO ] Implicit Places using invariants and state equation in 3082 ms returned []
Implicit Place search using SMT with State Equation took 3433 ms to find 0 implicit places.
[2023-03-10 22:29:51] [INFO ] Invariant cache hit.
[2023-03-10 22:29:51] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3851 ms. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 327 ms :[p2, p2, p2, p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s309 1) (GEQ s355 1)), p1:(GEQ s24 1), p2:(AND (GEQ s128 1) (GEQ s233 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 340 ms.
Product exploration explored 100000 steps with 25000 reset in 354 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p2, p2, p2, p2, true]
Incomplete random walk after 10000 steps, including 321 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 329103 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329103 steps, saw 164584 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:29:55] [INFO ] Invariant cache hit.
[2023-03-10 22:29:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:29:55] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-10 22:29:56] [INFO ] After 551ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:29:56] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 0 ms to minimize.
[2023-03-10 22:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-10 22:29:56] [INFO ] After 836ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:29:56] [INFO ] After 970ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:29:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:29:56] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-10 22:29:57] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:29:57] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
[2023-03-10 22:29:57] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 1 ms to minimize.
[2023-03-10 22:29:58] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 0 ms to minimize.
[2023-03-10 22:29:58] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 0 ms to minimize.
[2023-03-10 22:29:58] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 1 ms to minimize.
[2023-03-10 22:29:58] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2023-03-10 22:29:58] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 1 ms to minimize.
[2023-03-10 22:29:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1323 ms
[2023-03-10 22:29:58] [INFO ] After 1860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-10 22:29:58] [INFO ] After 2033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 407 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 242 place count 405 transition count 353
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 466 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 502 place count 275 transition count 263
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 541 place count 275 transition count 224
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 580 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 37 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 235/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511753 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511753 steps, saw 256038 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2023-03-10 22:30:01] [INFO ] Computed 49 place invariants in 11 ms
[2023-03-10 22:30:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:30:02] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 35 ms returned sat
[2023-03-10 22:30:02] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:30:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:30:02] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 27 ms returned sat
[2023-03-10 22:30:02] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:30:02] [INFO ] After 114ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:02] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 22:30:02] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-10 22:30:02] [INFO ] Invariant cache hit.
[2023-03-10 22:30:03] [INFO ] Implicit Places using invariants in 521 ms returned [20, 26, 47, 52, 73, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 532 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 209 transition count 215
Applied a total of 16 rules in 8 ms. Remains 209 /217 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 209 cols
[2023-03-10 22:30:03] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 22:30:03] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-10 22:30:03] [INFO ] Invariant cache hit.
[2023-03-10 22:30:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:30:05] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2525 ms. Remains : 209/235 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1465 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 540345 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 540345 steps, saw 270247 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:30:08] [INFO ] Invariant cache hit.
[2023-03-10 22:30:08] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 22:30:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:30:08] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:30:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 50 ms returned sat
[2023-03-10 22:30:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:30:08] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:30:08] [INFO ] After 80ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:08] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-03-10 22:30:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-10 22:30:08] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-10 22:30:09] [INFO ] After 594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-10 22:30:09] [INFO ] Invariant cache hit.
[2023-03-10 22:30:09] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-10 22:30:09] [INFO ] Invariant cache hit.
[2023-03-10 22:30:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:30:11] [INFO ] Implicit Places using invariants and state equation in 2038 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2023-03-10 22:30:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 22:30:11] [INFO ] Invariant cache hit.
[2023-03-10 22:30:11] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2510 ms. Remains : 209/209 places, 215/215 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2023-03-10 22:30:11] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-10 22:30:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 22:30:11] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-10 22:30:11] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:30:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 22:30:11] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-10 22:30:11] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:30:11] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:12] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-10 22:30:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-10 22:30:12] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-10 22:30:12] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 152 ms :[p2, p2, p2, p2, true]
Support contains 2 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 11 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2023-03-10 22:30:12] [INFO ] Computed 49 place invariants in 22 ms
[2023-03-10 22:30:12] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-10 22:30:12] [INFO ] Invariant cache hit.
[2023-03-10 22:30:15] [INFO ] Implicit Places using invariants and state equation in 2990 ms returned []
Implicit Place search using SMT with State Equation took 3307 ms to find 0 implicit places.
[2023-03-10 22:30:15] [INFO ] Invariant cache hit.
[2023-03-10 22:30:16] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3737 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[p2, p2, p2, p2, true]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 330576 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330576 steps, saw 165321 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:30:19] [INFO ] Invariant cache hit.
[2023-03-10 22:30:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:30:19] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-10 22:30:20] [INFO ] After 552ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 22:30:20] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 1 ms to minimize.
[2023-03-10 22:30:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-10 22:30:20] [INFO ] After 825ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:30:20] [INFO ] After 952ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:30:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:30:20] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-10 22:30:21] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:21] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 0 ms to minimize.
[2023-03-10 22:30:21] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 1 ms to minimize.
[2023-03-10 22:30:21] [INFO ] Deduced a trap composed of 95 places in 165 ms of which 1 ms to minimize.
[2023-03-10 22:30:22] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 1 ms to minimize.
[2023-03-10 22:30:22] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 1 ms to minimize.
[2023-03-10 22:30:22] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 0 ms to minimize.
[2023-03-10 22:30:22] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 1 ms to minimize.
[2023-03-10 22:30:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1355 ms
[2023-03-10 22:30:22] [INFO ] After 1911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-10 22:30:22] [INFO ] After 2076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 407 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 242 place count 405 transition count 353
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 466 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 502 place count 275 transition count 263
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 541 place count 275 transition count 224
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 580 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 37 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 235/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 514729 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 514729 steps, saw 257522 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2023-03-10 22:30:25] [INFO ] Computed 49 place invariants in 15 ms
[2023-03-10 22:30:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 22:30:25] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-10 22:30:26] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:30:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 22:30:26] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-10 22:30:26] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:30:26] [INFO ] After 112ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:26] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-10 22:30:26] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-10 22:30:26] [INFO ] Invariant cache hit.
[2023-03-10 22:30:27] [INFO ] Implicit Places using invariants in 543 ms returned [20, 26, 47, 52, 73, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 545 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 209 transition count 215
Applied a total of 16 rules in 8 ms. Remains 209 /217 variables (removed 8) and now considering 215/223 (removed 8) transitions.
// Phase 1: matrix 215 rows 209 cols
[2023-03-10 22:30:27] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-10 22:30:27] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-10 22:30:27] [INFO ] Invariant cache hit.
[2023-03-10 22:30:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:30:28] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2422 ms. Remains : 209/235 places, 215/223 transitions.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 546860 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 546860 steps, saw 273507 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:30:31] [INFO ] Invariant cache hit.
[2023-03-10 22:30:32] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 22:30:32] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:30:32] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:30:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 22:30:32] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:30:32] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:30:32] [INFO ] After 80ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:32] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2023-03-10 22:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-10 22:30:32] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-10 22:30:32] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-10 22:30:32] [INFO ] Invariant cache hit.
[2023-03-10 22:30:32] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-10 22:30:32] [INFO ] Invariant cache hit.
[2023-03-10 22:30:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:30:34] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
[2023-03-10 22:30:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:30:34] [INFO ] Invariant cache hit.
[2023-03-10 22:30:34] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2136 ms. Remains : 209/209 places, 215/215 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 209 transition count 198
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 192 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 183 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 12 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2023-03-10 22:30:34] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-10 22:30:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 22:30:34] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-10 22:30:35] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:30:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 22:30:35] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-10 22:30:35] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 22:30:35] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 22:30:35] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-10 22:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-10 22:30:35] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-10 22:30:35] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 190 ms :[p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 179 ms :[p2, p2, p2, p2, true]
Product exploration explored 100000 steps with 25000 reset in 342 ms.
Product exploration explored 100000 steps with 25000 reset in 348 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 165 ms :[p2, p2, p2, p2, true]
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 496
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 118 place count 526 transition count 515
Deduced a syphon composed of 140 places in 3 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 141 place count 526 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 145 place count 522 transition count 511
Deduced a syphon composed of 136 places in 3 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 149 place count 522 transition count 511
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 226 places in 2 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 239 place count 522 transition count 529
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 240 place count 521 transition count 528
Deduced a syphon composed of 225 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 241 place count 521 transition count 528
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -120
Deduced a syphon composed of 245 places in 11 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 261 place count 521 transition count 648
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 282 place count 500 transition count 606
Deduced a syphon composed of 224 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 303 place count 500 transition count 606
Deduced a syphon composed of 224 places in 2 ms
Applied a total of 303 rules in 246 ms. Remains 500 /527 variables (removed 27) and now considering 606/497 (removed -109) transitions.
[2023-03-10 22:30:37] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 606 rows 500 cols
[2023-03-10 22:30:37] [INFO ] Computed 49 place invariants in 38 ms
[2023-03-10 22:30:38] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 606/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 999 ms. Remains : 500/527 places, 606/497 transitions.
Built C files in :
/tmp/ltsmin6558257373919375981
[2023-03-10 22:30:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6558257373919375981
Running compilation step : cd /tmp/ltsmin6558257373919375981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1250 ms.
Running link step : cd /tmp/ltsmin6558257373919375981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6558257373919375981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18184661849082971181.hoa' '--buchi-type=spotba'
LTSmin run took 577 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-010-LTLFireability-15 finished in 52454 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)))'
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)))'
[2023-03-10 22:30:40] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
[2023-03-10 22:30:40] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin16314702361994314376
[2023-03-10 22:30:40] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2023-03-10 22:30:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:30:40] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2023-03-10 22:30:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:30:40] [INFO ] Flatten gal took : 34 ms
[2023-03-10 22:30:40] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2023-03-10 22:30:40] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:30:40] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16314702361994314376
Running compilation step : cd /tmp/ltsmin16314702361994314376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8395889516590996720.txt' '-o' '/tmp/graph8395889516590996720.bin' '-w' '/tmp/graph8395889516590996720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8395889516590996720.bin' '-l' '-1' '-v' '-w' '/tmp/graph8395889516590996720.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:30:40] [INFO ] Decomposing Gal with order
[2023-03-10 22:30:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:30:40] [INFO ] Removed a total of 140 redundant transitions.
[2023-03-10 22:30:40] [INFO ] Flatten gal took : 104 ms
[2023-03-10 22:30:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 24 ms.
[2023-03-10 22:30:40] [INFO ] Time to serialize gal into /tmp/LTLFireability15678329893317342551.gal : 8 ms
[2023-03-10 22:30:40] [INFO ] Time to serialize properties into /tmp/LTLFireability13733679236695098908.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/LTLFireability15678329893317342551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13733679236695098908.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((F(G("(i9.u78.p27<1)"))))
Formula 0 simplified : GF!"(i9.u78.p27<1)"
Compilation finished in 1772 ms.
Running link step : cd /tmp/ltsmin16314702361994314376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16314702361994314376;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: Initializing POR dependencies: labels 499, guards 497
pins2lts-mc-linux64( 4/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.278: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 1.183: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 1.778: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 1.834: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 2.294: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 2.747: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 6.300: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 6.300: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 6.300: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 9.040: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 9.062: There are 500 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 9.062: State length is 528, there are 501 groups
pins2lts-mc-linux64( 0/ 8), 9.062: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 9.062: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 9.062: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 9.062: Visible groups: 0 / 501, labels: 1 / 500
pins2lts-mc-linux64( 0/ 8), 9.062: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 9.062: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 9.126: [Blue] ~104 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 6/ 8), 9.325: [Blue] ~190 levels ~1920 states ~2136 transitions
pins2lts-mc-linux64( 6/ 8), 9.478: [Blue] ~280 levels ~3840 states ~4264 transitions
pins2lts-mc-linux64( 3/ 8), 9.759: [Blue] ~491 levels ~7680 states ~8584 transitions
pins2lts-mc-linux64( 3/ 8), 10.408: [Blue] ~928 levels ~15360 states ~17192 transitions
pins2lts-mc-linux64( 3/ 8), 11.392: [Blue] ~1061 levels ~30720 states ~34376 transitions
pins2lts-mc-linux64( 0/ 8), 13.860: [Blue] ~1277 levels ~61440 states ~68720 transitions
pins2lts-mc-linux64( 0/ 8), 18.853: [Blue] ~1422 levels ~122880 states ~137216 transitions
pins2lts-mc-linux64( 0/ 8), 27.259: [Blue] ~1616 levels ~245760 states ~274144 transitions
pins2lts-mc-linux64( 0/ 8), 43.819: [Blue] ~2512 levels ~491520 states ~548304 transitions
pins2lts-mc-linux64( 1/ 8), 74.245: [Blue] ~4280 levels ~983040 states ~1098656 transitions
pins2lts-mc-linux64( 0/ 8), 122.692: [Blue] ~7540 levels ~1966080 states ~2192744 transitions
pins2lts-mc-linux64( 0/ 8), 180.625: [Blue] ~14829 levels ~3932160 states ~4381592 transitions
pins2lts-mc-linux64( 0/ 8), 280.228: [Blue] ~30019 levels ~7864320 states ~8745320 transitions
pins2lts-mc-linux64( 2/ 8), 476.312: [Blue] ~52888 levels ~15728640 states ~17481840 transitions
pins2lts-mc-linux64( 1/ 8), 853.391: [Blue] ~19469 levels ~31457280 states ~34820264 transitions
pins2lts-mc-linux64( 6/ 8), 1217.828: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1217.860:
pins2lts-mc-linux64( 0/ 8), 1217.860: Explored 45138355 states 49989990 transitions, fanout: 1.107
pins2lts-mc-linux64( 0/ 8), 1217.860: Total exploration time 1208.790 sec (1208.720 sec minimum, 1208.750 sec on average)
pins2lts-mc-linux64( 0/ 8), 1217.860: States per second: 37342, Transitions per second: 41355
pins2lts-mc-linux64( 0/ 8), 1217.860:
pins2lts-mc-linux64( 0/ 8), 1217.860: State space has 41545560 states, 367041 are accepting
pins2lts-mc-linux64( 0/ 8), 1217.860: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1217.860: blue states: 45138355 (108.65%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1217.860: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1217.860: all-red states: 10906749 (26.25%), bogus 476419 (1.15%)
pins2lts-mc-linux64( 0/ 8), 1217.860:
pins2lts-mc-linux64( 0/ 8), 1217.860: Total memory used for local state coloring: 14.1MB
pins2lts-mc-linux64( 0/ 8), 1217.860:
pins2lts-mc-linux64( 0/ 8), 1217.861: Queue width: 8B, total height: 925611, memory: 7.06MB
pins2lts-mc-linux64( 0/ 8), 1217.861: Tree memory: 573.0MB, 14.5 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1217.861: Tree fill ratio (roots/leafs): 30.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1217.861: Stored 499 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1217.861: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1217.861: Est. total memory use: 580.0MB (~1031.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16314702361994314376;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16314702361994314376;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-10 22:53:34] [INFO ] Flatten gal took : 18 ms
[2023-03-10 22:53:34] [INFO ] Time to serialize gal into /tmp/LTLFireability12310356438494314367.gal : 3 ms
[2023-03-10 22:53:34] [INFO ] Time to serialize properties into /tmp/LTLFireability1813186820540471548.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/LTLFireability12310356438494314367.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1813186820540471548.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...298
Read 2 LTL properties
Checking formula 0 : !((F(G("(p27<1)"))))
Formula 0 simplified : GF!"(p27<1)"
Detected timeout of ITS tools.
[2023-03-10 23:16:27] [INFO ] Flatten gal took : 21 ms
[2023-03-10 23:16:27] [INFO ] Input system was already deterministic with 497 transitions.
[2023-03-10 23:16:27] [INFO ] Transformed 527 places.
[2023-03-10 23:16:27] [INFO ] Transformed 497 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-10 23:16:27] [INFO ] Time to serialize gal into /tmp/LTLFireability11205794190730736706.gal : 5 ms
[2023-03-10 23:16:27] [INFO ] Time to serialize properties into /tmp/LTLFireability13728948605217678890.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/LTLFireability11205794190730736706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13728948605217678890.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(p27<1)"))))
Formula 0 simplified : GF!"(p27<1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13097128 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034604 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="DoubleExponent-PT-010"
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 DoubleExponent-PT-010, 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 r133-smll-167819411100476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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