Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280300257.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FamilyReunion-COL-L00100M0010C005P005G002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280300257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 21:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 21:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 21:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 23:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 140K May 18 16:42 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 FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716593148191

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00100M0010C005P005G002
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-24 23:25:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 23:25:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 23:25:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 23:25:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 23:25:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 859 ms
[2024-05-24 23:25:51] [INFO ] Detected 5 constant HL places corresponding to 31 PT places.
[2024-05-24 23:25:51] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 40706 PT places and 36972.0 transition bindings in 52 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 119 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 23:25:51] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 10 ms.
[2024-05-24 23:25:51] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10100 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=155 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 66 rows 99 cols
[2024-05-24 23:25:52] [INFO ] Computed 33 invariants in 12 ms
[2024-05-24 23:25:52] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-24 23:25:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 23:25:52] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2024-05-24 23:25:52] [INFO ] After 106ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:5
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 23:25:52] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:5
[2024-05-24 23:25:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-24 23:25:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-24 23:25:53] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 23:25:53] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-24 23:25:53] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 535 steps, including 0 resets, run visited all 3 properties in 19 ms. (steps per millisecond=28 )
Parikh walk visited 7 properties in 80 ms.
[2024-05-24 23:25:53] [INFO ] Flatten gal took : 40 ms
[2024-05-24 23:25:53] [INFO ] Flatten gal took : 11 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 6
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 3
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
[2024-05-24 23:25:53] [INFO ] Unfolded HLPN to a Petri net with 37039 places and 31114 transitions 89397 arcs in 316 ms.
[2024-05-24 23:25:53] [INFO ] Unfolded 11 HLPN properties in 2 ms.
Deduced a syphon composed of 101 places in 208 ms
Reduce places removed 122 places and 0 transitions.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8807 out of 36917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36917/36917 places, 31114/31114 transitions.
Reduce places removed 126 places and 0 transitions.
Discarding 5858 places :
Implicit places reduction removed 5858 places
Iterating post reduction 0 with 5984 rules applied. Total rules applied 5984 place count 30933 transition count 31114
Applied a total of 5984 rules in 1128 ms. Remains 30933 /36917 variables (removed 5984) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 30933 cols
[2024-05-24 23:25:57] [INFO ] Computed 2834 invariants in 1966 ms
[2024-05-24 23:26:01] [INFO ] Implicit Places using invariants in 6179 ms returned []
Implicit Place search using SMT only with invariants took 6180 ms to find 0 implicit places.
[2024-05-24 23:26:01] [INFO ] Invariant cache hit.
[2024-05-24 23:26:05] [INFO ] Dead Transitions using invariants and state equation in 3877 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30933/36917 places, 31114/31114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11195 ms. Remains : 30933/36917 places, 31114/31114 transitions.
Support contains 8807 out of 30933 places after structural reductions.
[2024-05-24 23:26:07] [INFO ] Flatten gal took : 1384 ms
[2024-05-24 23:26:08] [INFO ] Flatten gal took : 881 ms
[2024-05-24 23:26:10] [INFO ] Input system was already deterministic with 31114 transitions.
Support contains 7595 out of 30933 places (down from 8807) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1213 ms. (steps per millisecond=8 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 23:26:13] [INFO ] Invariant cache hit.
[2024-05-24 23:26:23] [INFO ] [Real]Absence check using 201 positive place invariants in 494 ms returned sat
[2024-05-24 23:26:27] [INFO ] [Real]Absence check using 201 positive and 2633 generalized place invariants in 3464 ms returned sat
[2024-05-24 23:26:28] [INFO ] After 15504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 23:26:38] [INFO ] [Nat]Absence check using 201 positive place invariants in 508 ms returned sat
[2024-05-24 23:26:42] [INFO ] [Nat]Absence check using 201 positive and 2633 generalized place invariants in 3471 ms returned sat
[2024-05-24 23:26:53] [INFO ] After 7567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 23:26:53] [INFO ] After 7618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 23:26:53] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2528 out of 30933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Graph (complete) has 42420 edges and 30933 vertex of which 30725 are kept as prefixes of interest. Removing 208 places using SCC suffix rule.84 ms
Discarding 208 places :
Also discarding 107 output transitions
Drop transitions removed 107 transitions
Discarding 1212 places :
Implicit places reduction removed 1212 places
Drop transitions removed 15554 transitions
Trivial Post-agglo rules discarded 15554 transitions
Performed 15554 trivial Post agglomeration. Transition count delta: 15554
Iterating post reduction 0 with 16766 rules applied. Total rules applied 16767 place count 29513 transition count 15453
Reduce places removed 15554 places and 0 transitions.
Performed 1313 Post agglomeration using F-continuation condition.Transition count delta: 1313
Iterating post reduction 1 with 16867 rules applied. Total rules applied 33634 place count 13959 transition count 14140
Reduce places removed 1313 places and 0 transitions.
Iterating post reduction 2 with 1313 rules applied. Total rules applied 34947 place count 12646 transition count 14140
Performed 2626 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2626 Pre rules applied. Total rules applied 34947 place count 12646 transition count 11514
Deduced a syphon composed of 2626 places in 7 ms
Ensure Unique test removed 909 places
Reduce places removed 3535 places and 0 transitions.
Iterating global reduction 3 with 6161 rules applied. Total rules applied 41108 place count 9111 transition count 11514
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 3 with 101 rules applied. Total rules applied 41209 place count 9010 transition count 11514
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 41209 place count 9010 transition count 11413
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 41411 place count 8909 transition count 11413
Discarding 2525 places :
Symmetric choice reduction at 4 with 2525 rule applications. Total rules 43936 place count 6384 transition count 8888
Iterating global reduction 4 with 2525 rules applied. Total rules applied 46461 place count 6384 transition count 8888
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 4 with 101 rules applied. Total rules applied 46562 place count 6384 transition count 8787
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 5 with 101 rules applied. Total rules applied 46663 place count 6283 transition count 8787
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 46663 place count 6283 transition count 8686
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 46865 place count 6182 transition count 8686
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 46870 place count 6177 transition count 8181
Iterating global reduction 6 with 5 rules applied. Total rules applied 46875 place count 6177 transition count 8181
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 6 with 101 rules applied. Total rules applied 46976 place count 6076 transition count 8181
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 46976 place count 6076 transition count 8080
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 47178 place count 5975 transition count 8080
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 3 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 7 with 606 rules applied. Total rules applied 47784 place count 5672 transition count 7777
Free-agglomeration rule (complex) applied 101 times.
Iterating global reduction 7 with 101 rules applied. Total rules applied 47885 place count 5672 transition count 7676
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 47986 place count 5571 transition count 7676
Applied a total of 47986 rules in 6510 ms. Remains 5571 /30933 variables (removed 25362) and now considering 7676/31114 (removed 23438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6511 ms. Remains : 5571/30933 places, 7676/31114 transitions.
Finished random walk after 7379 steps, including 5 resets, run visited all 7 properties in 437 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 30933 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30933 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 202 out of 30933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Graph (complete) has 42420 edges and 30933 vertex of which 30421 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.86 ms
Discarding 512 places :
Also discarding 309 output transitions
Drop transitions removed 309 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Drop transitions removed 18887 transitions
Trivial Post-agglo rules discarded 18887 transitions
Performed 18887 trivial Post agglomeration. Transition count delta: 18887
Iterating post reduction 0 with 20099 rules applied. Total rules applied 20100 place count 29108 transition count 11817
Reduce places removed 18887 places and 0 transitions.
Iterating post reduction 1 with 18887 rules applied. Total rules applied 38987 place count 10221 transition count 11817
Performed 1919 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1919 Pre rules applied. Total rules applied 38987 place count 10221 transition count 9898
Deduced a syphon composed of 1919 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 2 with 4747 rules applied. Total rules applied 43734 place count 7393 transition count 9898
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 44441 place count 7393 transition count 9191
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 45148 place count 6686 transition count 9191
Discarding 3030 places :
Symmetric choice reduction at 4 with 3030 rule applications. Total rules 48178 place count 3656 transition count 6161
Iterating global reduction 4 with 3030 rules applied. Total rules applied 51208 place count 3656 transition count 6161
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 4 with 303 rules applied. Total rules applied 51511 place count 3656 transition count 5858
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 5 with 303 rules applied. Total rules applied 51814 place count 3353 transition count 5858
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 51829 place count 3338 transition count 4343
Iterating global reduction 6 with 15 rules applied. Total rules applied 51844 place count 3338 transition count 4343
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 6 with 1111 rules applied. Total rules applied 52955 place count 3035 transition count 3535
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 7 with 303 rules applied. Total rules applied 53258 place count 2732 transition count 3535
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 53258 place count 2732 transition count 3333
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 53662 place count 2530 transition count 3333
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 54672 place count 1520 transition count 2323
Iterating global reduction 8 with 1010 rules applied. Total rules applied 55682 place count 1520 transition count 2323
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 56692 place count 1520 transition count 1313
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 56692 place count 1520 transition count 1212
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 56995 place count 1318 transition count 1212
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 404 rules applied. Total rules applied 57399 place count 1116 transition count 1010
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 57500 place count 1015 transition count 909
Applied a total of 57500 rules in 3056 ms. Remains 1015 /30933 variables (removed 29918) and now considering 909/31114 (removed 30205) transitions.
// Phase 1: matrix 909 rows 1015 cols
[2024-05-24 23:27:04] [INFO ] Computed 207 invariants in 18 ms
[2024-05-24 23:27:05] [INFO ] Implicit Places using invariants in 1155 ms returned [101, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 406, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 912, 1014]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 1163 ms to find 206 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 809/30933 places, 909/31114 transitions.
Reduce places removed 101 places and 101 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 708 transition count 606
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 404 place count 506 transition count 606
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 404 place count 506 transition count 505
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 606 place count 405 transition count 505
Applied a total of 606 rules in 38 ms. Remains 405 /809 variables (removed 404) and now considering 505/909 (removed 404) transitions.
// Phase 1: matrix 505 rows 405 cols
[2024-05-24 23:27:05] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 23:27:05] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-24 23:27:05] [INFO ] Invariant cache hit.
[2024-05-24 23:27:06] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/30933 places, 505/31114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4779 ms. Remains : 405/30933 places, 505/31114 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-01 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:(GT 1 (ADD s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10750 reset in 1274 ms.
Product exploration explored 100000 steps with 10735 reset in 1151 ms.
Computed a total of 405 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 405 transition count 505
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-01 finished in 7727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 303 out of 30933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Reduce places removed 102 places and 0 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Iterating post reduction 0 with 1314 rules applied. Total rules applied 1314 place count 29619 transition count 31114
Applied a total of 1314 rules in 279 ms. Remains 29619 /30933 variables (removed 1314) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29619 cols
[2024-05-24 23:27:10] [INFO ] Computed 1520 invariants in 1370 ms
[2024-05-24 23:27:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:27:14] [INFO ] Implicit Places using invariants in 5105 ms returned []
Implicit Place search using SMT only with invariants took 5107 ms to find 0 implicit places.
[2024-05-24 23:27:14] [INFO ] Invariant cache hit.
[2024-05-24 23:27:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:27:18] [INFO ] Dead Transitions using invariants and state equation in 3677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29619/30933 places, 31114/31114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9066 ms. Remains : 29619/30933 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s22133 s22134 s22135 s22136 s22137 s22138 s22139 s22140 s22141 s22142 s22143 s22144 s22145 s22146 s22147 s22148 s22149 s22150 s22151 s22152 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 73 reset in 2965 ms.
Product exploration explored 100000 steps with 73 reset in 3168 ms.
Computed a total of 29619 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29619 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1365 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-24 23:28:01] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 303 out of 29619 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Graph (complete) has 39693 edges and 29619 vertex of which 29613 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.73 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 101 places and 101 transitions.
Drop transitions removed 18584 transitions
Trivial Post-agglo rules discarded 18584 transitions
Performed 18584 trivial Post agglomeration. Transition count delta: 18584
Iterating post reduction 0 with 18584 rules applied. Total rules applied 18585 place count 29512 transition count 12423
Reduce places removed 18584 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 18685 rules applied. Total rules applied 37270 place count 10928 transition count 12322
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 37371 place count 10827 transition count 12322
Performed 2020 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2020 Pre rules applied. Total rules applied 37371 place count 10827 transition count 10302
Deduced a syphon composed of 2020 places in 8 ms
Ensure Unique test removed 909 places
Reduce places removed 2929 places and 0 transitions.
Iterating global reduction 3 with 4949 rules applied. Total rules applied 42320 place count 7898 transition count 10302
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 707 rules applied. Total rules applied 43027 place count 7898 transition count 9595
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 43734 place count 7191 transition count 9595
Discarding 3030 places :
Symmetric choice reduction at 5 with 3030 rule applications. Total rules 46764 place count 4161 transition count 6565
Iterating global reduction 5 with 3030 rules applied. Total rules applied 49794 place count 4161 transition count 6565
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 5 with 202 rules applied. Total rules applied 49996 place count 4161 transition count 6363
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 6 with 202 rules applied. Total rules applied 50198 place count 3959 transition count 6363
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 50198 place count 3959 transition count 6262
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 50400 place count 3858 transition count 6262
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 50415 place count 3843 transition count 4747
Iterating global reduction 7 with 15 rules applied. Total rules applied 50430 place count 3843 transition count 4747
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 909 rules applied. Total rules applied 51339 place count 3540 transition count 4141
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 8 with 202 rules applied. Total rules applied 51541 place count 3439 transition count 4040
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 51642 place count 3338 transition count 4040
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 202 Pre rules applied. Total rules applied 51642 place count 3338 transition count 3838
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 404 rules applied. Total rules applied 52046 place count 3136 transition count 3838
Discarding 1010 places :
Symmetric choice reduction at 10 with 1010 rule applications. Total rules 53056 place count 2126 transition count 2828
Iterating global reduction 10 with 1010 rules applied. Total rules applied 54066 place count 2126 transition count 2828
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 10 with 1010 rules applied. Total rules applied 55076 place count 2126 transition count 1818
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 101 Pre rules applied. Total rules applied 55076 place count 2126 transition count 1717
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 11 with 303 rules applied. Total rules applied 55379 place count 1924 transition count 1717
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 0 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 11 with 606 rules applied. Total rules applied 55985 place count 1621 transition count 1414
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 11 with 101 rules applied. Total rules applied 56086 place count 1520 transition count 1313
Applied a total of 56086 rules in 3719 ms. Remains 1520 /29619 variables (removed 28099) and now considering 1313/31114 (removed 29801) transitions.
// Phase 1: matrix 1313 rows 1520 cols
[2024-05-24 23:28:20] [INFO ] Computed 207 invariants in 23 ms
[2024-05-24 23:28:21] [INFO ] Implicit Places using invariants in 1288 ms returned [101, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 406, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 1013, 1519]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 1294 ms to find 206 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1314/29619 places, 1313/31114 transitions.
Reduce places removed 101 places and 101 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 303 rules applied. Total rules applied 303 place count 1213 transition count 909
Reduce places removed 303 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 404 rules applied. Total rules applied 707 place count 910 transition count 808
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 808 place count 809 transition count 808
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 1010 place count 708 transition count 707
Applied a total of 1010 rules in 37 ms. Remains 708 /1314 variables (removed 606) and now considering 707/1313 (removed 606) transitions.
// Phase 1: matrix 707 rows 708 cols
[2024-05-24 23:28:21] [INFO ] Computed 1 invariants in 4 ms
[2024-05-24 23:28:21] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-24 23:28:21] [INFO ] Invariant cache hit.
[2024-05-24 23:28:22] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 708/29619 places, 707/31114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5789 ms. Remains : 708/29619 places, 707/31114 transitions.
Computed a total of 708 stabilizing places and 707 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 708 transition count 707
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-02 finished in 73458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 202 out of 30933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Graph (complete) has 42420 edges and 30933 vertex of which 29409 are kept as prefixes of interest. Removing 1524 places using SCC suffix rule.34 ms
Discarding 1524 places :
Also discarding 1319 output transitions
Drop transitions removed 1319 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Drop transitions removed 17372 transitions
Trivial Post-agglo rules discarded 17372 transitions
Performed 17372 trivial Post agglomeration. Transition count delta: 17372
Iterating post reduction 0 with 18584 rules applied. Total rules applied 18585 place count 28096 transition count 12322
Reduce places removed 17372 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 18483 rules applied. Total rules applied 37068 place count 10724 transition count 11211
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 38179 place count 9613 transition count 11211
Performed 1919 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1919 Pre rules applied. Total rules applied 38179 place count 9613 transition count 9292
Deduced a syphon composed of 1919 places in 4 ms
Ensure Unique test removed 909 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4747 rules applied. Total rules applied 42926 place count 6785 transition count 9292
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 808 rules applied. Total rules applied 43734 place count 6684 transition count 8585
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 44441 place count 5977 transition count 8585
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 44441 place count 5977 transition count 8484
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 44643 place count 5876 transition count 8484
Discarding 3030 places :
Symmetric choice reduction at 5 with 3030 rule applications. Total rules 47673 place count 2846 transition count 5454
Iterating global reduction 5 with 3030 rules applied. Total rules applied 50703 place count 2846 transition count 5454
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 5 with 303 rules applied. Total rules applied 51006 place count 2846 transition count 5151
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 6 with 303 rules applied. Total rules applied 51309 place count 2543 transition count 5151
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 51324 place count 2528 transition count 3636
Iterating global reduction 7 with 15 rules applied. Total rules applied 51339 place count 2528 transition count 3636
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 7 with 1010 rules applied. Total rules applied 52349 place count 2225 transition count 2929
Reduce places removed 202 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 8 with 303 rules applied. Total rules applied 52652 place count 2023 transition count 2828
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 52753 place count 1922 transition count 2828
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 101 Pre rules applied. Total rules applied 52753 place count 1922 transition count 2727
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 52955 place count 1821 transition count 2727
Discarding 1010 places :
Symmetric choice reduction at 10 with 1010 rule applications. Total rules 53965 place count 811 transition count 1717
Iterating global reduction 10 with 1010 rules applied. Total rules applied 54975 place count 811 transition count 1717
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 10 with 1010 rules applied. Total rules applied 55985 place count 811 transition count 707
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 101 Pre rules applied. Total rules applied 55985 place count 811 transition count 606
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 11 with 303 rules applied. Total rules applied 56288 place count 609 transition count 606
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 11 with 101 rules applied. Total rules applied 56389 place count 508 transition count 505
Applied a total of 56389 rules in 2553 ms. Remains 508 /30933 variables (removed 30425) and now considering 505/31114 (removed 30609) transitions.
// Phase 1: matrix 505 rows 508 cols
[2024-05-24 23:28:25] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 23:28:25] [INFO ] Implicit Places using invariants in 378 ms returned [101, 405, 507]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 379 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 505/30933 places, 505/31114 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 505 transition count 404
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 404 transition count 404
Applied a total of 202 rules in 8 ms. Remains 404 /505 variables (removed 101) and now considering 404/505 (removed 101) transitions.
// Phase 1: matrix 404 rows 404 cols
[2024-05-24 23:28:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 23:28:25] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 23:28:25] [INFO ] Invariant cache hit.
[2024-05-24 23:28:25] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/30933 places, 404/31114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3234 ms. Remains : 404/30933 places, 404/31114 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-03 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:(LEQ 2 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128...], 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 404 steps with 0 reset in 6 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-03 finished in 3402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(p1&&X(p0)))))'
Support contains 208 out of 30933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Reduce places removed 102 places and 0 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Iterating post reduction 0 with 1314 rules applied. Total rules applied 1314 place count 29619 transition count 31114
Applied a total of 1314 rules in 224 ms. Remains 29619 /30933 variables (removed 1314) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29619 cols
[2024-05-24 23:28:27] [INFO ] Computed 1621 invariants in 1217 ms
[2024-05-24 23:28:31] [INFO ] Implicit Places using invariants in 4857 ms returned []
Implicit Place search using SMT only with invariants took 4858 ms to find 0 implicit places.
[2024-05-24 23:28:31] [INFO ] Invariant cache hit.
[2024-05-24 23:28:34] [INFO ] Dead Transitions using invariants and state equation in 3636 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29619/30933 places, 31114/31114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8722 ms. Remains : 29619/30933 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s19608 s19609 s19610 s19611 s19612 s19613 s19614 s19615 s19616 s19617 s19618 s19619 s19620 s19621 s19622 s19623 s19624 s19625 s19626 s19627 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 50740 steps with 16965 reset in 10003 ms.
Product exploration timeout after 49580 steps with 16515 reset in 10002 ms.
Computed a total of 29619 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29619 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 209 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 23:29:32] [INFO ] Invariant cache hit.
[2024-05-24 23:29:39] [INFO ] [Real]Absence check using 203 positive place invariants in 504 ms returned sat
[2024-05-24 23:29:40] [INFO ] [Real]Absence check using 203 positive and 1418 generalized place invariants in 1860 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 23:29:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 23:29:57] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 208 out of 29619 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Graph (complete) has 39794 edges and 29619 vertex of which 29518 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.13 ms
Discarding 101 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Drop transitions removed 17372 transitions
Trivial Post-agglo rules discarded 17372 transitions
Performed 17372 trivial Post agglomeration. Transition count delta: 17372
Iterating post reduction 0 with 17372 rules applied. Total rules applied 17373 place count 29518 transition count 13641
Reduce places removed 17372 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 17473 rules applied. Total rules applied 34846 place count 12146 transition count 13540
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 34947 place count 12045 transition count 13540
Performed 2626 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2626 Pre rules applied. Total rules applied 34947 place count 12045 transition count 10914
Deduced a syphon composed of 2626 places in 6 ms
Ensure Unique test removed 909 places
Reduce places removed 3535 places and 0 transitions.
Iterating global reduction 3 with 6161 rules applied. Total rules applied 41108 place count 8510 transition count 10914
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 3 with 101 rules applied. Total rules applied 41209 place count 8510 transition count 10813
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 41310 place count 8409 transition count 10813
Discarding 3131 places :
Symmetric choice reduction at 5 with 3131 rule applications. Total rules 44441 place count 5278 transition count 7682
Iterating global reduction 5 with 3131 rules applied. Total rules applied 47572 place count 5278 transition count 7682
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 5 with 202 rules applied. Total rules applied 47774 place count 5278 transition count 7480
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 6 with 202 rules applied. Total rules applied 47976 place count 5076 transition count 7480
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 47976 place count 5076 transition count 7379
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 48178 place count 4975 transition count 7379
Discarding 116 places :
Symmetric choice reduction at 7 with 116 rule applications. Total rules 48294 place count 4859 transition count 5763
Iterating global reduction 7 with 116 rules applied. Total rules applied 48410 place count 4859 transition count 5763
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 7 with 707 rules applied. Total rules applied 49117 place count 4556 transition count 5359
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 8 with 303 rules applied. Total rules applied 49420 place count 4253 transition count 5359
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 303 Pre rules applied. Total rules applied 49420 place count 4253 transition count 5056
Deduced a syphon composed of 303 places in 2 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 9 with 606 rules applied. Total rules applied 50026 place count 3950 transition count 5056
Discarding 1515 places :
Symmetric choice reduction at 9 with 1515 rule applications. Total rules 51541 place count 2435 transition count 3541
Iterating global reduction 9 with 1515 rules applied. Total rules applied 53056 place count 2435 transition count 3541
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 9 with 1313 rules applied. Total rules applied 54369 place count 2334 transition count 2329
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 10 with 202 rules applied. Total rules applied 54571 place count 2132 transition count 2329
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 0 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 11 with 606 rules applied. Total rules applied 55177 place count 1829 transition count 2026
Free-agglomeration rule (complex) applied 303 times.
Iterating global reduction 11 with 303 rules applied. Total rules applied 55480 place count 1829 transition count 1723
Ensure Unique test removed 101 places
Reduce places removed 404 places and 0 transitions.
Iterating post reduction 11 with 404 rules applied. Total rules applied 55884 place count 1425 transition count 1723
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 12 with 101 rules applied. Total rules applied 55985 place count 1324 transition count 1622
Applied a total of 55985 rules in 4276 ms. Remains 1324 /29619 variables (removed 28295) and now considering 1622/31114 (removed 29492) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4276 ms. Remains : 1324/29619 places, 1622/31114 transitions.
Finished random walk after 527 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 380 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Support contains 208 out of 29619 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Applied a total of 0 rules in 148 ms. Remains 29619 /29619 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
[2024-05-24 23:30:02] [INFO ] Invariant cache hit.
[2024-05-24 23:30:05] [INFO ] Implicit Places using invariants in 3593 ms returned []
Implicit Place search using SMT only with invariants took 3596 ms to find 0 implicit places.
[2024-05-24 23:30:05] [INFO ] Invariant cache hit.
[2024-05-24 23:30:09] [INFO ] Dead Transitions using invariants and state equation in 3662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7409 ms. Remains : 29619/29619 places, 31114/31114 transitions.
Computed a total of 29619 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29619 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 197 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 23:30:46] [INFO ] Invariant cache hit.
[2024-05-24 23:30:54] [INFO ] [Real]Absence check using 203 positive place invariants in 780 ms returned sat
[2024-05-24 23:30:56] [INFO ] [Real]Absence check using 203 positive and 1418 generalized place invariants in 2708 ms returned sat
[2024-05-24 23:31:11] [INFO ] After 13374ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 23:31:11] [INFO ] After 13390ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 23:31:11] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 208 out of 29619 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Graph (complete) has 39794 edges and 29619 vertex of which 29518 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.14 ms
Discarding 101 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Drop transitions removed 17372 transitions
Trivial Post-agglo rules discarded 17372 transitions
Performed 17372 trivial Post agglomeration. Transition count delta: 17372
Iterating post reduction 0 with 17372 rules applied. Total rules applied 17373 place count 29518 transition count 13641
Reduce places removed 17372 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 17473 rules applied. Total rules applied 34846 place count 12146 transition count 13540
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 34947 place count 12045 transition count 13540
Performed 2626 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2626 Pre rules applied. Total rules applied 34947 place count 12045 transition count 10914
Deduced a syphon composed of 2626 places in 6 ms
Ensure Unique test removed 909 places
Reduce places removed 3535 places and 0 transitions.
Iterating global reduction 3 with 6161 rules applied. Total rules applied 41108 place count 8510 transition count 10914
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 3 with 101 rules applied. Total rules applied 41209 place count 8510 transition count 10813
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 41310 place count 8409 transition count 10813
Discarding 3131 places :
Symmetric choice reduction at 5 with 3131 rule applications. Total rules 44441 place count 5278 transition count 7682
Iterating global reduction 5 with 3131 rules applied. Total rules applied 47572 place count 5278 transition count 7682
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 5 with 202 rules applied. Total rules applied 47774 place count 5278 transition count 7480
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 6 with 202 rules applied. Total rules applied 47976 place count 5076 transition count 7480
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 47976 place count 5076 transition count 7379
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 48178 place count 4975 transition count 7379
Discarding 116 places :
Symmetric choice reduction at 7 with 116 rule applications. Total rules 48294 place count 4859 transition count 5763
Iterating global reduction 7 with 116 rules applied. Total rules applied 48410 place count 4859 transition count 5763
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 7 with 707 rules applied. Total rules applied 49117 place count 4556 transition count 5359
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 8 with 303 rules applied. Total rules applied 49420 place count 4253 transition count 5359
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 303 Pre rules applied. Total rules applied 49420 place count 4253 transition count 5056
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 9 with 606 rules applied. Total rules applied 50026 place count 3950 transition count 5056
Discarding 1515 places :
Symmetric choice reduction at 9 with 1515 rule applications. Total rules 51541 place count 2435 transition count 3541
Iterating global reduction 9 with 1515 rules applied. Total rules applied 53056 place count 2435 transition count 3541
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 9 with 1313 rules applied. Total rules applied 54369 place count 2334 transition count 2329
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 10 with 202 rules applied. Total rules applied 54571 place count 2132 transition count 2329
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 11 with 606 rules applied. Total rules applied 55177 place count 1829 transition count 2026
Free-agglomeration rule (complex) applied 303 times.
Iterating global reduction 11 with 303 rules applied. Total rules applied 55480 place count 1829 transition count 1723
Ensure Unique test removed 101 places
Reduce places removed 404 places and 0 transitions.
Iterating post reduction 11 with 404 rules applied. Total rules applied 55884 place count 1425 transition count 1723
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 12 with 101 rules applied. Total rules applied 55985 place count 1324 transition count 1622
Applied a total of 55985 rules in 4292 ms. Remains 1324 /29619 variables (removed 28295) and now considering 1622/31114 (removed 29492) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4293 ms. Remains : 1324/29619 places, 1622/31114 transitions.
Finished random walk after 520 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 434 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), true]
Product exploration timeout after 49880 steps with 16661 reset in 10001 ms.
Product exploration timeout after 51860 steps with 17299 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Support contains 208 out of 29619 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Graph (complete) has 39794 edges and 29619 vertex of which 29518 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.31 ms
Discarding 101 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Performed 10504 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10504 rules applied. Total rules applied 10505 place count 29518 transition count 31013
Performed 7474 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7474 Pre rules applied. Total rules applied 10505 place count 29518 transition count 31720
Deduced a syphon composed of 17978 places in 25 ms
Iterating global reduction 1 with 7474 rules applied. Total rules applied 17979 place count 29518 transition count 31720
Performed 3737 Post agglomeration using F-continuation condition.Transition count delta: -1111
Deduced a syphon composed of 21715 places in 17 ms
Iterating global reduction 1 with 3737 rules applied. Total rules applied 21716 place count 29518 transition count 32831
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2020
Deduced a syphon composed of 21816 places in 19 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 21817 place count 29518 transition count 34851
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 22019 place count 29316 transition count 33639
Deduced a syphon composed of 21614 places in 19 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 22221 place count 29316 transition count 33639
Deduced a syphon composed of 21614 places in 11 ms
Applied a total of 22221 rules in 19259 ms. Remains 29316 /29619 variables (removed 303) and now considering 33639/31114 (removed -2525) transitions.
// Phase 1: matrix 33639 rows 29316 cols
[2024-05-24 23:32:01] [INFO ] Computed 1621 invariants in 5254 ms
[2024-05-24 23:32:05] [INFO ] Dead Transitions using invariants and state equation in 8615 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29316/29619 places, 33639/31114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27880 ms. Remains : 29316/29619 places, 33639/31114 transitions.
Built C files in :
/tmp/ltsmin2417991559412315575
[2024-05-24 23:32:05] [INFO ] Built C files in 550ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2417991559412315575
Running compilation step : cd /tmp/ltsmin2417991559412315575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2417991559412315575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2417991559412315575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 208 out of 29619 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Applied a total of 0 rules in 225 ms. Remains 29619 /29619 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29619 cols
[2024-05-24 23:32:10] [INFO ] Computed 1621 invariants in 1345 ms
[2024-05-24 23:32:14] [INFO ] Implicit Places using invariants in 5254 ms returned []
Implicit Place search using SMT only with invariants took 5255 ms to find 0 implicit places.
[2024-05-24 23:32:14] [INFO ] Invariant cache hit.
[2024-05-24 23:32:17] [INFO ] Dead Transitions using invariants and state equation in 3753 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9236 ms. Remains : 29619/29619 places, 31114/31114 transitions.
Built C files in :
/tmp/ltsmin2173142308218190684
[2024-05-24 23:32:18] [INFO ] Built C files in 365ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2173142308218190684
Running compilation step : cd /tmp/ltsmin2173142308218190684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2173142308218190684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2173142308218190684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 23:32:23] [INFO ] Flatten gal took : 1075 ms
[2024-05-24 23:32:24] [INFO ] Flatten gal took : 1132 ms
[2024-05-24 23:32:25] [INFO ] Time to serialize gal into /tmp/LTL6668541647494033974.gal : 216 ms
[2024-05-24 23:32:25] [INFO ] Time to serialize properties into /tmp/LTL281516246877616276.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6668541647494033974.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10593282055135946931.hoa' '-atoms' '/tmp/LTL281516246877616276.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL281516246877616276.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10593282055135946931.hoa
Detected timeout of ITS tools.
[2024-05-24 23:32:41] [INFO ] Flatten gal took : 846 ms
[2024-05-24 23:32:42] [INFO ] Flatten gal took : 744 ms
[2024-05-24 23:32:42] [INFO ] Time to serialize gal into /tmp/LTL10665210133668212715.gal : 152 ms
[2024-05-24 23:32:42] [INFO ] Time to serialize properties into /tmp/LTL8917010572002059177.ltl : 4 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10665210133668212715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8917010572002059177.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("((((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l3...3705
Formula 0 simplified : X!"((((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l38_...3694
Detected timeout of ITS tools.
[2024-05-24 23:32:58] [INFO ] Flatten gal took : 858 ms
[2024-05-24 23:32:58] [INFO ] Applying decomposition
[2024-05-24 23:32:59] [INFO ] Flatten gal took : 817 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17990372752117029360.txt' '-o' '/tmp/graph17990372752117029360.bin' '-w' '/tmp/graph17990372752117029360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17990372752117029360.bin' '-l' '-1' '-v' '-w' '/tmp/graph17990372752117029360.weights' '-q' '0' '-e' '0.001'
[2024-05-24 23:33:02] [INFO ] Decomposing Gal with order
[2024-05-24 23:33:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 23:38:06] [INFO ] Removed a total of 9367 redundant transitions.
[2024-05-24 23:38:06] [INFO ] Flatten gal took : 2280 ms
[2024-05-24 23:38:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 3223 labels/synchronizations in 955 ms.
[2024-05-24 23:38:17] [INFO ] Time to serialize gal into /tmp/LTL16424100814287012846.gal : 539 ms
[2024-05-24 23:38:17] [INFO ] Time to serialize properties into /tmp/LTL9917595130068776861.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16424100814287012846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9917595130068776861.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12194849659013876796
[2024-05-24 23:38:33] [INFO ] Built C files in 373ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12194849659013876796
Running compilation step : cd /tmp/ltsmin12194849659013876796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12194849659013876796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12194849659013876796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-05 finished in 610124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||X((G(p1)&&X(G(p2))))))))'
Support contains 1326 out of 30933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Reduce places removed 202 places and 0 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Iterating post reduction 0 with 1414 rules applied. Total rules applied 1414 place count 29519 transition count 31114
Applied a total of 1414 rules in 322 ms. Remains 29519 /30933 variables (removed 1414) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29519 cols
[2024-05-24 23:38:38] [INFO ] Computed 1521 invariants in 1746 ms
[2024-05-24 23:38:42] [INFO ] Implicit Places using invariants in 5633 ms returned []
Implicit Place search using SMT only with invariants took 5635 ms to find 0 implicit places.
[2024-05-24 23:38:42] [INFO ] Invariant cache hit.
[2024-05-24 23:38:45] [INFO ] Dead Transitions using invariants and state equation in 3875 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29519/30933 places, 31114/31114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9840 ms. Remains : 29519/30933 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s18386 s18387 s18388 s18389 s18390 s18391 s18392 s18393 s18394 s18395 s18396) (ADD s16366 s16367 s16368 s16369 s16370 s16371 s16372 s16373 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 123 reset in 4940 ms.
Product exploration explored 100000 steps with 120 reset in 5301 ms.
Computed a total of 29519 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29519 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 23:39:37] [INFO ] Invariant cache hit.
[2024-05-24 23:39:42] [INFO ] After 5587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 23:39:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 391 ms returned sat
[2024-05-24 23:39:51] [INFO ] [Nat]Absence check using 2 positive and 1519 generalized place invariants in 2851 ms returned sat
[2024-05-24 23:40:07] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1326 out of 29519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29519/29519 places, 31114/31114 transitions.
Graph (complete) has 39693 edges and 29519 vertex of which 28401 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.19 ms
Discarding 1118 places :
Also discarding 1117 output transitions
Drop transitions removed 1117 transitions
Drop transitions removed 16059 transitions
Trivial Post-agglo rules discarded 16059 transitions
Performed 16059 trivial Post agglomeration. Transition count delta: 16059
Iterating post reduction 0 with 16059 rules applied. Total rules applied 16060 place count 28401 transition count 13938
Reduce places removed 16059 places and 0 transitions.
Performed 1212 Post agglomeration using F-continuation condition.Transition count delta: 1212
Iterating post reduction 1 with 17271 rules applied. Total rules applied 33331 place count 12342 transition count 12726
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 2 with 1212 rules applied. Total rules applied 34543 place count 11130 transition count 12726
Performed 1919 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1919 Pre rules applied. Total rules applied 34543 place count 11130 transition count 10807
Deduced a syphon composed of 1919 places in 6 ms
Ensure Unique test removed 909 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4747 rules applied. Total rules applied 39290 place count 8302 transition count 10807
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 808 rules applied. Total rules applied 40098 place count 8201 transition count 10100
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 40805 place count 7494 transition count 10100
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 40805 place count 7494 transition count 9999
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 41007 place count 7393 transition count 9999
Discarding 2120 places :
Symmetric choice reduction at 5 with 2120 rule applications. Total rules 43127 place count 5273 transition count 7879
Iterating global reduction 5 with 2120 rules applied. Total rules applied 45247 place count 5273 transition count 7879
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 101 rules applied. Total rules applied 45348 place count 5273 transition count 7778
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 45449 place count 5172 transition count 7778
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 45449 place count 5172 transition count 7677
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 45651 place count 5071 transition count 7677
Discarding 105 places :
Symmetric choice reduction at 7 with 105 rule applications. Total rules 45756 place count 4966 transition count 7072
Iterating global reduction 7 with 105 rules applied. Total rules applied 45861 place count 4966 transition count 7072
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 808 rules applied. Total rules applied 46669 place count 4764 transition count 6466
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 8 with 202 rules applied. Total rules applied 46871 place count 4663 transition count 6365
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 46972 place count 4562 transition count 6365
Discarding 100 places :
Symmetric choice reduction at 10 with 100 rule applications. Total rules 47072 place count 4462 transition count 6265
Ensure Unique test removed 1 places
Iterating global reduction 10 with 101 rules applied. Total rules applied 47173 place count 4461 transition count 6265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 47173 place count 4461 transition count 6264
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 47175 place count 4460 transition count 6264
Discarding 100 places :
Symmetric choice reduction at 10 with 100 rule applications. Total rules 47275 place count 4360 transition count 6164
Iterating global reduction 10 with 100 rules applied. Total rules applied 47375 place count 4360 transition count 6164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 47375 place count 4360 transition count 6163
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 47377 place count 4359 transition count 6163
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 404 rules applied. Total rules applied 47781 place count 4157 transition count 5961
Free-agglomeration rule (complex) applied 1111 times.
Iterating global reduction 10 with 1111 rules applied. Total rules applied 48892 place count 4157 transition count 4850
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 10 with 1111 rules applied. Total rules applied 50003 place count 3046 transition count 4850
Applied a total of 50003 rules in 5377 ms. Remains 3046 /29519 variables (removed 26473) and now considering 4850/31114 (removed 26264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5377 ms. Remains : 3046/29519 places, 4850/31114 transitions.
Finished random walk after 458 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1589 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1326 out of 29519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29519/29519 places, 31114/31114 transitions.
Applied a total of 0 rules in 240 ms. Remains 29519 /29519 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
[2024-05-24 23:40:15] [INFO ] Invariant cache hit.
[2024-05-24 23:40:19] [INFO ] Implicit Places using invariants in 3886 ms returned []
Implicit Place search using SMT only with invariants took 3887 ms to find 0 implicit places.
[2024-05-24 23:40:19] [INFO ] Invariant cache hit.
[2024-05-24 23:40:23] [INFO ] Dead Transitions using invariants and state equation in 3849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7977 ms. Remains : 29519/29519 places, 31114/31114 transitions.
Computed a total of 29519 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29519 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 523 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 989 ms. (steps per millisecond=10 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 23:41:02] [INFO ] Invariant cache hit.
[2024-05-24 23:41:08] [INFO ] After 5794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 23:41:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 318 ms returned sat
[2024-05-24 23:41:16] [INFO ] [Nat]Absence check using 2 positive and 1519 generalized place invariants in 1742 ms returned sat
[2024-05-24 23:41:33] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1326 out of 29519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29519/29519 places, 31114/31114 transitions.
Graph (complete) has 39693 edges and 29519 vertex of which 28401 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.13 ms
Discarding 1118 places :
Also discarding 1117 output transitions
Drop transitions removed 1117 transitions
Drop transitions removed 16059 transitions
Trivial Post-agglo rules discarded 16059 transitions
Performed 16059 trivial Post agglomeration. Transition count delta: 16059
Iterating post reduction 0 with 16059 rules applied. Total rules applied 16060 place count 28401 transition count 13938
Reduce places removed 16059 places and 0 transitions.
Performed 1212 Post agglomeration using F-continuation condition.Transition count delta: 1212
Iterating post reduction 1 with 17271 rules applied. Total rules applied 33331 place count 12342 transition count 12726
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 2 with 1212 rules applied. Total rules applied 34543 place count 11130 transition count 12726
Performed 1919 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1919 Pre rules applied. Total rules applied 34543 place count 11130 transition count 10807
Deduced a syphon composed of 1919 places in 6 ms
Ensure Unique test removed 909 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4747 rules applied. Total rules applied 39290 place count 8302 transition count 10807
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 808 rules applied. Total rules applied 40098 place count 8201 transition count 10100
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 40805 place count 7494 transition count 10100
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 40805 place count 7494 transition count 9999
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 41007 place count 7393 transition count 9999
Discarding 2120 places :
Symmetric choice reduction at 5 with 2120 rule applications. Total rules 43127 place count 5273 transition count 7879
Iterating global reduction 5 with 2120 rules applied. Total rules applied 45247 place count 5273 transition count 7879
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 101 rules applied. Total rules applied 45348 place count 5273 transition count 7778
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 45449 place count 5172 transition count 7778
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 45449 place count 5172 transition count 7677
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 45651 place count 5071 transition count 7677
Discarding 105 places :
Symmetric choice reduction at 7 with 105 rule applications. Total rules 45756 place count 4966 transition count 7072
Iterating global reduction 7 with 105 rules applied. Total rules applied 45861 place count 4966 transition count 7072
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 808 rules applied. Total rules applied 46669 place count 4764 transition count 6466
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 8 with 202 rules applied. Total rules applied 46871 place count 4663 transition count 6365
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 46972 place count 4562 transition count 6365
Discarding 100 places :
Symmetric choice reduction at 10 with 100 rule applications. Total rules 47072 place count 4462 transition count 6265
Ensure Unique test removed 1 places
Iterating global reduction 10 with 101 rules applied. Total rules applied 47173 place count 4461 transition count 6265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 47173 place count 4461 transition count 6264
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 47175 place count 4460 transition count 6264
Discarding 100 places :
Symmetric choice reduction at 10 with 100 rule applications. Total rules 47275 place count 4360 transition count 6164
Iterating global reduction 10 with 100 rules applied. Total rules applied 47375 place count 4360 transition count 6164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 47375 place count 4360 transition count 6163
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 47377 place count 4359 transition count 6163
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 404 rules applied. Total rules applied 47781 place count 4157 transition count 5961
Free-agglomeration rule (complex) applied 1111 times.
Iterating global reduction 10 with 1111 rules applied. Total rules applied 48892 place count 4157 transition count 4850
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 10 with 1111 rules applied. Total rules applied 50003 place count 3046 transition count 4850
Applied a total of 50003 rules in 5067 ms. Remains 3046 /29519 variables (removed 26473) and now considering 4850/31114 (removed 26264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5067 ms. Remains : 3046/29519 places, 4850/31114 transitions.
Finished random walk after 709 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1331 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 121 reset in 5344 ms.
Product exploration explored 100000 steps with 121 reset in 5171 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1326 out of 29519 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29519/29519 places, 31114/31114 transitions.
Graph (complete) has 39693 edges and 29519 vertex of which 28401 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.50 ms
Discarding 1118 places :
Also discarding 1117 output transitions
Drop transitions removed 1117 transitions
Performed 9696 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9696 rules applied. Total rules applied 9697 place count 28401 transition count 29997
Performed 8484 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8484 Pre rules applied. Total rules applied 9697 place count 28401 transition count 30704
Deduced a syphon composed of 18180 places in 23 ms
Iterating global reduction 1 with 8484 rules applied. Total rules applied 18181 place count 28401 transition count 30704
Performed 1313 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 19493 places in 17 ms
Iterating global reduction 1 with 1313 rules applied. Total rules applied 19494 place count 28401 transition count 31714
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 19594 places in 14 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 19595 place count 28401 transition count 34239
Discarding 303 places :
Symmetric choice reduction at 1 with 303 rule applications. Total rules 19898 place count 28098 transition count 32421
Deduced a syphon composed of 19291 places in 11 ms
Iterating global reduction 1 with 303 rules applied. Total rules applied 20201 place count 28098 transition count 32421
Deduced a syphon composed of 19291 places in 11 ms
Applied a total of 20201 rules in 15388 ms. Remains 28098 /29519 variables (removed 1421) and now considering 32421/31114 (removed -1307) transitions.
// Phase 1: matrix 32421 rows 28098 cols
[2024-05-24 23:42:11] [INFO ] Computed 1419 invariants in 4630 ms
[2024-05-24 23:42:15] [INFO ] Dead Transitions using invariants and state equation in 8265 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28098/29519 places, 32421/31114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23657 ms. Remains : 28098/29519 places, 32421/31114 transitions.
Built C files in :
/tmp/ltsmin16135509855327471652
[2024-05-24 23:42:15] [INFO ] Built C files in 219ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16135509855327471652
Running compilation step : cd /tmp/ltsmin16135509855327471652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16135509855327471652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16135509855327471652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1326 out of 29519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29519/29519 places, 31114/31114 transitions.
Applied a total of 0 rules in 151 ms. Remains 29519 /29519 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29519 cols
[2024-05-24 23:42:20] [INFO ] Computed 1521 invariants in 1542 ms
[2024-05-24 23:42:24] [INFO ] Implicit Places using invariants in 5209 ms returned []
Implicit Place search using SMT only with invariants took 5211 ms to find 0 implicit places.
[2024-05-24 23:42:24] [INFO ] Invariant cache hit.
[2024-05-24 23:42:27] [INFO ] Dead Transitions using invariants and state equation in 3517 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8885 ms. Remains : 29519/29519 places, 31114/31114 transitions.
Built C files in :
/tmp/ltsmin16422682678647779354
[2024-05-24 23:42:28] [INFO ] Built C files in 362ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16422682678647779354
Running compilation step : cd /tmp/ltsmin16422682678647779354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16422682678647779354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16422682678647779354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 23:42:32] [INFO ] Flatten gal took : 970 ms
[2024-05-24 23:42:33] [INFO ] Flatten gal took : 921 ms
[2024-05-24 23:42:33] [INFO ] Time to serialize gal into /tmp/LTL13731595741245319803.gal : 110 ms
[2024-05-24 23:42:33] [INFO ] Time to serialize properties into /tmp/LTL16010401131910765287.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13731595741245319803.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4996258149075237412.hoa' '-atoms' '/tmp/LTL16010401131910765287.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16010401131910765287.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4996258149075237412.hoa
Detected timeout of ITS tools.
[2024-05-24 23:42:50] [INFO ] Flatten gal took : 758 ms
[2024-05-24 23:42:51] [INFO ] Flatten gal took : 745 ms
[2024-05-24 23:42:51] [INFO ] Time to serialize gal into /tmp/LTL6849523002557169430.gal : 98 ms
[2024-05-24 23:42:51] [INFO ] Time to serialize properties into /tmp/LTL3601357950902520379.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6849523002557169430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3601357950902520379.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((m8_0+m8_1)+(m8_2+m8_3))+((m8_4+m8_5)+(m8_6+m8_7)))+((m8_8+m8_9)+m8_10))<=(((((((((((ml3_0+ml3_1)+(ml3_2+ml3_3))+((ml3_...13062
Formula 0 simplified : XF(G!"(((((m8_0+m8_1)+(m8_2+m8_3))+((m8_4+m8_5)+(m8_6+m8_7)))+((m8_8+m8_9)+m8_10))<=(((((((((((ml3_0+ml3_1)+(ml3_2+ml3_3))+((ml3_4+m...13046
Detected timeout of ITS tools.
[2024-05-24 23:43:07] [INFO ] Flatten gal took : 744 ms
[2024-05-24 23:43:07] [INFO ] Applying decomposition
[2024-05-24 23:43:07] [INFO ] Flatten gal took : 775 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph196310068596693576.txt' '-o' '/tmp/graph196310068596693576.bin' '-w' '/tmp/graph196310068596693576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph196310068596693576.bin' '-l' '-1' '-v' '-w' '/tmp/graph196310068596693576.weights' '-q' '0' '-e' '0.001'
[2024-05-24 23:43:12] [INFO ] Decomposing Gal with order
[2024-05-24 23:43:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 23:48:13] [INFO ] Removed a total of 9281 redundant transitions.
[2024-05-24 23:48:14] [INFO ] Flatten gal took : 5354 ms
[2024-05-24 23:48:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 3401 labels/synchronizations in 448 ms.
[2024-05-24 23:48:20] [INFO ] Time to serialize gal into /tmp/LTL16501742894864998818.gal : 187 ms
[2024-05-24 23:48:20] [INFO ] Time to serialize properties into /tmp/LTL16610991072344637901.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16501742894864998818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16610991072344637901.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((gu7133.m8_0+gu7133.m8_1)+(gu7133.m8_2+gu7133.m8_3))+((gu7133.m8_4+gu7133.m8_5)+(gu7133.m8_6+gu7133.m8_7)))+((gu7133.m8...26020
Formula 0 simplified : XF(G!"(((((gu7133.m8_0+gu7133.m8_1)+(gu7133.m8_2+gu7133.m8_3))+((gu7133.m8_4+gu7133.m8_5)+(gu7133.m8_6+gu7133.m8_7)))+((gu7133.m8_8+...26004
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18231240664737601899
[2024-05-24 23:48:35] [INFO ] Built C files in 310ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18231240664737601899
Running compilation step : cd /tmp/ltsmin18231240664737601899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18231240664737601899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18231240664737601899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07 finished in 602899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Support contains 1818 out of 30933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Reduce places removed 203 places and 0 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Iterating post reduction 0 with 1415 rules applied. Total rules applied 1415 place count 29518 transition count 31114
Applied a total of 1415 rules in 284 ms. Remains 29518 /30933 variables (removed 1415) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2024-05-24 23:48:41] [INFO ] Computed 1520 invariants in 1679 ms
[2024-05-24 23:48:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:48:44] [INFO ] Implicit Places using invariants in 5285 ms returned []
Implicit Place search using SMT only with invariants took 5286 ms to find 0 implicit places.
[2024-05-24 23:48:44] [INFO ] Invariant cache hit.
[2024-05-24 23:48:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:48:48] [INFO ] Dead Transitions using invariants and state equation in 3461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/30933 places, 31114/31114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9033 ms. Remains : 29518/30933 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 3 (ADD s25264 s25265 s25266 s25267 s25268 s25269 s25270 s25271 s25272 s25273 s25274 s25275 s25276 s25277 s25278 s25279 s25280 s25281 s25282 s25283...], 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 timeout after 49850 steps with 12452 reset in 10001 ms.
Product exploration timeout after 51860 steps with 13010 reset in 10004 ms.
Computed a total of 29518 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29518 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 2178 steps, including 0 resets, run visited all 3 properties in 335 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 451 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 1818 out of 29518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29518/29518 places, 31114/31114 transitions.
Applied a total of 0 rules in 240 ms. Remains 29518 /29518 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
[2024-05-24 23:49:51] [INFO ] Invariant cache hit.
[2024-05-24 23:49:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:49:55] [INFO ] Implicit Places using invariants in 3778 ms returned []
Implicit Place search using SMT only with invariants took 3779 ms to find 0 implicit places.
[2024-05-24 23:49:55] [INFO ] Invariant cache hit.
[2024-05-24 23:49:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:49:59] [INFO ] Dead Transitions using invariants and state equation in 3782 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7803 ms. Remains : 29518/29518 places, 31114/31114 transitions.
Computed a total of 29518 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29518 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 157 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 2153 steps, including 0 resets, run visited all 3 properties in 281 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 283 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration timeout after 52130 steps with 13016 reset in 10002 ms.
Product exploration timeout after 51500 steps with 12942 reset in 10002 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 1818 out of 29518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29518/29518 places, 31114/31114 transitions.
Graph (complete) has 39592 edges and 29518 vertex of which 23544 are kept as prefixes of interest. Removing 5974 places using SCC suffix rule.42 ms
Discarding 5974 places :
Also discarding 5864 output transitions
Drop transitions removed 5864 transitions
Performed 8787 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8787 rules applied. Total rules applied 8788 place count 23544 transition count 25250
Performed 6565 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6565 Pre rules applied. Total rules applied 8788 place count 23544 transition count 25250
Deduced a syphon composed of 15352 places in 13 ms
Iterating global reduction 1 with 6565 rules applied. Total rules applied 15353 place count 23544 transition count 25250
Performed 1212 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 16564 places in 9 ms
Iterating global reduction 1 with 1212 rules applied. Total rules applied 16565 place count 23544 transition count 26260
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 16665 places in 11 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 16666 place count 23544 transition count 27270
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 16767 place count 23443 transition count 26664
Deduced a syphon composed of 16564 places in 9 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 16868 place count 23443 transition count 26664
Deduced a syphon composed of 16564 places in 9 ms
Applied a total of 16868 rules in 9888 ms. Remains 23443 /29518 variables (removed 6075) and now considering 26664/31114 (removed 4450) transitions.
// Phase 1: matrix 26664 rows 23443 cols
[2024-05-24 23:51:13] [INFO ] Computed 809 invariants in 2178 ms
[2024-05-24 23:51:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:51:16] [INFO ] Dead Transitions using invariants and state equation in 5233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23443/29518 places, 26664/31114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15124 ms. Remains : 23443/29518 places, 26664/31114 transitions.
Built C files in :
/tmp/ltsmin2508810907351688239
[2024-05-24 23:51:16] [INFO ] Built C files in 216ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2508810907351688239
Running compilation step : cd /tmp/ltsmin2508810907351688239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2508810907351688239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2508810907351688239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1818 out of 29518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29518/29518 places, 31114/31114 transitions.
Applied a total of 0 rules in 157 ms. Remains 29518 /29518 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2024-05-24 23:51:21] [INFO ] Computed 1520 invariants in 1344 ms
[2024-05-24 23:51:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:51:25] [INFO ] Implicit Places using invariants in 4938 ms returned []
Implicit Place search using SMT only with invariants took 4939 ms to find 0 implicit places.
[2024-05-24 23:51:25] [INFO ] Invariant cache hit.
[2024-05-24 23:51:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:51:28] [INFO ] Dead Transitions using invariants and state equation in 3620 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8718 ms. Remains : 29518/29518 places, 31114/31114 transitions.
Built C files in :
/tmp/ltsmin18424295867811475559
[2024-05-24 23:51:28] [INFO ] Built C files in 214ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18424295867811475559
Running compilation step : cd /tmp/ltsmin18424295867811475559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18424295867811475559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18424295867811475559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 23:51:33] [INFO ] Flatten gal took : 793 ms
[2024-05-24 23:51:33] [INFO ] Flatten gal took : 750 ms
[2024-05-24 23:51:34] [INFO ] Time to serialize gal into /tmp/LTL12239906225167822663.gal : 150 ms
[2024-05-24 23:51:34] [INFO ] Time to serialize properties into /tmp/LTL4734350251318696218.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12239906225167822663.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15978412231127702166.hoa' '-atoms' '/tmp/LTL4734350251318696218.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4734350251318696218.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15978412231127702166.hoa
Detected timeout of ITS tools.
[2024-05-24 23:51:50] [INFO ] Flatten gal took : 724 ms
[2024-05-24 23:51:51] [INFO ] Flatten gal took : 750 ms
[2024-05-24 23:51:51] [INFO ] Time to serialize gal into /tmp/LTL10956233397848859446.gal : 127 ms
[2024-05-24 23:51:51] [INFO ] Time to serialize properties into /tmp/LTL12189895855593062520.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10956233397848859446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12189895855593062520.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((p4_0+p4_1)+(p4_2+p4_3))+((p4_4+p4_5)+(p4_6+p4_7)))+(((p4_8+p4_9)+(p4_10+p4_11))+((p4_12+p4_13)+(p4_14+p4_15))))+((((...16291
Formula 0 simplified : G!"(((((((((((p4_0+p4_1)+(p4_2+p4_3))+((p4_4+p4_5)+(p4_6+p4_7)))+(((p4_8+p4_9)+(p4_10+p4_11))+((p4_12+p4_13)+(p4_14+p4_15))))+((((p4...16280
Detected timeout of ITS tools.
[2024-05-24 23:52:07] [INFO ] Flatten gal took : 725 ms
[2024-05-24 23:52:07] [INFO ] Applying decomposition
[2024-05-24 23:52:07] [INFO ] Flatten gal took : 749 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15456771672847379030.txt' '-o' '/tmp/graph15456771672847379030.bin' '-w' '/tmp/graph15456771672847379030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15456771672847379030.bin' '-l' '-1' '-v' '-w' '/tmp/graph15456771672847379030.weights' '-q' '0' '-e' '0.001'
[2024-05-24 23:52:12] [INFO ] Decomposing Gal with order
[2024-05-24 23:52:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 23:56:47] [INFO ] Removed a total of 9259 redundant transitions.
[2024-05-24 23:56:48] [INFO ] Flatten gal took : 7459 ms
[2024-05-24 23:56:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 934 labels/synchronizations in 290 ms.
[2024-05-24 23:56:54] [INFO ] Time to serialize gal into /tmp/LTL427807571107131460.gal : 234 ms
[2024-05-24 23:56:54] [INFO ] Time to serialize properties into /tmp/LTL5158856701172252640.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL427807571107131460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5158856701172252640.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((gu9216.p4_0+gu9216.p4_1)+(gu9216.p4_2+gu9216.p4_3))+((gu9216.p4_4+gu9216.p4_5)+(gu9216.p4_6+gu9216.p4_7)))+(((gu9216...29017
Formula 0 simplified : G!"(((((((((((gu9216.p4_0+gu9216.p4_1)+(gu9216.p4_2+gu9216.p4_3))+((gu9216.p4_4+gu9216.p4_5)+(gu9216.p4_6+gu9216.p4_7)))+(((gu9216.p...29006
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13038545741117330596
[2024-05-24 23:57:10] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13038545741117330596
Running compilation step : cd /tmp/ltsmin13038545741117330596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13038545741117330596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13038545741117330596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-08 finished in 514171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1212 out of 30933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Graph (complete) has 42420 edges and 30933 vertex of which 28903 are kept as prefixes of interest. Removing 2030 places using SCC suffix rule.36 ms
Discarding 2030 places :
Also discarding 1723 output transitions
Drop transitions removed 1723 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Drop transitions removed 16160 transitions
Trivial Post-agglo rules discarded 16160 transitions
Performed 16160 trivial Post agglomeration. Transition count delta: 16160
Iterating post reduction 0 with 17372 rules applied. Total rules applied 17373 place count 27590 transition count 13130
Reduce places removed 16160 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 17271 rules applied. Total rules applied 34644 place count 11430 transition count 12019
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 35755 place count 10319 transition count 12019
Performed 1818 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1818 Pre rules applied. Total rules applied 35755 place count 10319 transition count 10201
Deduced a syphon composed of 1818 places in 4 ms
Ensure Unique test removed 909 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 3 with 4545 rules applied. Total rules applied 40300 place count 7592 transition count 10201
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 40906 place count 7592 transition count 9595
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 41512 place count 6986 transition count 9595
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 41512 place count 6986 transition count 9494
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 41714 place count 6885 transition count 9494
Discarding 3030 places :
Symmetric choice reduction at 5 with 3030 rule applications. Total rules 44744 place count 3855 transition count 6464
Iterating global reduction 5 with 3030 rules applied. Total rules applied 47774 place count 3855 transition count 6464
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 5 with 202 rules applied. Total rules applied 47976 place count 3855 transition count 6262
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 6 with 202 rules applied. Total rules applied 48178 place count 3653 transition count 6262
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 48178 place count 3653 transition count 6161
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 48380 place count 3552 transition count 6161
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 48385 place count 3547 transition count 5656
Iterating global reduction 7 with 5 rules applied. Total rules applied 48390 place count 3547 transition count 5656
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 808 rules applied. Total rules applied 49198 place count 3345 transition count 5050
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 49299 place count 3244 transition count 5050
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 49299 place count 3244 transition count 4949
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 49501 place count 3143 transition count 4949
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 49703 place count 3042 transition count 4848
Applied a total of 49703 rules in 3023 ms. Remains 3042 /30933 variables (removed 27891) and now considering 4848/31114 (removed 26266) transitions.
// Phase 1: matrix 4848 rows 3042 cols
[2024-05-24 23:57:16] [INFO ] Computed 204 invariants in 82 ms
[2024-05-24 23:57:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:18] [INFO ] Implicit Places using invariants in 2716 ms returned [1234, 1265, 1291, 2791, 2817]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2721 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3037/30933 places, 4848/31114 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 3037 transition count 4815
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 3004 transition count 4815
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 3002 transition count 4813
Applied a total of 70 rules in 416 ms. Remains 3002 /3037 variables (removed 35) and now considering 4813/4848 (removed 35) transitions.
// Phase 1: matrix 4813 rows 3002 cols
[2024-05-24 23:57:19] [INFO ] Computed 199 invariants in 132 ms
[2024-05-24 23:57:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:21] [INFO ] Implicit Places using invariants in 2502 ms returned [1207, 2716, 2742, 2762, 2782]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2507 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2997/30933 places, 4813/31114 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 2997 transition count 4802
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 2986 transition count 4802
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 2982 transition count 4798
Applied a total of 30 rules in 363 ms. Remains 2982 /2997 variables (removed 15) and now considering 4798/4813 (removed 15) transitions.
// Phase 1: matrix 4798 rows 2982 cols
[2024-05-24 23:57:22] [INFO ] Computed 194 invariants in 81 ms
[2024-05-24 23:57:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:24] [INFO ] Implicit Places using invariants in 2259 ms returned [1199, 1209, 1221, 2701, 2778]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2264 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2977/30933 places, 4798/31114 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 2977 transition count 4765
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 2944 transition count 4765
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 2942 transition count 4763
Applied a total of 70 rules in 414 ms. Remains 2942 /2977 variables (removed 35) and now considering 4763/4798 (removed 35) transitions.
// Phase 1: matrix 4763 rows 2942 cols
[2024-05-24 23:57:25] [INFO ] Computed 189 invariants in 132 ms
[2024-05-24 23:57:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:27] [INFO ] Implicit Places using invariants in 3000 ms returned [1152, 1185, 2656, 2693, 2708]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3005 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 2937/30933 places, 4763/31114 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 2937 transition count 4741
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 2915 transition count 4741
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 2912 transition count 4738
Applied a total of 50 rules in 469 ms. Remains 2912 /2937 variables (removed 25) and now considering 4738/4763 (removed 25) transitions.
// Phase 1: matrix 4738 rows 2912 cols
[2024-05-24 23:57:28] [INFO ] Computed 184 invariants in 128 ms
[2024-05-24 23:57:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:30] [INFO ] Implicit Places using invariants in 2528 ms returned [1170, 1192, 2658, 2674, 2705]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2531 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 2907/30933 places, 4738/31114 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 2907 transition count 4716
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 2885 transition count 4716
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 2882 transition count 4713
Applied a total of 50 rules in 222 ms. Remains 2882 /2907 variables (removed 25) and now considering 4713/4738 (removed 25) transitions.
// Phase 1: matrix 4713 rows 2882 cols
[2024-05-24 23:57:31] [INFO ] Computed 179 invariants in 96 ms
[2024-05-24 23:57:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:33] [INFO ] Implicit Places using invariants in 2702 ms returned [2597, 2608, 2639, 2650, 2666]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2706 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 2877/30933 places, 4713/31114 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 2872 transition count 4708
Applied a total of 10 rules in 342 ms. Remains 2872 /2877 variables (removed 5) and now considering 4708/4713 (removed 5) transitions.
// Phase 1: matrix 4708 rows 2872 cols
[2024-05-24 23:57:34] [INFO ] Computed 174 invariants in 133 ms
[2024-05-24 23:57:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:36] [INFO ] Implicit Places using invariants in 2421 ms returned [1176, 2597, 2608, 2624, 2635]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2428 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 2867/30933 places, 4708/31114 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 2867 transition count 4697
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 2856 transition count 4697
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 2852 transition count 4693
Applied a total of 30 rules in 219 ms. Remains 2852 /2867 variables (removed 15) and now considering 4693/4708 (removed 15) transitions.
// Phase 1: matrix 4693 rows 2852 cols
[2024-05-24 23:57:36] [INFO ] Computed 169 invariants in 78 ms
[2024-05-24 23:57:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:39] [INFO ] Implicit Places using invariants in 2203 ms returned [1084, 1127, 1148, 2621, 2632]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2208 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 2847/30933 places, 4693/31114 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 2847 transition count 4660
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 2814 transition count 4660
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 2812 transition count 4658
Applied a total of 70 rules in 348 ms. Remains 2812 /2847 variables (removed 35) and now considering 4658/4693 (removed 35) transitions.
// Phase 1: matrix 4658 rows 2812 cols
[2024-05-24 23:57:39] [INFO ] Computed 164 invariants in 125 ms
[2024-05-24 23:57:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:41] [INFO ] Implicit Places using invariants in 2312 ms returned [1078, 1083, 1112, 2565, 2583]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2316 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 9 : 2807/30933 places, 4658/31114 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 2807 transition count 4625
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 2774 transition count 4625
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 2772 transition count 4623
Applied a total of 70 rules in 309 ms. Remains 2772 /2807 variables (removed 35) and now considering 4623/4658 (removed 35) transitions.
// Phase 1: matrix 4623 rows 2772 cols
[2024-05-24 23:57:42] [INFO ] Computed 159 invariants in 117 ms
[2024-05-24 23:57:44] [INFO ] Implicit Places using invariants in 2158 ms returned [1018, 1080, 2498, 2515, 2548]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2161 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 10 : 2767/30933 places, 4623/31114 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 2767 transition count 4601
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 2745 transition count 4601
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 2742 transition count 4598
Applied a total of 50 rules in 305 ms. Remains 2742 /2767 variables (removed 25) and now considering 4598/4623 (removed 25) transitions.
// Phase 1: matrix 4598 rows 2742 cols
[2024-05-24 23:57:44] [INFO ] Computed 154 invariants in 114 ms
[2024-05-24 23:57:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:46] [INFO ] Implicit Places using invariants in 2247 ms returned [1048, 1053, 2468, 2484, 2485]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2260 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 11 : 2737/30933 places, 4598/31114 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 2737 transition count 4576
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 2715 transition count 4576
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 2712 transition count 4573
Applied a total of 50 rules in 317 ms. Remains 2712 /2737 variables (removed 25) and now considering 4573/4598 (removed 25) transitions.
// Phase 1: matrix 4573 rows 2712 cols
[2024-05-24 23:57:47] [INFO ] Computed 149 invariants in 120 ms
[2024-05-24 23:57:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:57:49] [INFO ] Implicit Places using invariants in 2044 ms returned [1017, 1024, 1044, 2484, 2496]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2048 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 12 : 2707/30933 places, 4573/31114 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 2707 transition count 4540
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 2674 transition count 4540
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 70 place count 2672 transition count 4538
Applied a total of 70 rules in 265 ms. Remains 2672 /2707 variables (removed 35) and now considering 4538/4573 (removed 35) transitions.
// Phase 1: matrix 4538 rows 2672 cols
[2024-05-24 23:57:49] [INFO ] Computed 144 invariants in 76 ms
[2024-05-24 23:57:51] [INFO ] Implicit Places using invariants in 2113 ms returned [978, 985, 1001, 2458, 2459]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2116 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 13 : 2667/30933 places, 4538/31114 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 2667 transition count 4505
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 2634 transition count 4505
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 2632 transition count 4503
Applied a total of 70 rules in 185 ms. Remains 2632 /2667 variables (removed 35) and now considering 4503/4538 (removed 35) transitions.
// Phase 1: matrix 4503 rows 2632 cols
[2024-05-24 23:57:51] [INFO ] Computed 139 invariants in 75 ms
[2024-05-24 23:57:53] [INFO ] Implicit Places using invariants in 1957 ms returned [914, 927, 965, 968, 2410]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1960 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 14 : 2627/30933 places, 4503/31114 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 2627 transition count 4459
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 2583 transition count 4459
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 90 place count 2582 transition count 4458
Applied a total of 90 rules in 249 ms. Remains 2582 /2627 variables (removed 45) and now considering 4458/4503 (removed 45) transitions.
// Phase 1: matrix 4458 rows 2582 cols
[2024-05-24 23:57:54] [INFO ] Computed 134 invariants in 108 ms
[2024-05-24 23:57:56] [INFO ] Implicit Places using invariants in 3027 ms returned [860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 2316, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2329, 2330, 2331, 2332, 2333, 2334, 2335, 2336, 2337, 2338, 2339, 2340, 2341, 2342, 2343, 2344, 2345, 2346, 2347, 2348, 2349, 2350, 2351, 2352, 2353, 2354, 2355, 2356, 2357, 2358, 2359, 2360, 2361, 2362, 2363, 2364, 2365, 2366, 2367, 2368, 2369, 2370, 2371, 2372, 2373, 2374, 2375, 2376, 2377, 2378, 2480]
Discarding 133 places :
Implicit Place search using SMT only with invariants took 3032 ms to find 133 implicit places.
Starting structural reductions in SI_LTL mode, iteration 15 : 2449/30933 places, 4458/31114 transitions.
Drop transitions removed 822 transitions
Trivial Post-agglo rules discarded 822 transitions
Performed 822 trivial Post agglomeration. Transition count delta: 822
Iterating post reduction 0 with 822 rules applied. Total rules applied 822 place count 2449 transition count 3636
Reduce places removed 822 places and 0 transitions.
Iterating post reduction 1 with 822 rules applied. Total rules applied 1644 place count 1627 transition count 3636
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 1644 place count 1627 transition count 3535
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 1846 place count 1526 transition count 3535
Applied a total of 1846 rules in 90 ms. Remains 1526 /2449 variables (removed 923) and now considering 3535/4458 (removed 923) transitions.
// Phase 1: matrix 3535 rows 1526 cols
[2024-05-24 23:57:57] [INFO ] Computed 1 invariants in 47 ms
[2024-05-24 23:57:57] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-24 23:57:57] [INFO ] Invariant cache hit.
[2024-05-24 23:57:58] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 16 : 1526/30933 places, 3535/31114 transitions.
Finished structural reductions in SI_LTL mode , in 16 iterations and 45210 ms. Remains : 1526/30933 places, 3535/31114 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s1...], 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 505 steps with 0 reset in 46 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-10 finished in 45382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 707 out of 30933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Reduce places removed 203 places and 0 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Iterating post reduction 0 with 1415 rules applied. Total rules applied 1415 place count 29518 transition count 31114
Applied a total of 1415 rules in 244 ms. Remains 29518 /30933 variables (removed 1415) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2024-05-24 23:58:00] [INFO ] Computed 1520 invariants in 1474 ms
[2024-05-24 23:58:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:58:03] [INFO ] Implicit Places using invariants in 5175 ms returned []
Implicit Place search using SMT only with invariants took 5185 ms to find 0 implicit places.
[2024-05-24 23:58:04] [INFO ] Invariant cache hit.
[2024-05-24 23:58:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:58:07] [INFO ] Dead Transitions using invariants and state equation in 3901 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/30933 places, 31114/31114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9332 ms. Remains : 29518/30933 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s15152 s15153 s15154 s15155 s15156 s15157 s15158 s15159 s15160 s15161 s15162 s15163 s15164 s15165 s15166 s15167 s15168 s15169 s15170 s15171 s1...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-13 finished in 9510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 1414 out of 30933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 0 with 203 rules applied. Total rules applied 203 place count 30730 transition count 31114
Applied a total of 203 rules in 264 ms. Remains 30730 /30933 variables (removed 203) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 30730 cols
[2024-05-24 23:58:10] [INFO ] Computed 2732 invariants in 2110 ms
[2024-05-24 23:58:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:58:14] [INFO ] Implicit Places using invariants in 5903 ms returned []
Implicit Place search using SMT only with invariants took 5906 ms to find 0 implicit places.
[2024-05-24 23:58:14] [INFO ] Invariant cache hit.
[2024-05-24 23:58:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:58:18] [INFO ] Dead Transitions using invariants and state equation in 3939 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30730/30933 places, 31114/31114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10111 ms. Remains : 30730/30933 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GT 3 (ADD s15152 s15153 s15154 s15155 s15156 s15157 s15158 s15159 s15160 s15161 s15162 s15163 s15164 s15165 s15166 s15167 s15168 s15169 s15170 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 636 steps with 0 reset in 56 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-14 finished in 10386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 304 out of 30933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Graph (complete) has 42420 edges and 30933 vertex of which 30623 are kept as prefixes of interest. Removing 310 places using SCC suffix rule.35 ms
Discarding 310 places :
Also discarding 107 output transitions
Drop transitions removed 107 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Drop transitions removed 18786 transitions
Trivial Post-agglo rules discarded 18786 transitions
Performed 18786 trivial Post agglomeration. Transition count delta: 18786
Iterating post reduction 0 with 19998 rules applied. Total rules applied 19999 place count 29310 transition count 12120
Reduce places removed 18786 places and 0 transitions.
Iterating post reduction 1 with 18786 rules applied. Total rules applied 38785 place count 10524 transition count 12120
Performed 2020 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2020 Pre rules applied. Total rules applied 38785 place count 10524 transition count 10100
Deduced a syphon composed of 2020 places in 8 ms
Ensure Unique test removed 909 places
Reduce places removed 2929 places and 0 transitions.
Iterating global reduction 2 with 4949 rules applied. Total rules applied 43734 place count 7595 transition count 10100
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 44340 place count 7595 transition count 9494
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 44946 place count 6989 transition count 9494
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 44946 place count 6989 transition count 9393
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 45148 place count 6888 transition count 9393
Discarding 3030 places :
Symmetric choice reduction at 4 with 3030 rule applications. Total rules 48178 place count 3858 transition count 6363
Iterating global reduction 4 with 3030 rules applied. Total rules applied 51208 place count 3858 transition count 6363
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 4 with 101 rules applied. Total rules applied 51309 place count 3858 transition count 6262
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 5 with 101 rules applied. Total rules applied 51410 place count 3757 transition count 6262
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 51410 place count 3757 transition count 6161
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 51612 place count 3656 transition count 6161
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 51627 place count 3641 transition count 4646
Iterating global reduction 6 with 15 rules applied. Total rules applied 51642 place count 3641 transition count 4646
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 6 with 1010 rules applied. Total rules applied 52652 place count 3338 transition count 3939
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 52854 place count 3136 transition count 3939
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 52854 place count 3136 transition count 3838
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 53056 place count 3035 transition count 3838
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 54066 place count 2025 transition count 2828
Iterating global reduction 8 with 1010 rules applied. Total rules applied 55076 place count 2025 transition count 2828
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 56086 place count 2025 transition count 1818
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 56086 place count 2025 transition count 1717
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 56389 place count 1823 transition count 1717
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 0 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 9 with 606 rules applied. Total rules applied 56995 place count 1520 transition count 1414
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 57096 place count 1419 transition count 1313
Applied a total of 57096 rules in 3265 ms. Remains 1419 /30933 variables (removed 29514) and now considering 1313/31114 (removed 29801) transitions.
// Phase 1: matrix 1313 rows 1419 cols
[2024-05-24 23:58:21] [INFO ] Computed 207 invariants in 21 ms
[2024-05-24 23:58:23] [INFO ] Implicit Places using invariants in 1852 ms returned [203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 406, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 1013, 1115]
Discarding 205 places :
Implicit Place search using SMT only with invariants took 1857 ms to find 205 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1214/30933 places, 1313/31114 transitions.
Reduce places removed 101 places and 101 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1113 transition count 1111
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 1012 transition count 1111
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 911 transition count 1010
Applied a total of 404 rules in 88 ms. Remains 911 /1214 variables (removed 303) and now considering 1010/1313 (removed 303) transitions.
// Phase 1: matrix 1010 rows 911 cols
[2024-05-24 23:58:23] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 23:58:24] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-24 23:58:24] [INFO ] Invariant cache hit.
[2024-05-24 23:58:25] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 911/30933 places, 1010/31114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6674 ms. Remains : 911/30933 places, 1010/31114 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-15 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:(LEQ 1 (ADD s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s725 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735 s736...], 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 413 steps with 0 reset in 14 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-15 finished in 6833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(p1&&X(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||X((G(p1)&&X(G(p2))))))))'
Found a Lengthening insensitive property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1326 out of 30933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Graph (complete) has 42420 edges and 30933 vertex of which 29613 are kept as prefixes of interest. Removing 1320 places using SCC suffix rule.60 ms
Discarding 1320 places :
Also discarding 1117 output transitions
Drop transitions removed 1117 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Drop transitions removed 16059 transitions
Trivial Post-agglo rules discarded 16059 transitions
Performed 16059 trivial Post agglomeration. Transition count delta: 16059
Iterating post reduction 0 with 17271 rules applied. Total rules applied 17272 place count 28300 transition count 13837
Reduce places removed 16059 places and 0 transitions.
Performed 1212 Post agglomeration using F-continuation condition.Transition count delta: 1212
Iterating post reduction 1 with 17271 rules applied. Total rules applied 34543 place count 12241 transition count 12625
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 2 with 1212 rules applied. Total rules applied 35755 place count 11029 transition count 12625
Performed 1919 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1919 Pre rules applied. Total rules applied 35755 place count 11029 transition count 10706
Deduced a syphon composed of 1919 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4747 rules applied. Total rules applied 40502 place count 8201 transition count 10706
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 808 rules applied. Total rules applied 41310 place count 8100 transition count 9999
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 42017 place count 7393 transition count 9999
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 42017 place count 7393 transition count 9898
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 42219 place count 7292 transition count 9898
Discarding 2120 places :
Symmetric choice reduction at 5 with 2120 rule applications. Total rules 44339 place count 5172 transition count 7778
Iterating global reduction 5 with 2120 rules applied. Total rules applied 46459 place count 5172 transition count 7778
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 101 rules applied. Total rules applied 46560 place count 5172 transition count 7677
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 46661 place count 5071 transition count 7677
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 46661 place count 5071 transition count 7576
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 46863 place count 4970 transition count 7576
Discarding 105 places :
Symmetric choice reduction at 7 with 105 rule applications. Total rules 46968 place count 4865 transition count 6971
Iterating global reduction 7 with 105 rules applied. Total rules applied 47073 place count 4865 transition count 6971
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 808 rules applied. Total rules applied 47881 place count 4663 transition count 6365
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 8 with 202 rules applied. Total rules applied 48083 place count 4562 transition count 6264
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 48184 place count 4461 transition count 6264
Discarding 100 places :
Symmetric choice reduction at 10 with 100 rule applications. Total rules 48284 place count 4361 transition count 6164
Ensure Unique test removed 1 places
Iterating global reduction 10 with 101 rules applied. Total rules applied 48385 place count 4360 transition count 6164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 48385 place count 4360 transition count 6163
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 48387 place count 4359 transition count 6163
Discarding 100 places :
Symmetric choice reduction at 10 with 100 rule applications. Total rules 48487 place count 4259 transition count 6063
Iterating global reduction 10 with 100 rules applied. Total rules applied 48587 place count 4259 transition count 6063
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 48587 place count 4259 transition count 6062
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 48589 place count 4258 transition count 6062
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 48791 place count 4157 transition count 5961
Applied a total of 48791 rules in 4894 ms. Remains 4157 /30933 variables (removed 26776) and now considering 5961/31114 (removed 25153) transitions.
// Phase 1: matrix 5961 rows 4157 cols
[2024-05-24 23:58:30] [INFO ] Computed 206 invariants in 64 ms
[2024-05-24 23:58:31] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-24 23:58:31] [INFO ] Invariant cache hit.
[2024-05-24 23:58:33] [INFO ] Implicit Places using invariants and state equation in 2313 ms returned [1212]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2958 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 4156/30933 places, 5961/31114 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 4156 transition count 5950
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 4145 transition count 5950
Applied a total of 22 rules in 430 ms. Remains 4145 /4156 variables (removed 11) and now considering 5950/5961 (removed 11) transitions.
// Phase 1: matrix 5950 rows 4145 cols
[2024-05-24 23:58:34] [INFO ] Computed 205 invariants in 98 ms
[2024-05-24 23:58:35] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-05-24 23:58:35] [INFO ] Invariant cache hit.
[2024-05-24 23:58:37] [INFO ] Implicit Places using invariants and state equation in 2674 ms returned [1201]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3577 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 4144/30933 places, 5950/31114 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 4144 transition count 5939
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 4133 transition count 5939
Applied a total of 22 rules in 428 ms. Remains 4133 /4144 variables (removed 11) and now considering 5939/5950 (removed 11) transitions.
// Phase 1: matrix 5939 rows 4133 cols
[2024-05-24 23:58:38] [INFO ] Computed 204 invariants in 96 ms
[2024-05-24 23:58:39] [INFO ] Implicit Places using invariants in 921 ms returned []
[2024-05-24 23:58:39] [INFO ] Invariant cache hit.
[2024-05-24 23:58:41] [INFO ] Implicit Places using invariants and state equation in 2339 ms returned [1190]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3266 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 4132/30933 places, 5939/31114 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 4132 transition count 5928
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 4121 transition count 5928
Applied a total of 22 rules in 374 ms. Remains 4121 /4132 variables (removed 11) and now considering 5928/5939 (removed 11) transitions.
// Phase 1: matrix 5928 rows 4121 cols
[2024-05-24 23:58:41] [INFO ] Computed 203 invariants in 65 ms
[2024-05-24 23:58:42] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-05-24 23:58:42] [INFO ] Invariant cache hit.
[2024-05-24 23:58:43] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 4 : 4121/30933 places, 5928/31114 transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 17253 ms. Remains : 4121/30933 places, 5928/31114 transitions.
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s3603 s3604 s3605 s3606 s3607 s3608 s3609 s3610 s3611 s3612 s3613) (ADD s2391 s2392 s2393 s2394 s2395 s2396 s2397 s2398 s2399 s2400 s2401 s24...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 729 reset in 7667 ms.
Product exploration explored 100000 steps with 730 reset in 7350 ms.
Computed a total of 4121 stabilizing places and 5928 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4121 transition count 5928
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 399 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 612 steps, including 0 resets, run visited all 5 properties in 79 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1579 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1326 out of 4121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4121/4121 places, 5928/5928 transitions.
Applied a total of 0 rules in 385 ms. Remains 4121 /4121 variables (removed 0) and now considering 5928/5928 (removed 0) transitions.
[2024-05-25 00:00:49] [INFO ] Invariant cache hit.
[2024-05-25 00:00:51] [INFO ] Implicit Places using invariants in 2457 ms returned [1179]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2460 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4120/4121 places, 5928/5928 transitions.
Applied a total of 0 rules in 303 ms. Remains 4120 /4120 variables (removed 0) and now considering 5928/5928 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3149 ms. Remains : 4120/4121 places, 5928/5928 transitions.
Computed a total of 4120 stabilizing places and 5928 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4120 transition count 5928
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 510 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 6310 steps, including 6 resets, run visited all 5 properties in 360 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 1643 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 729 reset in 7985 ms.
Product exploration explored 100000 steps with 722 reset in 7500 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 1326 out of 4120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4120/4120 places, 5928/5928 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 4120 transition count 5928
Deduced a syphon composed of 11 places in 2 ms
Applied a total of 11 rules in 476 ms. Remains 4120 /4120 variables (removed 0) and now considering 5928/5928 (removed 0) transitions.
[2024-05-25 00:02:39] [INFO ] Redundant transitions in 720 ms returned []
// Phase 1: matrix 5928 rows 4120 cols
[2024-05-25 00:02:39] [INFO ] Computed 202 invariants in 67 ms
[2024-05-25 00:02:40] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4120/4120 places, 5928/5928 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1909 ms. Remains : 4120/4120 places, 5928/5928 transitions.
Built C files in :
/tmp/ltsmin1414870656767758959
[2024-05-25 00:02:40] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1414870656767758959
Running compilation step : cd /tmp/ltsmin1414870656767758959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1414870656767758959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1414870656767758959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1326 out of 4120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4120/4120 places, 5928/5928 transitions.
Applied a total of 0 rules in 400 ms. Remains 4120 /4120 variables (removed 0) and now considering 5928/5928 (removed 0) transitions.
// Phase 1: matrix 5928 rows 4120 cols
[2024-05-25 00:02:44] [INFO ] Computed 202 invariants in 107 ms
[2024-05-25 00:02:46] [INFO ] Implicit Places using invariants in 2468 ms returned [1179]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2473 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4119/4120 places, 5928/5928 transitions.
Applied a total of 0 rules in 251 ms. Remains 4119 /4119 variables (removed 0) and now considering 5928/5928 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3125 ms. Remains : 4119/4120 places, 5928/5928 transitions.
Built C files in :
/tmp/ltsmin17554271371186726080
[2024-05-25 00:02:46] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17554271371186726080
Running compilation step : cd /tmp/ltsmin17554271371186726080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17554271371186726080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17554271371186726080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 00:02:50] [INFO ] Flatten gal took : 236 ms
[2024-05-25 00:02:50] [INFO ] Flatten gal took : 224 ms
[2024-05-25 00:02:50] [INFO ] Time to serialize gal into /tmp/LTL13859401066658693347.gal : 23 ms
[2024-05-25 00:02:50] [INFO ] Time to serialize properties into /tmp/LTL3786228242885229233.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13859401066658693347.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18048644674584702540.hoa' '-atoms' '/tmp/LTL3786228242885229233.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3786228242885229233.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18048644674584702540.hoa
Detected timeout of ITS tools.
[2024-05-25 00:03:06] [INFO ] Flatten gal took : 161 ms
[2024-05-25 00:03:06] [INFO ] Flatten gal took : 172 ms
[2024-05-25 00:03:06] [INFO ] Time to serialize gal into /tmp/LTL4202122409183359532.gal : 24 ms
[2024-05-25 00:03:06] [INFO ] Time to serialize properties into /tmp/LTL18091108412421763218.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4202122409183359532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18091108412421763218.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((m8_0+m8_1)+(m8_2+m8_3))+((m8_4+m8_5)+(m8_6+m8_7)))+((m8_8+m8_9)+m8_10))<=(((((((((((ml3_0+ml3_1)+(ml3_2+ml3_3))+((ml3_...13062
Formula 0 simplified : XF(G!"(((((m8_0+m8_1)+(m8_2+m8_3))+((m8_4+m8_5)+(m8_6+m8_7)))+((m8_8+m8_9)+m8_10))<=(((((((((((ml3_0+ml3_1)+(ml3_2+ml3_3))+((ml3_4+m...13046
Detected timeout of ITS tools.
[2024-05-25 00:03:21] [INFO ] Flatten gal took : 155 ms
[2024-05-25 00:03:21] [INFO ] Applying decomposition
[2024-05-25 00:03:21] [INFO ] Flatten gal took : 168 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16324891215607492446.txt' '-o' '/tmp/graph16324891215607492446.bin' '-w' '/tmp/graph16324891215607492446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16324891215607492446.bin' '-l' '-1' '-v' '-w' '/tmp/graph16324891215607492446.weights' '-q' '0' '-e' '0.001'
[2024-05-25 00:03:24] [INFO ] Decomposing Gal with order
[2024-05-25 00:03:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 00:03:27] [INFO ] Removed a total of 4139 redundant transitions.
[2024-05-25 00:03:27] [INFO ] Flatten gal took : 2569 ms
[2024-05-25 00:03:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1122 labels/synchronizations in 130 ms.
[2024-05-25 00:03:28] [INFO ] Time to serialize gal into /tmp/LTL4770963851940567731.gal : 30 ms
[2024-05-25 00:03:28] [INFO ] Time to serialize properties into /tmp/LTL9221808015305942231.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4770963851940567731.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9221808015305942231.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((((gu209.m8_0+gu209.m8_1)+(gu209.m8_2+gu209.m8_3))+((gu209.m8_4+gu209.m8_5)+(gu209.m8_6+gu209.m8_7)))+((gu209.m8_8+gu209....21018
Formula 0 simplified : XF(G!"(((((gu209.m8_0+gu209.m8_1)+(gu209.m8_2+gu209.m8_3))+((gu209.m8_4+gu209.m8_5)+(gu209.m8_6+gu209.m8_7)))+((gu209.m8_8+gu209.m8_...21002
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4166845453630781645
[2024-05-25 00:03:43] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4166845453630781645
Running compilation step : cd /tmp/ltsmin4166845453630781645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4166845453630781645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4166845453630781645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07 finished in 321148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Found a Lengthening insensitive property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-08
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 1818 out of 30933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30933/30933 places, 31114/31114 transitions.
Graph (complete) has 42420 edges and 30933 vertex of which 24655 are kept as prefixes of interest. Removing 6278 places using SCC suffix rule.33 ms
Discarding 6278 places :
Also discarding 5864 output transitions
Drop transitions removed 5864 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Drop transitions removed 14443 transitions
Trivial Post-agglo rules discarded 14443 transitions
Performed 14443 trivial Post agglomeration. Transition count delta: 14443
Iterating post reduction 0 with 15554 rules applied. Total rules applied 15555 place count 23443 transition count 10706
Reduce places removed 14443 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 14544 rules applied. Total rules applied 30099 place count 9000 transition count 10605
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 30200 place count 8899 transition count 10605
Performed 808 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 808 Pre rules applied. Total rules applied 30200 place count 8899 transition count 9797
Deduced a syphon composed of 808 places in 3 ms
Reduce places removed 808 places and 0 transitions.
Iterating global reduction 3 with 1616 rules applied. Total rules applied 31816 place count 8091 transition count 9797
Discarding 606 places :
Implicit places reduction removed 606 places
Iterating post reduction 3 with 606 rules applied. Total rules applied 32422 place count 7485 transition count 9797
Discarding 2020 places :
Symmetric choice reduction at 4 with 2020 rule applications. Total rules 34442 place count 5465 transition count 7777
Iterating global reduction 4 with 2020 rules applied. Total rules applied 36462 place count 5465 transition count 7777
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 36462 place count 5465 transition count 7676
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 36664 place count 5364 transition count 7676
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 36674 place count 5354 transition count 6666
Iterating global reduction 4 with 10 rules applied. Total rules applied 36684 place count 5354 transition count 6666
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 4 with 101 rules applied. Total rules applied 36785 place count 5253 transition count 6666
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 36785 place count 5253 transition count 6565
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 36987 place count 5152 transition count 6565
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 37189 place count 5051 transition count 6464
Applied a total of 37189 rules in 3600 ms. Remains 5051 /30933 variables (removed 25882) and now considering 6464/31114 (removed 24650) transitions.
// Phase 1: matrix 6464 rows 5051 cols
[2024-05-25 00:03:50] [INFO ] Computed 102 invariants in 85 ms
[2024-05-25 00:03:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:03:53] [INFO ] Implicit Places using invariants in 2688 ms returned [1229, 1240, 1270, 1280, 1291]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2693 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 5046/30933 places, 6464/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 5046 transition count 6409
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4991 transition count 6409
Applied a total of 110 rules in 584 ms. Remains 4991 /5046 variables (removed 55) and now considering 6409/6464 (removed 55) transitions.
// Phase 1: matrix 6409 rows 4991 cols
[2024-05-25 00:03:53] [INFO ] Computed 97 invariants in 84 ms
[2024-05-25 00:03:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:03:56] [INFO ] Implicit Places using invariants in 2620 ms returned [1166, 1183, 1210, 1223, 1240]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2625 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 4986/30933 places, 6409/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4986 transition count 6354
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4931 transition count 6354
Applied a total of 110 rules in 575 ms. Remains 4931 /4986 variables (removed 55) and now considering 6354/6409 (removed 55) transitions.
// Phase 1: matrix 6354 rows 4931 cols
[2024-05-25 00:03:57] [INFO ] Computed 92 invariants in 88 ms
[2024-05-25 00:03:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:03:59] [INFO ] Implicit Places using invariants in 2596 ms returned [1103, 1129, 1163, 1189, 3516]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2600 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 4926/30933 places, 6354/31114 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 4926 transition count 6310
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 4882 transition count 6310
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 88 place count 4882 transition count 6209
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 290 place count 4781 transition count 6209
Applied a total of 290 rules in 450 ms. Remains 4781 /4926 variables (removed 145) and now considering 6209/6354 (removed 145) transitions.
// Phase 1: matrix 6209 rows 4781 cols
[2024-05-25 00:04:00] [INFO ] Computed 87 invariants in 25 ms
[2024-05-25 00:04:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:02] [INFO ] Implicit Places using invariants in 1985 ms returned [1074, 1084, 1104, 1133, 1140]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1990 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 4 : 4776/30933 places, 6209/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4776 transition count 6154
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4721 transition count 6154
Applied a total of 110 rules in 434 ms. Remains 4721 /4776 variables (removed 55) and now considering 6154/6209 (removed 55) transitions.
// Phase 1: matrix 6154 rows 4721 cols
[2024-05-25 00:04:02] [INFO ] Computed 82 invariants in 30 ms
[2024-05-25 00:04:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:04] [INFO ] Implicit Places using invariants in 2382 ms returned [1015, 1044, 1054, 1062, 1069]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2386 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 5 : 4716/30933 places, 6154/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4716 transition count 6099
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4661 transition count 6099
Applied a total of 110 rules in 332 ms. Remains 4661 /4716 variables (removed 55) and now considering 6099/6154 (removed 55) transitions.
// Phase 1: matrix 6099 rows 4661 cols
[2024-05-25 00:04:05] [INFO ] Computed 77 invariants in 18 ms
[2024-05-25 00:04:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:07] [INFO ] Implicit Places using invariants in 1861 ms returned [977, 991, 999, 1005, 1024]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1864 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 6 : 4656/30933 places, 6099/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4656 transition count 6044
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4601 transition count 6044
Applied a total of 110 rules in 363 ms. Remains 4601 /4656 variables (removed 55) and now considering 6044/6099 (removed 55) transitions.
// Phase 1: matrix 6044 rows 4601 cols
[2024-05-25 00:04:07] [INFO ] Computed 72 invariants in 23 ms
[2024-05-25 00:04:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:09] [INFO ] Implicit Places using invariants in 1944 ms returned [906, 909, 931, 934, 945]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1947 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 7 : 4596/30933 places, 6044/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4596 transition count 5989
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4541 transition count 5989
Applied a total of 110 rules in 307 ms. Remains 4541 /4596 variables (removed 55) and now considering 5989/6044 (removed 55) transitions.
// Phase 1: matrix 5989 rows 4541 cols
[2024-05-25 00:04:09] [INFO ] Computed 67 invariants in 20 ms
[2024-05-25 00:04:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:11] [INFO ] Implicit Places using invariants in 2049 ms returned [840, 864, 871, 881, 882]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2054 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 8 : 4536/30933 places, 5989/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4536 transition count 5934
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4481 transition count 5934
Applied a total of 110 rules in 302 ms. Remains 4481 /4536 variables (removed 55) and now considering 5934/5989 (removed 55) transitions.
// Phase 1: matrix 5934 rows 4481 cols
[2024-05-25 00:04:12] [INFO ] Computed 62 invariants in 17 ms
[2024-05-25 00:04:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:13] [INFO ] Implicit Places using invariants in 1861 ms returned [790, 811, 822, 841, 844]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1864 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 9 : 4476/30933 places, 5934/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4476 transition count 5879
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4421 transition count 5879
Applied a total of 110 rules in 420 ms. Remains 4421 /4476 variables (removed 55) and now considering 5879/5934 (removed 55) transitions.
// Phase 1: matrix 5879 rows 4421 cols
[2024-05-25 00:04:14] [INFO ] Computed 57 invariants in 26 ms
[2024-05-25 00:04:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:16] [INFO ] Implicit Places using invariants in 1846 ms returned [728, 731, 757, 760, 766]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1849 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 10 : 4416/30933 places, 5879/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4416 transition count 5824
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4361 transition count 5824
Applied a total of 110 rules in 299 ms. Remains 4361 /4416 variables (removed 55) and now considering 5824/5879 (removed 55) transitions.
// Phase 1: matrix 5824 rows 4361 cols
[2024-05-25 00:04:16] [INFO ] Computed 52 invariants in 18 ms
[2024-05-25 00:04:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:17] [INFO ] Implicit Places using invariants in 1513 ms returned [687, 704, 706, 710, 713]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1517 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 11 : 4356/30933 places, 5824/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4356 transition count 5769
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4301 transition count 5769
Applied a total of 110 rules in 263 ms. Remains 4301 /4356 variables (removed 55) and now considering 5769/5824 (removed 55) transitions.
// Phase 1: matrix 5769 rows 4301 cols
[2024-05-25 00:04:18] [INFO ] Computed 47 invariants in 23 ms
[2024-05-25 00:04:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:19] [INFO ] Implicit Places using invariants in 985 ms returned []
[2024-05-25 00:04:19] [INFO ] Invariant cache hit.
[2024-05-25 00:04:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:20] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned [633, 645, 650, 652, 657]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 2536 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 12 : 4296/30933 places, 5769/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4296 transition count 5714
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4241 transition count 5714
Applied a total of 110 rules in 372 ms. Remains 4241 /4296 variables (removed 55) and now considering 5714/5769 (removed 55) transitions.
// Phase 1: matrix 5714 rows 4241 cols
[2024-05-25 00:04:21] [INFO ] Computed 42 invariants in 20 ms
[2024-05-25 00:04:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:22] [INFO ] Implicit Places using invariants in 1514 ms returned [563, 566, 569, 577, 595]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1517 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 13 : 4236/30933 places, 5714/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4236 transition count 5659
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4181 transition count 5659
Applied a total of 110 rules in 264 ms. Remains 4181 /4236 variables (removed 55) and now considering 5659/5714 (removed 55) transitions.
// Phase 1: matrix 5659 rows 4181 cols
[2024-05-25 00:04:22] [INFO ] Computed 37 invariants in 15 ms
[2024-05-25 00:04:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:24] [INFO ] Implicit Places using invariants in 1287 ms returned [509, 521, 524, 535, 542]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1290 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 14 : 4176/30933 places, 5659/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4176 transition count 5604
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4121 transition count 5604
Applied a total of 110 rules in 232 ms. Remains 4121 /4176 variables (removed 55) and now considering 5604/5659 (removed 55) transitions.
// Phase 1: matrix 5604 rows 4121 cols
[2024-05-25 00:04:24] [INFO ] Computed 32 invariants in 13 ms
[2024-05-25 00:04:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:25] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-05-25 00:04:25] [INFO ] Invariant cache hit.
[2024-05-25 00:04:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:26] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned [465, 469, 471, 482, 483]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1959 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 15 : 4116/30933 places, 5604/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4116 transition count 5549
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4061 transition count 5549
Applied a total of 110 rules in 222 ms. Remains 4061 /4116 variables (removed 55) and now considering 5549/5604 (removed 55) transitions.
// Phase 1: matrix 5549 rows 4061 cols
[2024-05-25 00:04:26] [INFO ] Computed 27 invariants in 12 ms
[2024-05-25 00:04:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:27] [INFO ] Implicit Places using invariants in 1295 ms returned [402, 407, 417, 421, 424]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1299 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 16 : 4056/30933 places, 5549/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4056 transition count 5494
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4001 transition count 5494
Applied a total of 110 rules in 339 ms. Remains 4001 /4056 variables (removed 55) and now considering 5494/5549 (removed 55) transitions.
// Phase 1: matrix 5494 rows 4001 cols
[2024-05-25 00:04:28] [INFO ] Computed 22 invariants in 18 ms
[2024-05-25 00:04:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:29] [INFO ] Implicit Places using invariants in 922 ms returned []
[2024-05-25 00:04:29] [INFO ] Invariant cache hit.
[2024-05-25 00:04:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:30] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned [354, 356, 359, 360, 361]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 2123 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 17 : 3996/30933 places, 5494/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 3996 transition count 5439
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 3941 transition count 5439
Applied a total of 110 rules in 203 ms. Remains 3941 /3996 variables (removed 55) and now considering 5439/5494 (removed 55) transitions.
// Phase 1: matrix 5439 rows 3941 cols
[2024-05-25 00:04:30] [INFO ] Computed 17 invariants in 11 ms
[2024-05-25 00:04:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:31] [INFO ] Implicit Places using invariants in 1131 ms returned [296, 300, 301, 302, 303]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1134 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 18 : 3936/30933 places, 5439/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 3936 transition count 5384
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 3881 transition count 5384
Applied a total of 110 rules in 433 ms. Remains 3881 /3936 variables (removed 55) and now considering 5384/5439 (removed 55) transitions.
// Phase 1: matrix 5384 rows 3881 cols
[2024-05-25 00:04:32] [INFO ] Computed 12 invariants in 15 ms
[2024-05-25 00:04:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:33] [INFO ] Implicit Places using invariants in 1081 ms returned [235, 237, 239, 240, 241]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1085 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 19 : 3876/30933 places, 5384/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 3876 transition count 5329
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 3821 transition count 5329
Applied a total of 110 rules in 183 ms. Remains 3821 /3876 variables (removed 55) and now considering 5329/5384 (removed 55) transitions.
// Phase 1: matrix 5329 rows 3821 cols
[2024-05-25 00:04:33] [INFO ] Computed 7 invariants in 14 ms
[2024-05-25 00:04:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:34] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-25 00:04:34] [INFO ] Invariant cache hit.
[2024-05-25 00:04:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:35] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned [178, 179, 181, 182, 183]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1751 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 20 : 3816/30933 places, 5329/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 3816 transition count 5274
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 3761 transition count 5274
Applied a total of 110 rules in 176 ms. Remains 3761 /3816 variables (removed 55) and now considering 5274/5329 (removed 55) transitions.
// Phase 1: matrix 5274 rows 3761 cols
[2024-05-25 00:04:35] [INFO ] Computed 2 invariants in 9 ms
[2024-05-25 00:04:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:35] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-25 00:04:35] [INFO ] Invariant cache hit.
[2024-05-25 00:04:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:36] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 21 : 3761/30933 places, 5274/31114 transitions.
Finished structural reductions in LI_LTL mode , in 21 iterations and 49908 ms. Remains : 3761/30933 places, 5274/31114 transitions.
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 3 (ADD s3155 s3156 s3157 s3158 s3159 s3160 s3161 s3162 s3163 s3164 s3165 s3166 s3167 s3168 s3169 s3170 s3171 s3172 s3173 s3174 s3175 s3176 s3177 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 82090 steps with 20570 reset in 10001 ms.
Product exploration timeout after 80970 steps with 20280 reset in 10001 ms.
Computed a total of 3761 stabilizing places and 5274 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3761 transition count 5274
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 705 steps, including 0 resets, run visited all 3 properties in 98 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 386 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 1818 out of 3761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3761/3761 places, 5274/5274 transitions.
Applied a total of 0 rules in 218 ms. Remains 3761 /3761 variables (removed 0) and now considering 5274/5274 (removed 0) transitions.
[2024-05-25 00:06:43] [INFO ] Invariant cache hit.
[2024-05-25 00:06:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:06:44] [INFO ] Implicit Places using invariants in 841 ms returned [123, 124]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 845 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3759/3761 places, 5274/5274 transitions.
Applied a total of 0 rules in 133 ms. Remains 3759 /3759 variables (removed 0) and now considering 5274/5274 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1197 ms. Remains : 3759/3761 places, 5274/5274 transitions.
Computed a total of 3759 stabilizing places and 5274 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3759 transition count 5274
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 140 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 696 steps, including 0 resets, run visited all 3 properties in 46 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 338 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration timeout after 83900 steps with 20986 reset in 10001 ms.
Product exploration timeout after 84650 steps with 21193 reset in 10002 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 1818 out of 3759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3759/3759 places, 5274/5274 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 3759 transition count 5274
Deduced a syphon composed of 22 places in 2 ms
Applied a total of 22 rules in 268 ms. Remains 3759 /3759 variables (removed 0) and now considering 5274/5274 (removed 0) transitions.
[2024-05-25 00:08:51] [INFO ] Redundant transitions in 745 ms returned []
// Phase 1: matrix 5274 rows 3759 cols
[2024-05-25 00:08:51] [INFO ] Computed 0 invariants in 9 ms
[2024-05-25 00:08:52] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3759/3759 places, 5274/5274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1642 ms. Remains : 3759/3759 places, 5274/5274 transitions.
Built C files in :
/tmp/ltsmin5407765520360366077
[2024-05-25 00:08:52] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5407765520360366077
Running compilation step : cd /tmp/ltsmin5407765520360366077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5407765520360366077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5407765520360366077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1818 out of 3759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3759/3759 places, 5274/5274 transitions.
Applied a total of 0 rules in 191 ms. Remains 3759 /3759 variables (removed 0) and now considering 5274/5274 (removed 0) transitions.
// Phase 1: matrix 5274 rows 3759 cols
[2024-05-25 00:08:55] [INFO ] Computed 0 invariants in 13 ms
[2024-05-25 00:08:56] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-25 00:08:56] [INFO ] Invariant cache hit.
[2024-05-25 00:08:57] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1956 ms to find 0 implicit places.
[2024-05-25 00:08:57] [INFO ] Invariant cache hit.
[2024-05-25 00:08:58] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2665 ms. Remains : 3759/3759 places, 5274/5274 transitions.
Built C files in :
/tmp/ltsmin9939118437196079467
[2024-05-25 00:08:58] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9939118437196079467
Running compilation step : cd /tmp/ltsmin9939118437196079467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9939118437196079467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9939118437196079467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 00:09:02] [INFO ] Flatten gal took : 154 ms
[2024-05-25 00:09:02] [INFO ] Flatten gal took : 153 ms
[2024-05-25 00:09:02] [INFO ] Time to serialize gal into /tmp/LTL17281325962917953531.gal : 23 ms
[2024-05-25 00:09:02] [INFO ] Time to serialize properties into /tmp/LTL2943872895190013515.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17281325962917953531.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14258632788827547630.hoa' '-atoms' '/tmp/LTL2943872895190013515.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2943872895190013515.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14258632788827547630.hoa
Detected timeout of ITS tools.
[2024-05-25 00:09:18] [INFO ] Flatten gal took : 146 ms
[2024-05-25 00:09:18] [INFO ] Flatten gal took : 160 ms
[2024-05-25 00:09:18] [INFO ] Time to serialize gal into /tmp/LTL16114266474226191669.gal : 23 ms
[2024-05-25 00:09:18] [INFO ] Time to serialize properties into /tmp/LTL8850462382846343082.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16114266474226191669.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8850462382846343082.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((p4_0+p4_1)+(p4_2+p4_3))+((p4_4+p4_5)+(p4_6+p4_7)))+(((p4_8+p4_9)+(p4_10+p4_11))+((p4_12+p4_13)+(p4_14+p4_15))))+((((...16291
Formula 0 simplified : G!"(((((((((((p4_0+p4_1)+(p4_2+p4_3))+((p4_4+p4_5)+(p4_6+p4_7)))+(((p4_8+p4_9)+(p4_10+p4_11))+((p4_12+p4_13)+(p4_14+p4_15))))+((((p4...16280
Detected timeout of ITS tools.
[2024-05-25 00:09:33] [INFO ] Flatten gal took : 98 ms
[2024-05-25 00:09:33] [INFO ] Applying decomposition
[2024-05-25 00:09:33] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12715369955835302384.txt' '-o' '/tmp/graph12715369955835302384.bin' '-w' '/tmp/graph12715369955835302384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12715369955835302384.bin' '-l' '-1' '-v' '-w' '/tmp/graph12715369955835302384.weights' '-q' '0' '-e' '0.001'
[2024-05-25 00:09:36] [INFO ] Decomposing Gal with order
[2024-05-25 00:09:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 00:09:39] [INFO ] Removed a total of 523 redundant transitions.
[2024-05-25 00:09:39] [INFO ] Flatten gal took : 2738 ms
[2024-05-25 00:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 49 ms.
[2024-05-25 00:09:40] [INFO ] Time to serialize gal into /tmp/LTL3264521712192759214.gal : 21 ms
[2024-05-25 00:09:40] [INFO ] Time to serialize properties into /tmp/LTL16673124971716094564.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3264521712192759214.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16673124971716094564.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((gu122.p4_0+gu122.p4_1)+(gu122.p4_2+gu122.p4_3))+((gu122.p4_4+gu122.p4_5)+(gu122.p4_6+gu122.p4_7)))+(((gu122.p4_8+gu1...27199
Formula 0 simplified : G!"(((((((((((gu122.p4_0+gu122.p4_1)+(gu122.p4_2+gu122.p4_3))+((gu122.p4_4+gu122.p4_5)+(gu122.p4_6+gu122.p4_7)))+(((gu122.p4_8+gu122...27188
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11494826776979146302
[2024-05-25 00:09:55] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11494826776979146302
Running compilation step : cd /tmp/ltsmin11494826776979146302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11494826776979146302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11494826776979146302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-08 finished in 371753 ms.
[2024-05-25 00:09:59] [INFO ] Flatten gal took : 974 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15909267432864522498
[2024-05-25 00:09:59] [INFO ] Too many transitions (31114) to apply POR reductions. Disabling POR matrices.
[2024-05-25 00:10:00] [INFO ] Built C files in 629ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15909267432864522498
Running compilation step : cd /tmp/ltsmin15909267432864522498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 00:10:00] [INFO ] Applying decomposition
[2024-05-25 00:10:01] [INFO ] Flatten gal took : 876 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5729983130305318238.txt' '-o' '/tmp/graph5729983130305318238.bin' '-w' '/tmp/graph5729983130305318238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5729983130305318238.bin' '-l' '-1' '-v' '-w' '/tmp/graph5729983130305318238.weights' '-q' '0' '-e' '0.001'
[2024-05-25 00:10:08] [INFO ] Decomposing Gal with order
[2024-05-25 00:10:29] [INFO ] Rewriting arrays to variables to allow decomposition.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15909267432864522498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15909267432864522498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 00:16:18] [INFO ] Removed a total of 8439 redundant transitions.
[2024-05-25 00:16:18] [INFO ] Flatten gal took : 8540 ms
[2024-05-25 00:16:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 3156 labels/synchronizations in 769 ms.
[2024-05-25 00:16:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality10003645879775464806.gal : 205 ms
[2024-05-25 00:16:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality6280023252436434874.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10003645879775464806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6280023252436434874.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !(((X("((((((((gi103.gu6688.l38_0+gi103.gu6688.l38_1)+(gi103.gu6688.l38_2+gi103.gu6688.l38_3))+((gi103.gu6688.l38_4+gi103.gu6688.l38_5...9035
Formula 0 simplified : X!"((((((((gi103.gu6688.l38_0+gi103.gu6688.l38_1)+(gi103.gu6688.l38_2+gi103.gu6688.l38_3))+((gi103.gu6688.l38_4+gi103.gu6688.l38_5)+...9024
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6398336 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15647628 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="FamilyReunion-COL-L00100M0010C005P005G002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FamilyReunion-COL-L00100M0010C005P005G002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280300257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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