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.r179-tall-171640601300323.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 greatspnxred
Input is FunctionPointer-PT-c128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601300323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c128-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716448757139

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 07:19:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 07:19:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:19:18] [INFO ] Load time of PNML (sax parser for PT used): 399 ms
[2024-05-23 07:19:18] [INFO ] Transformed 2826 places.
[2024-05-23 07:19:18] [INFO ] Transformed 8960 transitions.
[2024-05-23 07:19:18] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 578 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 51 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 311 place count 1317 transition count 3708
Iterating global reduction 1 with 294 rules applied. Total rules applied 605 place count 1317 transition count 3708
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 967 place count 1317 transition count 3346
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1120 place count 1164 transition count 3040
Iterating global reduction 2 with 153 rules applied. Total rules applied 1273 place count 1164 transition count 3040
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1345 place count 1164 transition count 2968
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1358 place count 1151 transition count 2942
Iterating global reduction 3 with 13 rules applied. Total rules applied 1371 place count 1151 transition count 2942
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1383 place count 1139 transition count 2918
Iterating global reduction 3 with 12 rules applied. Total rules applied 1395 place count 1139 transition count 2918
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1407 place count 1127 transition count 2894
Iterating global reduction 3 with 12 rules applied. Total rules applied 1419 place count 1127 transition count 2894
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1431 place count 1115 transition count 2870
Iterating global reduction 3 with 12 rules applied. Total rules applied 1443 place count 1115 transition count 2870
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1455 place count 1103 transition count 2846
Iterating global reduction 3 with 12 rules applied. Total rules applied 1467 place count 1103 transition count 2846
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1478 place count 1092 transition count 2824
Iterating global reduction 3 with 11 rules applied. Total rules applied 1489 place count 1092 transition count 2824
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1500 place count 1081 transition count 2802
Iterating global reduction 3 with 11 rules applied. Total rules applied 1511 place count 1081 transition count 2802
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1553 place count 1039 transition count 2646
Iterating global reduction 3 with 42 rules applied. Total rules applied 1595 place count 1039 transition count 2646
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1649 place count 985 transition count 2430
Iterating global reduction 3 with 54 rules applied. Total rules applied 1703 place count 985 transition count 2430
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1757 place count 931 transition count 2286
Iterating global reduction 3 with 54 rules applied. Total rules applied 1811 place count 931 transition count 2286
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1865 place count 877 transition count 2178
Iterating global reduction 3 with 54 rules applied. Total rules applied 1919 place count 877 transition count 2178
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1973 place count 823 transition count 2070
Iterating global reduction 3 with 54 rules applied. Total rules applied 2027 place count 823 transition count 2070
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2081 place count 769 transition count 1962
Iterating global reduction 3 with 54 rules applied. Total rules applied 2135 place count 769 transition count 1962
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2183 place count 721 transition count 1866
Iterating global reduction 3 with 48 rules applied. Total rules applied 2231 place count 721 transition count 1866
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2249 place count 703 transition count 1830
Iterating global reduction 3 with 18 rules applied. Total rules applied 2267 place count 703 transition count 1830
Applied a total of 2267 rules in 1229 ms. Remains 703 /1628 variables (removed 925) and now considering 1830/5962 (removed 4132) transitions.
[2024-05-23 07:19:20] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
// Phase 1: matrix 1231 rows 703 cols
[2024-05-23 07:19:20] [INFO ] Computed 2 invariants in 34 ms
[2024-05-23 07:19:21] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-05-23 07:19:21] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-23 07:19:21] [INFO ] Invariant cache hit.
[2024-05-23 07:19:21] [INFO ] State equation strengthened by 304 read => feed constraints.
[2024-05-23 07:19:30] [INFO ] Implicit Places using invariants and state equation in 9660 ms returned []
Implicit Place search using SMT with State Equation took 10519 ms to find 0 implicit places.
Running 1828 sub problems to find dead transitions.
[2024-05-23 07:19:30] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-23 07:19:30] [INFO ] Invariant cache hit.
[2024-05-23 07:19:31] [INFO ] State equation strengthened by 304 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1934 variables, and 2 constraints, problems are : Problem set: 0 solved, 1828 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/703 constraints, ReadFeed: 0/304 constraints, PredecessorRefiner: 1828/1828 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1828 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 3 (OVERLAPS) 1231/1934 variables, 703/705 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1934 variables, 304/1009 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1934/1934 variables, and 2837 constraints, problems are : Problem set: 0 solved, 1828 unsolved in 31648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 constraints, PredecessorRefiner: 1828/1828 constraints, Known Traps: 0/0 constraints]
After SMT, in 70362ms problems are : Problem set: 0 solved, 1828 unsolved
Search for dead transitions found 0 dead transitions in 70406ms
Starting structural reductions in LTL mode, iteration 1 : 703/1628 places, 1830/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82188 ms. Remains : 703/1628 places, 1830/5962 transitions.
Support contains 23 out of 703 places after structural reductions.
[2024-05-23 07:20:41] [INFO ] Flatten gal took : 143 ms
[2024-05-23 07:20:41] [INFO ] Flatten gal took : 96 ms
[2024-05-23 07:20:41] [INFO ] Input system was already deterministic with 1830 transitions.
RANDOM walk for 40082 steps (8 resets) in 2574 ms. (15 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40003 steps (12 resets) in 264 ms. (150 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (17 resets) in 91 ms. (434 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 102 ms. (388 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (17 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
[2024-05-23 07:20:42] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-23 07:20:42] [INFO ] Invariant cache hit.
[2024-05-23 07:20:42] [INFO ] State equation strengthened by 304 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 619/633 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1049/1682 variables, 521/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1682 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1682 variables, 303/841 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1682 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1744 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1744 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 170/1914 variables, 156/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1914 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 14/1928 variables, 7/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1928 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/1934 variables, 4/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1934 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1934 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1934/1934 variables, and 1009 constraints, problems are : Problem set: 0 solved, 3 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 619/633 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1049/1682 variables, 521/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1682 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1682 variables, 303/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1682 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1682 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 62/1744 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1744 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 170/1914 variables, 156/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1914 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/1928 variables, 7/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1928 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/1934 variables, 4/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1934 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1934 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1934/1934 variables, and 1012 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1894ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 238 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Graph (complete) has 3007 edges and 703 vertex of which 514 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.5 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 514 transition count 1452
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 391 place count 502 transition count 1428
Iterating global reduction 1 with 12 rules applied. Total rules applied 403 place count 502 transition count 1428
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 415 place count 502 transition count 1416
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 424 place count 493 transition count 1396
Iterating global reduction 2 with 9 rules applied. Total rules applied 433 place count 493 transition count 1396
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 438 place count 488 transition count 1382
Iterating global reduction 2 with 5 rules applied. Total rules applied 443 place count 488 transition count 1382
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 449 place count 482 transition count 1364
Iterating global reduction 2 with 6 rules applied. Total rules applied 455 place count 482 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 461 place count 476 transition count 1348
Iterating global reduction 2 with 6 rules applied. Total rules applied 467 place count 476 transition count 1348
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 473 place count 470 transition count 1336
Iterating global reduction 2 with 6 rules applied. Total rules applied 479 place count 470 transition count 1336
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 485 place count 464 transition count 1324
Iterating global reduction 2 with 6 rules applied. Total rules applied 491 place count 464 transition count 1324
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 498 place count 457 transition count 1306
Iterating global reduction 2 with 7 rules applied. Total rules applied 505 place count 457 transition count 1306
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 511 place count 451 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 517 place count 451 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 522 place count 446 transition count 1276
Iterating global reduction 2 with 5 rules applied. Total rules applied 527 place count 446 transition count 1276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 530 place count 443 transition count 1270
Iterating global reduction 2 with 3 rules applied. Total rules applied 533 place count 443 transition count 1270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 536 place count 440 transition count 1264
Iterating global reduction 2 with 3 rules applied. Total rules applied 539 place count 440 transition count 1264
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 542 place count 437 transition count 1258
Iterating global reduction 2 with 3 rules applied. Total rules applied 545 place count 437 transition count 1258
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 548 place count 434 transition count 1252
Iterating global reduction 2 with 3 rules applied. Total rules applied 551 place count 434 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 552 place count 433 transition count 1250
Iterating global reduction 2 with 1 rules applied. Total rules applied 553 place count 433 transition count 1250
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 559 place count 433 transition count 1244
Applied a total of 559 rules in 385 ms. Remains 433 /703 variables (removed 270) and now considering 1244/1830 (removed 586) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 433/703 places, 1244/1830 transitions.
RANDOM walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 338911 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 338911 steps, saw 207825 distinct states, run finished after 3004 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-23 07:20:48] [INFO ] Flow matrix only has 708 transitions (discarded 536 similar events)
// Phase 1: matrix 708 rows 433 cols
[2024-05-23 07:20:48] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 07:20:48] [INFO ] State equation strengthened by 81 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 224/234 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 772/1006 variables, 351/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 81/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1068 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1068 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1069 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1069 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1069 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 69/1138 variables, 69/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1138 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1141 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1141 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1141 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1141/1141 variables, and 516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 224/234 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 772/1006 variables, 351/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 81/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1068 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1068 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/1069 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1069 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1069 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 69/1138 variables, 69/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1138 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1141 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1141 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1141 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1141/1141 variables, and 518 constraints, problems are : Problem set: 0 solved, 2 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 875ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1244/1244 transitions.
Applied a total of 0 rules in 48 ms. Remains 433 /433 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 433/433 places, 1244/1244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1244/1244 transitions.
Applied a total of 0 rules in 75 ms. Remains 433 /433 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
[2024-05-23 07:20:49] [INFO ] Flow matrix only has 708 transitions (discarded 536 similar events)
[2024-05-23 07:20:49] [INFO ] Invariant cache hit.
[2024-05-23 07:20:49] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-23 07:20:49] [INFO ] Flow matrix only has 708 transitions (discarded 536 similar events)
[2024-05-23 07:20:49] [INFO ] Invariant cache hit.
[2024-05-23 07:20:50] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-23 07:20:51] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2024-05-23 07:20:51] [INFO ] Redundant transitions in 81 ms returned []
Running 1242 sub problems to find dead transitions.
[2024-05-23 07:20:51] [INFO ] Flow matrix only has 708 transitions (discarded 536 similar events)
[2024-05-23 07:20:51] [INFO ] Invariant cache hit.
[2024-05-23 07:20:51] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 3 (OVERLAPS) 708/1141 variables, 433/435 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
SMT process timed out in 34212ms, After SMT, problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 34226ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35933 ms. Remains : 433/433 places, 1244/1244 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 536 transitions
Reduce isomorphic transitions removed 536 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 433 transition count 698
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 557 place count 423 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 422 transition count 697
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 558 place count 422 transition count 621
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 710 place count 346 transition count 621
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 966 place count 218 transition count 493
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1030 place count 154 transition count 365
Iterating global reduction 3 with 64 rules applied. Total rules applied 1094 place count 154 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1095 place count 154 transition count 364
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1158 place count 91 transition count 238
Iterating global reduction 4 with 63 rules applied. Total rules applied 1221 place count 91 transition count 238
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1284 place count 28 transition count 112
Iterating global reduction 4 with 63 rules applied. Total rules applied 1347 place count 28 transition count 112
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1410 place count 28 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1410 place count 28 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1412 place count 27 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1414 place count 26 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1416 place count 25 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1417 place count 25 transition count 46
Applied a total of 1417 rules in 61 ms. Remains 25 /433 variables (removed 408) and now considering 46/1244 (removed 1198) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 46 rows 25 cols
[2024-05-23 07:21:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 07:21:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 07:21:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 07:21:25] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 07:21:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 07:21:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 07:21:25] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 07:21:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:21:25] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 07:21:25] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 07:21:25] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 154 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (p1&&G(p2))))))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 693 transition count 1810
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 693 transition count 1810
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 693 transition count 1802
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 685 transition count 1784
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 685 transition count 1784
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 679 transition count 1766
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 679 transition count 1766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 672 transition count 1744
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 672 transition count 1744
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 665 transition count 1726
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 665 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 658 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 658 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 651 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 651 transition count 1698
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 643 transition count 1678
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 643 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 636 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 636 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 147 place count 631 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 152 place count 631 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 628 transition count 1640
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 625 transition count 1634
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 625 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 622 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 622 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 619 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 618 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 618 transition count 1620
Applied a total of 178 rules in 219 ms. Remains 618 /703 variables (removed 85) and now considering 1620/1830 (removed 210) transitions.
[2024-05-23 07:21:26] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
// Phase 1: matrix 1085 rows 618 cols
[2024-05-23 07:21:26] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 07:21:26] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-23 07:21:26] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
[2024-05-23 07:21:26] [INFO ] Invariant cache hit.
[2024-05-23 07:21:26] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 07:21:28] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2410 ms to find 0 implicit places.
Running 1618 sub problems to find dead transitions.
[2024-05-23 07:21:28] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
[2024-05-23 07:21:28] [INFO ] Invariant cache hit.
[2024-05-23 07:21:28] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1703 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1703 variables, 271/891 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1703/1703 variables, and 2509 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30479 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
After SMT, in 67994ms problems are : Problem set: 0 solved, 1618 unsolved
Search for dead transitions found 0 dead transitions in 68011ms
Starting structural reductions in LTL mode, iteration 1 : 618/703 places, 1620/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70648 ms. Remains : 618/703 places, 1620/1830 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-00 finished in 71072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 690 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 680 transition count 1768
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 680 transition count 1768
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 674 transition count 1750
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 674 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 667 transition count 1730
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 667 transition count 1730
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 660 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 660 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 653 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1684
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 638 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 638 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 632 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 632 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 627 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 627 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 621 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 179 place count 618 transition count 1616
Iterating global reduction 1 with 3 rules applied. Total rules applied 182 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 185 place count 615 transition count 1610
Iterating global reduction 1 with 3 rules applied. Total rules applied 188 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 614 transition count 1608
Applied a total of 190 rules in 226 ms. Remains 614 /703 variables (removed 89) and now considering 1608/1830 (removed 222) transitions.
[2024-05-23 07:22:37] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 07:22:37] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 07:22:37] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-23 07:22:37] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 07:22:37] [INFO ] Invariant cache hit.
[2024-05-23 07:22:37] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:22:39] [INFO ] Implicit Places using invariants and state equation in 2240 ms returned []
Implicit Place search using SMT with State Equation took 2655 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 07:22:39] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 07:22:39] [INFO ] Invariant cache hit.
[2024-05-23 07:22:39] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68430ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68448ms
Starting structural reductions in LTL mode, iteration 1 : 614/703 places, 1608/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71335 ms. Remains : 614/703 places, 1608/1830 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 57677 steps with 426 reset in 491 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-01 finished in 71990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((p0||X(X(X(G(p1))))))))))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 691 transition count 1796
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 682 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 682 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 677 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 672 transition count 1742
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 672 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 667 transition count 1732
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 662 transition count 1722
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 662 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 657 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 652 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 652 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 646 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 640 transition count 1670
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 640 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 638 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 638 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 636 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 636 transition count 1662
Applied a total of 144 rules in 245 ms. Remains 636 /703 variables (removed 67) and now considering 1662/1830 (removed 168) transitions.
[2024-05-23 07:23:49] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 07:23:49] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 07:23:49] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-23 07:23:49] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:23:49] [INFO ] Invariant cache hit.
[2024-05-23 07:23:49] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 07:23:51] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 2551 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 07:23:51] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:23:51] [INFO ] Invariant cache hit.
[2024-05-23 07:23:51] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68167ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68184ms
Starting structural reductions in LTL mode, iteration 1 : 636/703 places, 1662/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70986 ms. Remains : 636/703 places, 1662/1830 transitions.
Stuttering acceptance computed with spot in 401 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-05
Product exploration explored 100000 steps with 732 reset in 512 ms.
Product exploration explored 100000 steps with 738 reset in 573 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
[2024-05-23 07:25:02] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:25:02] [INFO ] Invariant cache hit.
[2024-05-23 07:25:02] [INFO ] State equation strengthened by 272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1063ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.3 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 109 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 667037 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 667037 steps, saw 410882 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-23 07:25:06] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-23 07:25:06] [INFO ] Computed 3 invariants in 10 ms
[2024-05-23 07:25:06] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 685ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 56 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 48 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-23 07:25:07] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:25:07] [INFO ] Invariant cache hit.
[2024-05-23 07:25:07] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-23 07:25:07] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:25:07] [INFO ] Invariant cache hit.
[2024-05-23 07:25:07] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-23 07:25:08] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
[2024-05-23 07:25:08] [INFO ] Redundant transitions in 21 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-23 07:25:08] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:25:08] [INFO ] Invariant cache hit.
[2024-05-23 07:25:08] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 1268/1797 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
After SMT, in 64293ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 64306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65948 ms. Remains : 444/444 places, 1270/1270 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 32 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-23 07:26:13] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 07:26:13] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:26:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 07:26:13] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:26:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:26:13] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 07:26:13] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 07:26:13] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 96 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 399 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 17 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-23 07:26:14] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 07:26:14] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 07:26:14] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-23 07:26:14] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:26:14] [INFO ] Invariant cache hit.
[2024-05-23 07:26:14] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 07:26:16] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 2436 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 07:26:16] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:26:16] [INFO ] Invariant cache hit.
[2024-05-23 07:26:16] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30765 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68371ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68385ms
Finished structural reductions in LTL mode , in 1 iterations and 70841 ms. Remains : 636/636 places, 1662/1662 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40092 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
[2024-05-23 07:27:25] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:27:25] [INFO ] Invariant cache hit.
[2024-05-23 07:27:25] [INFO ] State equation strengthened by 272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 3 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 913 constraints, problems are : Problem set: 0 solved, 3 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1546ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 102 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
[2024-05-23 07:27:27] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-23 07:27:27] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 07:27:27] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 644ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 61 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 444/444 places, 1270/1270 transitions.
RANDOM walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675446 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 675446 steps, saw 416062 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2024-05-23 07:27:31] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:27:31] [INFO ] Invariant cache hit.
[2024-05-23 07:27:31] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 48 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 45 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-23 07:27:32] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:27:32] [INFO ] Invariant cache hit.
[2024-05-23 07:27:32] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-23 07:27:32] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:27:32] [INFO ] Invariant cache hit.
[2024-05-23 07:27:32] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-23 07:27:33] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2024-05-23 07:27:33] [INFO ] Redundant transitions in 16 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-23 07:27:33] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:27:33] [INFO ] Invariant cache hit.
[2024-05-23 07:27:33] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 1268/1797 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
After SMT, in 64577ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 64590ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66199 ms. Remains : 444/444 places, 1270/1270 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 24 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-23 07:28:38] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 07:28:38] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:28:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:28:38] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:28:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:28:38] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 07:28:38] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 07:28:38] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 568 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 415 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 719 reset in 527 ms.
Product exploration explored 100000 steps with 768 reset in 528 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 22 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-23 07:28:41] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 07:28:41] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 07:28:41] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-23 07:28:41] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:28:41] [INFO ] Invariant cache hit.
[2024-05-23 07:28:42] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 07:28:43] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 07:28:43] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:28:43] [INFO ] Invariant cache hit.
[2024-05-23 07:28:43] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 9.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)timeout

(s556 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 67731ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 67746ms
Finished structural reductions in LTL mode , in 1 iterations and 70237 ms. Remains : 636/636 places, 1662/1662 transitions.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-05 finished in 362877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 691 transition count 1794
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 682 transition count 1772
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 682 transition count 1772
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 677 transition count 1756
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 671 transition count 1738
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 671 transition count 1738
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 665 transition count 1722
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 665 transition count 1722
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 659 transition count 1710
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 659 transition count 1710
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 653 transition count 1698
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 641 transition count 1666
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 641 transition count 1666
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 140 place count 637 transition count 1658
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 637 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 635 transition count 1654
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 635 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 633 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 633 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 631 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 631 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 629 transition count 1642
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 629 transition count 1642
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 166 place count 629 transition count 1636
Applied a total of 166 rules in 524 ms. Remains 629 /703 variables (removed 74) and now considering 1636/1830 (removed 194) transitions.
[2024-05-23 07:29:52] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2024-05-23 07:29:52] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 07:29:52] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-23 07:29:52] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 07:29:52] [INFO ] Invariant cache hit.
[2024-05-23 07:29:52] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-23 07:29:54] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 2615 ms to find 0 implicit places.
[2024-05-23 07:29:54] [INFO ] Redundant transitions in 25 ms returned []
Running 1634 sub problems to find dead transitions.
[2024-05-23 07:29:54] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 07:29:54] [INFO ] Invariant cache hit.
[2024-05-23 07:29:54] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/1722 variables, and 2 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/629 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 3 (OVERLAPS) 1093/1722 variables, 629/631 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1722 variables, 270/901 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 2535 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 629/629 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
After SMT, in 68230ms problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 68243ms
Starting structural reductions in SI_LTL mode, iteration 1 : 629/703 places, 1636/1830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71415 ms. Remains : 629/703 places, 1636/1830 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-06
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-06 finished in 71570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 690 transition count 1794
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 680 transition count 1770
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 680 transition count 1770
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 673 transition count 1748
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 673 transition count 1748
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 665 transition count 1724
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 665 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 649 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 126 place count 641 transition count 1672
Iterating global reduction 1 with 8 rules applied. Total rules applied 134 place count 641 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 143 place count 632 transition count 1650
Iterating global reduction 1 with 9 rules applied. Total rules applied 152 place count 632 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 158 place count 626 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 164 place count 626 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 169 place count 621 transition count 1620
Iterating global reduction 1 with 5 rules applied. Total rules applied 174 place count 621 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 177 place count 618 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 180 place count 618 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 615 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 612 transition count 1602
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 612 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 609 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 608 transition count 1594
Applied a total of 200 rules in 225 ms. Remains 608 /703 variables (removed 95) and now considering 1594/1830 (removed 236) transitions.
[2024-05-23 07:31:03] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
// Phase 1: matrix 1066 rows 608 cols
[2024-05-23 07:31:03] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 07:31:03] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-23 07:31:03] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2024-05-23 07:31:03] [INFO ] Invariant cache hit.
[2024-05-23 07:31:04] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 07:31:05] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2024-05-23 07:31:05] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2024-05-23 07:31:05] [INFO ] Invariant cache hit.
[2024-05-23 07:31:05] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 3 (OVERLAPS) 1066/1674 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
SMT process timed out in 37494ms, After SMT, problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 37508ms
Starting structural reductions in LTL mode, iteration 1 : 608/703 places, 1594/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39982 ms. Remains : 608/703 places, 1594/1830 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 19960 steps with 146 reset in 124 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-09 finished in 40281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 690 transition count 1794
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 679 transition count 1768
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 679 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 672 transition count 1746
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 672 transition count 1746
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 664 transition count 1722
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 664 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 656 transition count 1702
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 656 transition count 1702
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 648 transition count 1686
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 648 transition count 1686
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 641 transition count 1672
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 641 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 633 transition count 1652
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 633 transition count 1652
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 627 transition count 1636
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 166 place count 623 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 170 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 172 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 174 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 176 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 178 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 180 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 182 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 615 transition count 1612
Applied a total of 186 rules in 212 ms. Remains 615 /703 variables (removed 88) and now considering 1612/1830 (removed 218) transitions.
[2024-05-23 07:31:43] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 07:31:43] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 07:31:44] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-23 07:31:44] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 07:31:44] [INFO ] Invariant cache hit.
[2024-05-23 07:31:44] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:31:45] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 07:31:45] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 07:31:45] [INFO ] Invariant cache hit.
[2024-05-23 07:31:46] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
SMT process timed out in 37770ms, After SMT, problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 37786ms
Starting structural reductions in LTL mode, iteration 1 : 615/703 places, 1612/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40200 ms. Remains : 615/703 places, 1612/1830 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 588 ms.
Product exploration explored 100000 steps with 50000 reset in 520 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c128-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c128-LTLCardinality-12 finished in 41438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((p0||X(X(X(G(p1))))))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c128-LTLCardinality-05
Stuttering acceptance computed with spot in 434 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 691 transition count 1796
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 682 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 682 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 677 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 672 transition count 1742
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 672 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 667 transition count 1732
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 662 transition count 1722
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 662 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 657 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 652 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 652 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 646 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 640 transition count 1670
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 640 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 638 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 638 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 636 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 636 transition count 1662
Applied a total of 144 rules in 293 ms. Remains 636 /703 variables (removed 67) and now considering 1662/1830 (removed 168) transitions.
[2024-05-23 07:32:25] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 07:32:25] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 07:32:26] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-23 07:32:26] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:32:26] [INFO ] Invariant cache hit.
[2024-05-23 07:32:26] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 07:32:28] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 07:32:28] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:32:28] [INFO ] Invariant cache hit.
[2024-05-23 07:32:28] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30871 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 69067ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 69080ms
Starting structural reductions in LI_LTL mode, iteration 1 : 636/703 places, 1662/1830 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71774 ms. Remains : 636/703 places, 1662/1830 transitions.
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-05
Product exploration explored 100000 steps with 734 reset in 482 ms.
Product exploration explored 100000 steps with 716 reset in 523 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40026 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-23 07:33:38] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:33:38] [INFO ] Invariant cache hit.
[2024-05-23 07:33:39] [INFO ] State equation strengthened by 272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 936ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 100 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 624755 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 624755 steps, saw 384839 distinct states, run finished after 3002 ms. (steps per millisecond=208 ) properties seen :0
[2024-05-23 07:33:43] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-23 07:33:43] [INFO ] Computed 3 invariants in 8 ms
[2024-05-23 07:33:43] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 50 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 53 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-23 07:33:43] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:33:43] [INFO ] Invariant cache hit.
[2024-05-23 07:33:44] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 07:33:44] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:33:44] [INFO ] Invariant cache hit.
[2024-05-23 07:33:44] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-23 07:33:45] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2024-05-23 07:33:45] [INFO ] Redundant transitions in 22 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-23 07:33:45] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:33:45] [INFO ] Invariant cache hit.
[2024-05-23 07:33:45] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 1268/1797 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
After SMT, in 64494ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 64506ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66114 ms. Remains : 444/444 places, 1270/1270 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 23 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-23 07:34:49] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 07:34:49] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:34:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:34:50] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:34:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:34:50] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 07:34:50] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 07:34:50] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 88 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 394 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 20 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-23 07:34:51] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 07:34:51] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 07:34:51] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-23 07:34:51] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:34:51] [INFO ] Invariant cache hit.
[2024-05-23 07:34:51] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 07:34:53] [INFO ] Implicit Places using invariants and state equation in 1965 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 07:34:53] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:34:53] [INFO ] Invariant cache hit.
[2024-05-23 07:34:53] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30729 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68675ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68689ms
Finished structural reductions in LTL mode , in 1 iterations and 71078 ms. Remains : 636/636 places, 1662/1662 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40060 steps (8 resets) in 126 ms. (315 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (14 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2024-05-23 07:36:02] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:36:02] [INFO ] Invariant cache hit.
[2024-05-23 07:36:02] [INFO ] State equation strengthened by 272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 904ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 444 transition count 1278
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 393 place count 444 transition count 1270
Applied a total of 393 rules in 95 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 670363 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 670363 steps, saw 412933 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2024-05-23 07:36:06] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-23 07:36:06] [INFO ] Computed 3 invariants in 5 ms
[2024-05-23 07:36:06] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 45 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 45 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-23 07:36:07] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:36:07] [INFO ] Invariant cache hit.
[2024-05-23 07:36:07] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-23 07:36:07] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:36:07] [INFO ] Invariant cache hit.
[2024-05-23 07:36:08] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-23 07:36:09] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
[2024-05-23 07:36:09] [INFO ] Redundant transitions in 19 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-23 07:36:09] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 07:36:09] [INFO ] Invariant cache hit.
[2024-05-23 07:36:09] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 1268/1797 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
After SMT, in 64302ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 64313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65872 ms. Remains : 444/444 places, 1270/1270 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 32 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-23 07:37:13] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 07:37:13] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:37:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:37:13] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:37:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:37:13] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 07:37:13] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 07:37:13] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 93 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 379 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 358 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 725 reset in 493 ms.
Product exploration explored 100000 steps with 732 reset in 551 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 18 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-23 07:37:15] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 07:37:15] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 07:37:16] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-23 07:37:16] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:37:16] [INFO ] Invariant cache hit.
[2024-05-23 07:37:16] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 07:37:18] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 07:37:18] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 07:37:18] [INFO ] Invariant cache hit.
[2024-05-23 07:37:18] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68165ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68181ms
Finished structural reductions in LTL mode , in 1 iterations and 70620 ms. Remains : 636/636 places, 1662/1662 transitions.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-05 finished in 361682 ms.
[2024-05-23 07:38:26] [INFO ] Flatten gal took : 61 ms
[2024-05-23 07:38:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 07:38:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 703 places, 1830 transitions and 7446 arcs took 14 ms.
Total runtime 1148496 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c128

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 703
TRANSITIONS: 1830
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.034s, Sys 0.004s]


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


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

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

Process ID: 1798
MODEL NAME: /home/mcc/execution/413/model
703 places, 1830 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-c128, 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 r179-tall-171640601300323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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